Sciweavers

194 search results - page 11 / 39
» An Introduction to the Lambda Calculus
Sort
View
TAPSOFT
1997
Springer
13 years 12 months ago
A Typed Intermediate Language for Flow-Directed Compilation
We present a typed intermediate language λCIL for optimizing compilers for function-oriented and polymorphically typed programming languages (e.g., ML). The language λCIL is a ty...
J. B. Wells, Allyn Dimock, Robert Muller, Franklyn...
ENTCS
2008
126views more  ENTCS 2008»
13 years 7 months ago
Comonadic Notions of Computation
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...
Tarmo Uustalu, Varmo Vene
LICS
1989
IEEE
13 years 11 months ago
Computational Lambda-Calculus and Monads
The λ-calculus is considered an useful mathematical tool in the study of programming languages. However, if one uses βη-conversion to prove equivalence of programs, then a gros...
Eugenio Moggi
LFCS
2007
Springer
14 years 1 months ago
The Intensional Lambda Calculus
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
Sergei N. Artëmov, Eduardo Bonelli
TLCA
2005
Springer
14 years 1 months ago
Continuity and Discontinuity in Lambda Calculus
This paper studies continuity of the normal form and the context operators as functions in the infinitary lambda calculus. We consider the Scott topology on the cpo of the finite...
Paula Severi, Fer-Jan de Vries