Sciweavers

429 search results - page 10 / 86
» Parameter-free polymorphic types
Sort
View
GI
2009
Springer
15 years 2 months ago
Reasoning about Contextual Equivalence: From Untyped to Polymorphically Typed Calculi
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
David Sabel, Manfred Schmidt-Schauß, Frederi...
97
Voted
JFP
2002
108views more  JFP 2002»
14 years 9 months ago
A calculus with polymorphic and polyvariant flow types
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn...
LICS
1989
IEEE
15 years 1 months ago
Faithful Ideal Models for Recursive Polymorphic Types
We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yiel...
Martín Abadi, Benjamin C. Pierce, Gordon D....
JFP
2008
135views more  JFP 2008»
14 years 9 months ago
Hoare type theory, polymorphism and separation
We consider the problem of reconciling a dependently typed functional language with imperative features such as mutable higher-order state, pointer aliasing, and non-termination. ...
Aleksandar Nanevski, J. Gregory Morrisett, Lars Bi...
ICFP
2006
ACM
15 years 9 months ago
Polymorphism and separation in hoare type theory
In previous work, we proposed a Hoare Type Theory (HTT) which combines effectful higher-order functions, dependent types and Hoare Logic specifications into a unified framework. H...
Aleksandar Nanevski, Greg Morrisett, Lars Birkedal