1274 search results - page 6 / 255 » Graph lambda theories |
DAGSTUHL
2006
13 years 9 months ago
2006
In the first part, we introduce binary representations of both lambda calculus and combinatory logic terms, and demonstrate their simplicity by providing very compact parser-inter...
FPCA
1989
13 years 11 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
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...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...