Information and Computation - Semantics of Data Types
Proofs and types
Logical frameworks
Handbook of logic in computer science (vol. 2)
Algorithmic definition of lambda-typed lambda calculus
Papers presented at the second annual Workshop on Logical environments
Theoretical Computer Science
The optimal implementation of functional programming languages
The optimal implementation of functional programming languages
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Mathematical Knowledge Management in HELM
Annals of Mathematics and Artificial Intelligence
Defining Lambda-Typed Lambda-Calculi by Axiomatizing the Typing Relation
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
COLOG '88 Proceedings of the International Conference on Computer Logic
PAL+: a lambda-free logical framework
Journal of Functional Programming
Typed $\lambda$-calculi with one binder
Journal of Functional Programming
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
User Interaction with the Matita Proof Assistant
Journal of Automated Reasoning
Procedural Representation of CIC Proof Terms
Journal of Automated Reasoning
Hi-index | 0.00 |
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.