(Enter summary)
Abstract: . 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 ChurchRosser
and strongly normalising, and supports type inference.
1 Introduction... (Update)
Context of citations to this paper: More
...solution was given. Though there is a considerable amount of work on generic programming (Ruehr, 1992; Cockett Fukushima, 1992; Jay et al. 1998) this is the rst paper we are aware of apart from PolyP (Jansson Jeuring, 1997) that aims at adding generic features to an...
...in that they only allowed to parameterize values by types of one xed kind. Two notable exceptions are Functorial ML (FML) (Jay et al. 1998) and the work of F. Ruehr (Ruehr, 1992) FML allows to quantify over functor arities in type schemes (since FML handles only...
Cited by: More
Covariant Types - Barry Jay School (1997)
(Correct)
Functorial Lambda-Calculus - Jay School Of
(Correct)
Non-uniform Recursion: The solution (minimal sorting for fold) - Wehr (2000)
(Correct)
Similar documents (at the sentence level):
57.0%: Functorial ML - Belle, Jay, Moggi (1996)
(Correct)
Active bibliography (related documents): More All
0.1: The Pattern Calculus - Jay (2003)
(Correct)
0.1: The Constructor Calculus - Jay (2003)
(Correct)
0.1: Inductive and Coinductive types with Iteration and Recursion - Geuvers (1992)
(Correct)
Similar documents based on text: More All
0.4: Monads, Shapely Functors and Traversals - Moggi, Bellè, Jay (1999)
(Correct)
0.3: Functors, Types and Shapes - Jay, Moggi, Bellè (1999)
(Correct)
0.3: Poly-dimensional Array Programming - Jay (1998)
(Correct)
Related documents from co-citation: More All
3: A theory of type polymorphism in programming (context) - Milner - 1978
3: Type inference with polymorphic recursion
- Henglein - 1993
3: A new approach to generic functional programming
- Hinze - 1999
BibTeX entry: (Update)
Jay, C., Belle, G. and Moggi, E. (1998) Functorial ML. Journal of Functional Programming 8(6):573-619. http://citeseer.ist.psu.edu/article/belle96functorial.html More
@inproceedings{ belle96functorial,
author = "Gianna Belle and C. Barry Jay and Eugenio Moggi",
title = "Functorial {ML}",
booktitle = "{PLILP}",
pages = "32-46",
year = "1996",
url = "citeseer.ist.psu.edu/article/belle96functorial.html" }
Citations (may not include all citations):
809
A theory of type polymorphism in programming (context) - Milner - 1978
729
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
382
Lambda calculi with types
- Barendregt - 1992
359
Introduction to Higher-Order Categorical Logic (context) - Lambek, Scott - 1986
268
Proofs and Types (context) - Girard, Lafont et al. - 1989
210
Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
186
Compiling polymorphism using intensional type analysis
- Harper, Morrisett - 1995
162
Unboxed objects and polymorphic typing
- Leroy - 1992
129
A system of constructor classes: overloading and implicit hi..
- Jones - 1995
64
Science of Computer Programming (context) - Jay, for - 1995
63
Theoretical Computer Science (context) - Bainbridge, Freyd et al. - 1990
55
Bananas in space: extending fold and unfold to exponential t..
- Meijer, Hutton - 1995
40
Unboxed values as first-class citizens (context) - Jones - 1991
39
Polytypic pattern matching
- Jeuring - 1995
37
A general church-rosser theorem (context) - Aczel - 1978
31
Inductive types and type constraints in the second-order lam.. (context) - Mendler - 1991
19
Introduction to bicategories (context) - Benabou - 1967
18
Technical Report (context) - Cockett, Fukushima - 1992
15
Polynomial polymorphism
- Jay - 1995
13
International Series in Computer Science (context) - Barr, Wells et al. - 1990
12
Mathematical Center Amsterdam (context) - Klop, Systems - 1980
10
Shape analysis for parallel computing
- Jay - 1995
7
On functors expressible in polymorphic lambda-calculus (context) - Reynolds, Plotkin - 1990
4
A fresh look at parametric polymorphism: covariant types
- Jay - 1996
2
Type-free term reduction for covariant types (context) - Jay
Documents on the same site (http://linus.socs.uts.edu.au/~cbj/Publications/shapes.html): More
Functors, Types and Shapes - Jay, Moggi, Bellè (1999)
(Correct)
The Essence of the Visitor Pattern - Palsberg, Jay (1997)
(Correct)
Experiments with Generic Visitors - Palsberg, Jay, Noble
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC