Information retrieval in a coq proof library using type isomorphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1956, Issue , 2000, Pages 131-147

  Delahaye, David ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; DECISION THEORY; DIFFERENTIATION (CALCULUS); SET THEORY;

AXIOMATIZATION; CALCULUS OF CONSTRUCTION; CARTESIANS; CONTEXTUAL RULES; DECISION PROCEDURE; FUNCTIONAL PROGRAMS; SIMPLY TYPED LAMBDA CALCULUS;

THEOREM PROVING;

EID: 84977512961     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44557-9_8     Document Type: Conference Paper

References (18)

1. Maria-Virginia Aponte and Roberto Di Cosmo. Type isomorphisms for module signatures. In Programming Languages Implementation and Logic Programming (PLILP), volume 1140 of Lecture Notes in Computer Science, pages 334-346. Springer-Verlag, 1996.
2. Maria-Virginia Aponte, Roberto Di Cosmo, and Catherine Dubois. Signature sub-typing modulo type isomorphisms, 1998. http://www.pps.jussieu.fr/~dicosmo/ADCD97.ps.gz.
3. Andrew W. Appel et al. Standard ML of New Jersey User’s Guide. New Jersey, 1998. http://cm.bell-labs.com/cm/cs/what/smlnj/doc/index.html.
4. Bruno Barras et al. The Coq Proof Assistant Reference Manual Version 6.3.1. INRIA-Rocquencourt, May 2000. http://coq.inria.fr/doc-eng.html.
5. Dave Berry et al. Edinburgh SML. Laboratory for Foundations of Computer Science, University of Edinburgh, 1991. http://www.lfcs.informatics.ed.ac.uk/software/.
6. Kim Bruce, Roberto Di Cosmo, and Giuseppe Longo. Provable isomorphisms of type. In Mathematical Structures in Computer Science, volume 2(2), pages 231-247, 1992.
7. Roberto Di Cosmo. Isomorphisms of Types: from λ-calculus to information retrie-val and language design. Progress in Theoretical Computer Science. Birkhauser, 1995. ISBN-0-8176-3763-X.
8. M. J. C. Gordon et al. A metalanguage for interactive proof in LCF. In 5th POPL, ACM, 1978.
9. Simon Peyton Jones et al. Haskell 98, February 1999. http://www.haskell.org/definition/.
10. Thomas Kolbe and Christoph Walther. Adaptation of proofs for reuse. In Adap-tation of Knowledge for Reuse, AAAI Fall Symposium, 1995. http://www.aic.nrl.navy.mil/~aha/aaai95-fss/papers.html#kolbe.
11. Thomas Kolbe and Christoph Walther. Proof management and retrieval. In Wor- king Notes of the IJCAI Workshop, Formal Approaches to the Reuse of Plans, Proofs, and Programs, 1995. http://www.informatik.uni-freiburg.de/~koehler/ijcai-95/ijcai-ws/kolbe.ps.gz.
12. Xavier Leroy. The Caml Light system, documentation and user’s guide Re- lease 0.74. INRIA-Rocquencourt, December 1997. http://caml.inria.fr/man-caml/index.html.
13. Xavier Leroy et al. The Objective Caml system release 3.00. INRIA-Rocquencourt, April 2000. http://caml.inria.fr/ocaml/htmlman/.
14. Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, July 1990.
15. A. Mili, R. Mili, and R. T. Mittermeir. A survey of software reuse libraries. In Annals of Software Engineering, volume 5, pages 349-414, 1998.
16. Mikael Rittri. Using types as search keys in function libraries. In Journal of Functional Programming, volume 1(1), pages 171-89, 1991.
17. Sergei Soloviev. The category of finite sets and cartesian closed categories. In Journal of Soviet Mathematics, volume 22(3), pages 154-172, 1983.
18. Jerome Vouillon and Julien Jalon. CamlSearch. Master’s thesis, LIENS, 1994. http://caml.inria.fr/contribs-eng.html.