ACM Transactions on Computational Logic · 2009 · 10 citations · 12 references
ComputingComputer ScienceFormal MethodsLogicTheory Of ComputationFormal Language FoundationsFormal LanguagesFormal SemanticsModel TheoryType CheckingType SystemsAbbreviation RulesLambda CalculusLambda Calculus SemanticsNormalizationType InferenceType TheoryType UnificationTyped Lambda Calculus
The formal system λδ is a typed λ-calculus that pursues the unification of terms, types, environments, and contexts as the main goal. λδ takes some features from the Automath-related λ-calculi and some from the pure type systems, but differs from both in that it does not include the Π construction while it provides for an abbreviation mechanism at the level of terms. λδ enjoys some important desirable properties such as the confluence of reduction, the correctness of types, the uniqueness of types up to conversion, the subject reduction of the type assignment, the strong normalization of the typed terms, and, as a corollary, the decidability of type inference problem.
12
Lecture Notes in Artificial Intelligence
Patrick Brézillon, Paolo Bouquet · 1999 · 7.4K citations
Thierry Coquand, Gérard Huet · Information and Computation · 1988 · 1.1K citations · Full text
On the interpretation of intuitionistic number theory
S. C. Kleene · Journal of Symbolic Logic · 1945 · 540 citations
Pierre-Louis Curien, Hugo Herbelin · 2000 · 320 citations
Computing, Computer Science, Logic +10