Filters








2,247 Hits in 4.1 sec

Extending ML with semi-explicit higher-order polymorphism [chapter]

Jacques Garrigue, Didier Rémy
1997 Lecture Notes in Computer Science  
We propose a modest conservative extension to ML that allows semi-explicit higher-order polymorphism while preserving the essential properties of ML.  ...  However, the elimination of polymorphic types is now semi-implicit: only the elimination itself must be speci ed as the polymorphic type is inferred.  ...  Some higher-order functionals require polymorphic functions as arguments.  ... 
doi:10.1007/bfb0014546 fatcat:d4ituiy3z5grjft5eglacmo7wq

Semi-Explicit First-Class Polymorphism for ML

Jacques Garrigue, Didier Rémy
1999 Information and Computation  
Some higher-order functionals require polymorphic functions as arguments.  ...  We do not infer higher-order types and thus avoid higher-order uni cation, undecidable in general.  ... 
doi:10.1006/inco.1999.2830 fatcat:42xzpbmbmra65pbmw2rdq7xwii

Type inference with polymorphic recursion

Fritz Henglein
1993 ACM Transactions on Programming Languages and Systems  
Also, we conjecture that higher-order typability with small types is iVP-complete.  ...  Mycroft has extended its problematic monomorphic typing rule for recursive definitions with a polymorphic typing rule.  ... 
doi:10.1145/169701.169692 fatcat:oj2ywojinnhitliphwlbnw2uae

LEAP: A language with eval and polymorphism [chapter]

Frank Pfenning, Peter Lee
1989 Lecture Notes in Computer Science  
This does not easily extend to higher orders--only  ...  We describe the core of a new strongly-typed functional programming language called LEAP, a gL__anguage with E__val And Polymorphism. ~ Pure LEAP is an extension of the co-order polymorphic A-calculus  ...  the addition of global definitions with polymorphic kinds to F~ allowed us to extend the construction.  ... 
doi:10.1007/3-540-50940-2_46 fatcat:hv72siuy2ndnpefsnqmultgbya

Page 5864 of Mathematical Reviews Vol. , Issue 98I [page]

1998 Mathematical Reviews  
Contents: Robin Milner, Strong normalisation in higher-order action calculi (1-19); Jacques Garrigue and Didier Rémy, Extend- ing ML with semi-explicit higher-order polymorphism (20—46); Alexander Aiken  ...  Wimmers and Jens Palsberg, Optimal representations of polymorphic types with subtyping (extended ab- stract) (47-76); Zena M.  ... 

Relaxing the Value Restriction [chapter]

Jacques Garrigue
2004 Lecture Notes in Computer Science  
Restricting polymorphism to values is now the standard way to obtain soundness in ML-like programming languages with imperative features.  ...  While this solution has undeniable advantages over previous approaches, it forbids polymorphism in many cases where it would be sound.  ...  Semi-explicit polymorphism Since version 3.05, Objective Caml also includes an implementation of semi-explicit polymorphism [4] , which allows the definition of polymorphic methods in objects.  ... 
doi:10.1007/978-3-540-24754-8_15 fatcat:ew26edxnprf3ze2jd5kjbbhewy

QML

Claudio V. Russo, Dimitrios Vytiniotis
2009 Proceedings of the 2009 ACM SIGPLAN workshop on ML - ML '09  
This paper suggests a modest extension of ML with System F types: the heart of the idea is to extend the language of types with unary universal and existential quantifiers.  ...  Quantified types co-exist with ordinary ML schemes, which are in turn implicitly introduced and eliminated at let-bindings and use sites, respectively.  ...  Acknowledgements Thanks to the ML'09 anonymous reviewers for their valuable suggestions on related work, Philip Wadler for reminding us of O'Toole and Gifford's work (16) , and Simon Peyton Jones for  ... 
doi:10.1145/1596627.1596630 fatcat:ruxpndc3nvfetlkyspuw4wtxca

Page 402 of Mathematical Reviews Vol. , Issue 93a [page]

1993 Mathematical Reviews  
Several inventive construc- tions are used to this end, with the overall result that higher order objects can be captured within the same framework.  ...  of semi- automatic reasoning in view of the small and simple axiom set involved.  ... 

Simple, partial type-inference for System F based on type-containment

