C.B. Jay, G. Bellè, E. Moggi  Home/Search
Context Related
Links: ACM DBLP | disi.unige.it/person/Mogg...jfp98.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: disi.unige.it/pers...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 Church-Rosser and strongly normalizing, and supports type inference. Several di erent... (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):
11.3%: Functorial ML - Belle, Jay, Moggi (1996) (Correct)
Active bibliography (related documents): More All
0.3: Appligraph: Applications of Graph Transformation - Final Report - Kreowski, (eds.) (2002) (Correct)
0.3: Unknown - (Correct)
0.2: Bridging the gulf: a common intermediate language.. - Jones, Launchbury.. (1998) (Correct)
Similar documents based on text: More All
0.2: Functors, Types and Shapes - Jay, Moggi, Bellè (1999) (Correct)
0.2: Monads, Shapely Functors and Traversals - Moggi, Bellè, Jay (1999) (Correct)
0.2: Closed Types for a Safe Imperative MetaML - Calcagno, Moggi, Sheard (2001) (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/jay98functorial.html More
@article{ jay98functorial,
author = "C. Barry Jay and Gianna Belle and Eugenio Moggi",
title = "Functorial {ML}",
journal = "Journal of Functional Programming",
volume = "8",
number = "6",
pages = "573-619",
year = "1998",
url = "citeseer.ist.psu.edu/jay98functorial.html" }
Citations (may not include all citations):809 A theory of type polymorphism in programming (context) - Milner - 1978 DBLP
382 Lambda calculi with types - Barendregt - 1992 ACM
359 Introduction to higher-order categorical logic (context) - Lambek, Scott - 1986
268 Proofs and Types (context) - Girard, Lafont et al. - 1989 ACM
236 Categories for the working mathematician (context) - MacLane - 1971
232 Category theory for computing science (context) - Barr, Wells - 1990
210 Functional programming with bananas (context) - Meijer, Fokkinga et al. - 1991
186 Compiling polymorphism using intensional type analysis - Harper, Morrisett - 1995 ACM DBLP
174 Combinatory reduction systems (context) - Klop - 1980 ACM
162 Unboxed objects and polymorphic typing - Leroy - 1992 ACM DBLP
129 A system of constructor classes: overloading and implicit hi.. - Jones - 1995 DBLP
112 Initial algebra semantics and continuous algebras (context) - Goguen, Thatcher et al. - 1977 ACM DBLP
87 Notions of computation and monads - Moggi - 1991 ACM DBLP
87 Operational semantics and polymorphic type inference (context) - Tofte - 1988
64 Science of computer programming (context) - Jay
63 Tag-free garbage collection using explicit type parameters - Tolmach - 1994 ACM DBLP
61 Polytypic programming - Jeuring, Jansson - 1996 ACM DBLP
55 Bananas in space: extending fold and unfold to exponential t.. - Meijer, Hutton - 1995 DBLP
50 A categorical programming language (context) - Hagino ACM
48 Calculate polytypically - Meertens - 1996
39 Polytypic pattern matching - Jeuring - 1995 ACM DBLP
39 A typed lambda calculus with categorical type constructors (context) - Hagino ACM DBLP
37 A general Church-Rosser theorem (context) - Aczel - 1978
32 Logical foundations of functional programming (context) - Huet - 1993 ACM
31 Inductive types and type constraints in the second-order lam.. (context) - Mendler - 1991 DBLP
23 Garbage collection for strongly-typed languages using run-ti.. - Aditya, Flood et al. - 1994 ACM DBLP
21 Functorial polymorphism (context) - Bainbridge, Freyd et al. - 1990 ACM DBLP
21 A monadic calculus for parallel costing of a functional lang.. - ML, Cole et al. - 1997 ACM DBLP
19 Introduction to bicategories (context) - Benabou - 1967
18 Functorial ML (context) - Jay, Moggi - 1996 ACM DBLP
18 Shape checking of array programs - Jay, Sekanina - 1997
15 Polynomial polymorphism - Jay - 1995
14 The functional imperative: shape - Jay, Steckler - 1998
10 List-arithmetic distributive categories: locoi (context) - Cockett - 1990
10 Shape analysis for parallel computing - Jay - 1995
9 Unboxed values as rst-class citizens (context) - Jones - 1991
7 On functors expressible in polymorphic lambdacalculus (context) - Reynolds, Plotkin - 1990
6 Strong categorical datatypes II: A term logic for categorica.. - Cockett, Robin - 1995 DBLP
5 Type reconstruction in nite rank fragments of the second-ord.. (context) - Kfoury, Tiuryn - 1992
4 About charity - Cockett, Fukushima - 1992
3 Mathematical structures in computer science (context) - of, on et al. - 1993
1 Covariant types - Jay - 1997 ACM DBLP
1 Programming in MartinL of's type theory:an introduction (context) - om, Petersson et al. - 1990
1 including appendices (context) - Verlag, Jay et al. - 1998
1 A semantics of compile-time re ection (context) - James, Tim - 1993
1 The lambda calculus: Its syntax and semantics (context) - science, Barendregt - 1984
1 Functional polytypic programming | use and implementation (context) - rept, Department et al. - 1997
1 Pretty Printers and PolyP (context) - Bj, Sta et al. - 1997
1 Une theorie combinatoire des series formelles (context) - Joyal - 1981
Documents on the same site (http://www.disi.unige.it/person/MoggiE/publications.html): More
The Partial Lambda-Calculus - Moggi (1988) (Correct)
Domains and Denotational Semantics: History, Accomplishments and.. - (Ed.) (1996) (Correct)
Typed Intermediate Languages for Shape-Analysis - Bellè, Moggi (1997) (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