233 search results - page 6 / 47 » Computational Lambda-Calculus and Monads |
LFCS
2007
Springer
14 years 1 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...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
ACSC
2004
IEEE
13 years 11 months ago
2004
IEEE
The study of self-replicating structures in Computer Science has been taking place for more than half a century, motivated by the desire to understand the fundamental principles a...
ENTCS
2008
13 years 7 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'...
TLCA
2005
Springer
14 years 28 days 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...