Sciweavers

117 search results - page 3 / 24
» Lambda Types on the Lambda Calculus with Abbreviations
Sort
View
APAL
2008
79views more  APAL 2008»
13 years 6 months ago
Parameter-free polymorphic types
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
Klaus Aehlig
MSCS
2000
126views more  MSCS 2000»
13 years 6 months ago
Sequent combinators: a Hilbert system for the lambda calculus
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...
Healfdene Goguen, Jean Goubault-Larrecq
TYPES
2007
Springer
14 years 10 days ago
On Normalization by Evaluation for Object Calculi
We present a procedure for computing normal forms of terms in Abadi and Cardelli’s functional object calculus. Even when equipped with simple types, terms of this calculus are no...
Jan Schwinghammer
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
13 years 10 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
ICFP
2012
ACM
11 years 8 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler