Michel Mauny, François Pottier  Home/Search
Context Related
| pauillac.inria.fr/...ortmaitrise.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: pauillac.inria.fr/~fpot...pottier (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This work is based on a proposal by Laufer and Odersky [3]. They show that it is possible to add existential types to an ML-like language without even modifying its syntax. ML's strong typing properties are of course retained. We implemented their proposal into Caml-Light 0.6 [4], thus making it possible to write realistic programs using existential types. The first part of this paper describes this simple form of existential types and showss how to use them in our enhanced version of... (Update)
Context of citations to this paper: More
.... types [MP88] This style of existential quantification has been implemented in compilers for Hope [Per90] Haskell [Aug94] and CAML [MP93]. R emy [R em94] has extended Laufer and Odersky s system with universal quantification in datatypes, so that objects with polymorphic...
...collections of di erent implementations of the same abstract type. This system was implemented in the ML implementation CAML Light [63], and in the Chalmers Haskell B compiler. This mechanism also formed the basis for the implementation of existential types in the Glasgow...
Cited by: More
An Extension of HM(X) with Bounded Existential and Universal.. - Simonet (Correct)
An extension of HM(X) with first class existential and universal.. - Simonet (Correct)
Expressive Type Systems for Logic Programming Languages - Jeffery (2002) (Correct)
Active bibliography (related documents): More All
0.2: A Curry-Howard foundation for functional computation with control - Ong, Stewart (1997) (Correct)
0.2: A Generalization of Exceptions and Control in ML-like.. - Gunter, Rémy.. (1995) (Correct)
0.2: Type Classes with Existential Types - Läufer (1995) (Correct)
Similar documents based on text: More All
0.3: Proofs about a Folklore Let-Polymorphic Type Inference Algorithm - Lee, Yi (1998) (Correct)
0.3: Polymorphic Typed Defunctionalization - Pottier, Gauthier (2004) (Correct)
0.3: Numbering Matters: First-Order Canonical Forms for.. - Gauthier, Pottier (2004) (Correct)
Related documents from co-citation: More All
6: The implementation of practical functional programming languages (context) - Perry - 1991
6: Abstract Types Have Existential Type (context) - Mitchell, Plotkin - 1988
4: Putting type annotations to work - Odersky, Laufer - 1996
BibTeX entry: (Update)
M. Mauny and F. Pottier. An implementation of CAML-Light with existential types. Technical report, INRIA, Rocquencourt, October 1993. Distributed with the CAML-Light system. (pp 22, 95) http://citeseer.ist.psu.edu/mauny93implementation.html More
@techreport{ maunyimplementation,
author = "M. Mauny and Francois Pottier",
title = "An Implementation of Caml-Light with existential types",
number = "RR-2183",
pages = "16 p.",
url = "citeseer.ist.psu.edu/mauny93implementation.html" }
Citations (may not include all citations):76 DEC Systems Research Center (context) - Cardelli, Leroy et al. - 1990
11 An extension of ML with first-class abstract types (context) - Laufer, Odersky - 1992
10 Polymorphic type inference and abstract data types (context) - Laufer - 1992
4 Included in the Caml Light distribution (context) - Leroy, Light et al. - 1993
Documents on the same site (http://pauillac.inria.fr/~fpottier/biblio/pottier.html): More
Information Flow Inference For Free - Pottier, Conchon (2000) (Correct)
A 3-Part Type Inference Engine - Pottier (2000) (Correct)
Simplifying Subtyping Constraints - Pottier (1996) (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