PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
A framework for defining logics
Journal of the ACM (JACM)
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
Algorithms for Equality and Unification in the Presence of Notational Definitions
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Efficient Representation and Validation of Proofs
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A meta-programming approach to realizing dependently typed logic programming
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
We present a type system extending the dependent type theory LF, whose terms are more amenable to compact representation. This is achieved by carefully omitting certain subterms which are redundant in the sense that they can be recovered from the types of other subterms. This system is capable of omitting more redundant information than previous work in the same vein, because of its uniform treatment of higher-order and first-order terms. Moreover the 'recipe' for reconstruction of omitted information is encoded directly into annotations on the types in a signature. This brings to light connections between bidirectional (synthesis vs. checking) typing algorithms of the object language on the one hand, and the bidirectional flow of information in the ambient encoding language. The resulting system is a compromise seeking to retain both the effectiveness of full unification-based term reconstruction such as is found in implementation practice, and the logical simplicity of pure LF.