8 search results - page 2 / 2 » The weak lambda calculus as a reasonable machine |
ICFP
2005
ACM
14 years 5 months ago
2005
ACM
We study the relation between Nominal Logic and the Theory of Contexts, two approaches for specifying and reasoning about datatypes with binders. We consider a natural-deduction s...
LICS
2007
IEEE
13 years 11 months ago
2007
IEEE
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
POPL
1989
ACM
13 years 9 months ago
1989
ACM
raction that a programming language provides influences the structure and algorithmic complexity of the resulting programs: just imagine creating an artificial intelligence engine ...