194 search results - page 7 / 39 » An Introduction to the Lambda Calculus |
APAL
2008
13 years 7 months ago
2008
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
TCS
1998
13 years 7 months ago
1998
We show that unary PCF, a very small fragment of Plotkin’s PCF [?], cidable observational pre-order, and that its fully abstract model is effectively presentable. This is in ma...
ECOOP
1998
Springer
13 years 12 months ago
1998
Springer
The last few years have seen the development of statically typed object based (also called prototype-based) programming languages. Two proposals, namely the Lambda Calculus of Obje...
ASIAN
2006
Springer
13 years 11 months ago
2006
Springer
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 ...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...