239 search results - page 5 / 48 » The Safe Lambda Calculus |
ENTCS
2002
13 years 7 months ago
2002
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
for an informal presentation at CIE 2007 [2] is a typed -calculus that pursues the reuse of the term constructions both at the level of types and at the level of contexts, while en...
MSCS
2000
13 years 7 months ago
2000
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...
TCS
2011
13 years 2 months ago
2011
A new complete characterization of β-strong normalization is given, both in the classical and in the lazy λ-calculus, through the notion of potential valuability inside two suit...
Book
"These are the lecture notes accompanying the course Introduction to Functional
Programming, which I taught at Cambridge University in the academic year 1996/1997."