Proofs and types
A framework for defining logics
Journal of the ACM (JACM)
Perpetual reductions in &lgr;-calculus
Information and Computation
Mode and Termination Checking for Higher-Order Logic Programs
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
A Formalization of the Strong Normalization Proof for System F in LEGO
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Termination and Reduction Checking for Higher-Order Logic Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of automated reasoning
On equivalence and canonical forms in the LF type theory
ACM Transactions on Computational Logic (TOCL)
Towards a mechanized metatheory of standard ML
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Implementing a normalizer using sized heterogeneous types
Journal of Functional Programming
Structural logical relations with case analysis and equality reasoning
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
| Hi-index | 0.00 |
Normalization for the simply-typed @l-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait's computability method does not seem to be directly usable, a syntactical proof is adapted and formalized instead. In this case study, some boundaries of Twelf current capabilities are touched and discussed.