265 search results - page 5 / 53 » Lambda calculus with patterns |
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."
LICS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...