86 search results - page 6 / 18 » Lambda Logic |
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'...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Dependently typed -calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types"...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...