: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
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...
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...
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...
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