1914 search results - page 7 / 383 » Abstract lambda-Calculus Machines |
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
ESOP
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
POPL
1996
ACM
13 years 11 months ago
1996
ACM
Region Inference is a technique for implementing programming languages that are based on typed call-by-value lambda calculus, such as Standard ML. The mathematical runtime model o...