Information Retrieval in a Coq Proof Library Using Type Isomorphisms

@inproceedings{Delahaye1999InformationRI,
  title={Information Retrieval in a Coq Proof Library Using Type Isomorphisms},
  author={D. Delahaye},
  booktitle={TYPES},
  year={1999}
}
We propose a method to search for a lemma in a Coq proof library by using the lemma type as a key. The method is based on the concept of type isomorphism developed within the functional programming framework. We introduce a theory which is a generalization of the axiomatization for the simply typed λ-calculus (associated with Closed Cartesian Categories) to an Extended Calculus of Constructions with a more Extensional conversion rule. We show a soundness theorem for this theory but we notice… Expand
Isomorphisms of simple inductive types through extensional rewriting
  • D. Chemouil
  • Mathematics, Computer Science
  • Mathematical Structures in Computer Science
  • 2005
A Calculus of Constructions with Explicit Subtyping
  • Ali Assaf
  • Computer Science, Mathematics
  • TYPES
  • 2014
Some Algebraic Structures in Lambda-Calculus with Inductive Types
Information Retrieval in MML
Integrating Searching and Authoring in Mizar
Complete completion using types and weights
...
1
2
3
...

References

SHOWING 1-10 OF 20 REFERENCES
Provable Isomorphisms of Types
Isomorphisms of Types
  • R. D. Cosmo
  • Computer Science
  • Progress in Theoretical Computer Science
  • 1995
An extended calculus of constructions
Proof management and retrieval
The category of finite sets and Cartesian closed categories
Adaptation of Proofs for Reuse
ECC, an extended calculus of constructions
  • Z. Luo
  • Mathematics, Computer Science
  • [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science
  • 1989
A Metalanguage for interactive proof in LCF
Type Isomorphisms for Module Signatures
...
1
2
...