More On Implicit Syntax

Authors:
Marko Luther
Affiliations:
-
Venue:
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Year:
2001

Citing 10
Cited 1

The calculus of constructions

Information and Computation - Semantics of Data Types
Local type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proofs about a folklore let-polymorphic type inference algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-term synthesis on dependent-type systems via explicit substitutions

Theoretical Computer Science
Proof Terms for Simply Typed Higher Order Logic

TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
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
Typelab: An Environment for Modular Program Development

TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
A Comparison of PVS and Isabelle/HOL

Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
Efficient Representation and Validation of Proofs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The implicit calculus of constructions: extending pure type systems with an intersection type binder and subtyping

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications

Redundancy Elimination for LF

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proof assistants based on type theories, such as COQ and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-hoc algorithms are used to suppress subterms on output. As a result, terms might be printed identically although they differ in hidden parts. Such ambiguous representations may confuse users. Additionally, terms might be rejected by the type checker because the printer has erased too much type information. This paper addresses these problems by proposing effective erasure methods that guarantee successful term reconstruction, similar to the ones developed for the compression of proof-terms in Proof-Carrying Code environments. Experiences with the implementation in TYPELAB proved them both efficient and practical.