Sciweavers

86 search results - page 2 / 18
» Lambda Logic
Sort
View
FOSSACS
2004
Springer
13 years 11 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
A Meta-Programming Approach to Realizing Dependently Typed Logic Programming
Dependently typed lambda calculi such as the Logical Framework (LF) can encode relationships between terms in types and can naturally capture correspondences between formulas and ...
Zachary Snow, David Baelde, Gopalan Nadathur
FOSSACS
2000
Springer
13 years 9 months ago
Constructive Data Refinement in Typed Lambda Calculus
A new treatment of data refinement in typed lambda calculus is proposed, phrased in terms of pre-logical relations [HS99] rather than logical relations, and incorporating a constru...
Furio Honsell, John Longley, Donald Sannella, Andr...
LFCS
1992
Springer
13 years 9 months ago
Strictness Logic and Polymorphic Invariance
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
P. N. Benton
CSL
2004
Springer
13 years 11 months ago
Complete Lax Logical Relations for Cryptographic Lambda-Calculi
Abstract. Security properties are profitably expressed using notions of contextual equivalence, and logical relations are a powerful proof technique to establish contextual equiva...
Jean Goubault-Larrecq, Slawomir Lasota, David Nowa...