54 search results - page 2 / 11 » A Tutorial Implementation of a Dependently Typed Lambda Calc... |
TYPES
2007
Springer
13 years 11 months ago
2007
Springer
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...
LISP
1998
13 years 5 months ago
1998
Inspired by ACTORS [7, 17], we have implemented an interpreter for a LISP-like language, SCHEME, based on the lambda calculus [2], but extended for side effects, multiprocessing, a...
TLCA
2007
Springer
13 years 11 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
POPL
1999
ACM
13 years 10 months ago
1999
ACM
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...
ENTCS
2008
13 years 5 months ago
2008
Normalization for the simply-typed -calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait'...