An algorithm for testing conversion in type theory
Logical frameworks
A framework for defining logics
Journal of the ACM (JACM)
An algorithm for type-checking dependent types
Science of Computer Programming - Special issue on mathematics of program construction
Handbook of logic in computer science
Soundness of the Logical Framework for Its Typed Operational Semantics
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
On equivalence and canonical forms in the LF type theory
ACM Transactions on Computational Logic (TOCL)
A logical framework with dependently typed records
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Justifying algorithms for βη-conversion
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Connecting a logical framework to a first-order logic prover
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
| Hi-index | 0.00 |
An untyped algorithm to test βη-equality for Martin-Löf's Logical Framework with strong Σ -types is presented and proven complete using a model of partial equivalence relations between untyped terms.