Didier Rémy
2005 SIGPLAN notices  
To enable type-inference, we require higher-rank polymorphism to be user-specified via type annotations on source terms.  ...  We allow implicit predicative type-containment and explicit impredicative type-instantiation. We obtain a core language that is both as expressive as System F and conservative over ML.  ...  I am also grateful to Dimitrios Vytiniotis, Stephanie Weirich, and Simon Peyton Jones for their useful feedback concerning this paper and, more generally, for discussions on type inference with typecontainment  ... 
doi:10.1145/1090189.1086383 fatcat:joscikradzgovgsq63dlnkotmm

Simple, partial type-inference for System F based on type-containment

Didier Rémy
2005 Proceedings of the tenth ACM SIGPLAN international conference on Functional programming - ICFP '05  
To enable type-inference, we require higher-rank polymorphism to be user-specified via type annotations on source terms.  ...  We allow implicit predicative type-containment and explicit impredicative type-instantiation. We obtain a core language that is both as expressive as System F and conservative over ML.  ...  I am also grateful to Dimitrios Vytiniotis, Stephanie Weirich, and Simon Peyton Jones for their useful feedback concerning this paper and, more generally, for discussions on type inference with typecontainment  ... 
doi:10.1145/1086365.1086383 dblp:conf/icfp/Remy05 fatcat:qgiiucau7vhqnhyu5fsvqdij2y

Particpants' Proceedings on the Workshop: Types for Program Analysis

Hanne Riis Nielson, Kirsten Lackner Solberg
1995 DAIMI Report Series  
be somewhat broader; consequently the call for participation listed the following areas of interest:</p><p>- specification of specific analyses for programming languages,</p><p>- the role of effects, polymorphism  ...  conjunction/disjunction types, dependent types etc.in specification of analyses,</p><p>- algorithmic tools and methods for solving general classes of type-based analyses,</p><p>- the role of unification, semi-unification  ...  Acknowledgements We gratefully acknowledge discussions with Lars Birkedal, Olivier Danvy, Joëlle Despeyroux, Andrzej Filinski, Karoline Malmkjaer, Greg Morrisett, Morten Welinder, and Hao-Chi Wong regarding  ... 
doi:10.7146/dpb.v24i493.7021 fatcat:lmukdqmlbfabppmrrnczbslyxe

MLF

Didier Le Botlan, Didier Rémy
2014 SIGPLAN notices  
We propose a type system ML F that generalizes ML with first-class polymorphism as in System F. We perform partial type reconstruction.  ...  Furthermore, all expressions of ML are well-typed, with a possibly more general type than in ML, without any need for type annotation.  ...  A first approach is to extend ML with first-class second-order polymorphism [LO94, Rém94, OL96, GR99] .  ... 
doi:10.1145/2641638.2641653 fatcat:dzbgijnperhhnn5zgcjzdisn2i

MLF

Didier Le Botlan, Didier R?my
2003 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming - ICFP '03  
We propose a type system ML F that generalizes ML with first-class polymorphism as in System F. We perform partial type reconstruction.  ...  Furthermore, all expressions of ML are well-typed, with a possibly more general type than in ML, without any need for type annotation.  ...  A first approach is to extend ML with first-class second-order polymorphism [LO94, Rém94, OL96, GR99] .  ... 
doi:10.1145/944705.944709 dblp:conf/icfp/BotlanR03 fatcat:h6kly4zfbnh5fbav4fspuuichy

MLF

Didier Le Botlan, Didier Rémy
2003 SIGPLAN notices  
We propose a type system ML F that generalizes ML with first-class polymorphism as in System F. We perform partial type reconstruction.  ...  Furthermore, all expressions of ML are well-typed, with a possibly more general type than in ML, without any need for type annotation.  ...  A first approach is to extend ML with first-class second-order polymorphism [LO94, Rém94, OL96, GR99] .  ... 
doi:10.1145/944746.944709 fatcat:qhzguadyqvdk3pxd34w3zxtnhu

Metacircularity in the polymorphic λ-calculus

Frank Pfenning, Peter Lee
1991 Theoretical Computer Science  
Lee, Metacircularity in the polymorphic A-calculus, Theoretical Computer Science 89 (1991) 137-159. *  ...  We start by showing how the second-order polymorphic A-calculus (F2) (see [12, 13, 31] ) can be represented in Fs (the third-order polymorphic A-calculus) extended with an ML-like facility for defining  ...  This allows us to build a "tower," starting with an interpreter for Fz written in F3, and then extending to all higher orders by introducing a simple extension to the w-order polymorphic A-calculus (F,  ... 
doi:10.1016/0304-3975(90)90109-u fatcat:oopib6b3djbzvpp3ra6yvvqjym
« Previous Showing results 1 — 15 out of 2,247 results