Telescopic mappings in typed lambda calculus
Information and Computation
Proof, language, and interaction
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
A Generic Normalisation Proof for Pure Type Systems
TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
The not so simple proof-irrelevant model of CC
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A Mechanized Proof of the Basic Perturbation Lemma
Journal of Automated Reasoning
Formalizing in Coq Hidden Algebras to Specify Symbolic Computation Systems
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
ACL2 Verification of Simplicial Degeneracy Programs in the Kenzo System
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Computing in coq with infinite algebraic data structures
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Effective homology of bicomplexes, formalized in Coq
Theoretical Computer Science
Formalization of a normalization theorem in simplicial topology
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
This paper reports on ongoing work on the project of representing the Kenzo system [15] in type theory [11].