Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-27T18:23:45.202Z Has data issue: false hasContentIssue false
  • English
  • Français

Functorial ML

Published online by Cambridge University Press:  01 November 1998

C. B. JAY ,
G. BELLÈ  and
E. MOGGI
C. B. JAY
Affiliation:
School of Computing Sciences, University of Technology, Sydney, P.O. Box 123 Broadway, 2007, Australia (e-mail: [email protected])
G. BELLÈ
Affiliation:
Dipartimento di Informatica, Università di Genova, via Dodecaneso 35, 16146 Genova, Italy (e-mail: gbelle,[email protected])
E. MOGGI
Affiliation:
Dipartimento di Informatica, Università di Genova, via Dodecaneso 35, 16146 Genova, Italy (e-mail: gbelle,[email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We present an extension of the Hindley–Milner type system that supports a generous class of type constructors called functors, and provide a parametrically polymorphic algorithm for their mapping, i.e. for applying a function to each datum appearing in a value of constructed type. The algorithm comes from shape theory, which provides a uniform method for locating data within a shape. The resulting system is Church–Rosser and strongly normalizing, and supports type inference. Several different semantics are possible, which affects the choice of constants in the language, and are used to illustrate the relationship to polytypic programming.

Type
Research Article
Information
Journal of Functional Programming , Volume 8 , Issue 6 , November 1998 , pp. 573 - 619
Copyright
© 1998 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.