239 search results - page 12 / 48 » The Safe Lambda Calculus |
TAPSOFT
1997
Springer
14 years 3 months ago
1997
Springer
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...
ENTCS
2008
13 years 11 months ago
2008
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...
LICS
1989
IEEE
14 years 2 months ago
1989
IEEE
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...
LFCS
2007
Springer
14 years 5 months ago
2007
Springer
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...
TLCA
2005
Springer
14 years 4 months ago
2005
Springer
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...