(Enter summary)
Abstract: We propose a theoretical foundation for proof reuse, based on the novel idea of a computational interpretation of type isomorphisms. (Update)
Context of citations to this paper: More
.... used in functional programming to provide a means to search functions by types [20 22, 39 42] and to match modules by specifications [7, 19]. Searching for converters between particularly complex isomorphic types raises the problem of normalizing composite functions, in order...
Cited by: More
Memoization in Type-Directed Partial Evaluation - Balat, Danvy (2002)
(Correct)
Similar documents (at the sentence level):
51.0%: Type Isomorphisms and Proof Reuse in Dependent Type Theory - Barthe, Pons (2001)
(Correct)
Active bibliography (related documents): More All
1.0: Constructor subtyping in the Calculus of Inductive.. - Barthe, van Raamsdonk (2000)
(Correct)
0.5: Type-Secure Meta-Programming - Christopher Bentley Dornan (1998)
(Correct)
0.5: Proving Equalities in a Commutative Ring Done Right in Coq - Gregoire, Mahboubi
(Correct)
Similar documents based on text: More All
0.9: Setoids in Type Theory - Barthe, Capretta, Pons (2000)
(Correct)
0.4: A Formal Executable Semantics of the JavaCard Platform - Barthe, Dufay, Jakubiec..
(Correct)
0.4: Partial Evaluation and Non-Interference for Object Calculi - Barthe, Serpette (1999)
(Correct)
Related documents from co-citation: More All
2: Type-directed partial evaluation
- Danvy
BibTeX entry: (Update)
Gilles Barthe and Olivier Pons. Type isomorphisms and proof reuse in dependent type theory. In Furio Honsell and Marino Miculan, editors, Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001, number 2030 in Lecture Notes in Computer Science, pages 57--71, Genova, Italy, April 2001. Springer-Verlag. http://citeseer.ist.psu.edu/article/barthe01type.html More
@article{ barthe01type,
author = "Gilles Barthe and Olivier Pons",
title = "Type Isomorphisms and Proof Reuse in Dependent Type Theory",
journal = "Lecture Notes in Computer Science",
volume = "2030",
pages = "57+",
year = "2001",
url = "citeseer.ist.psu.edu/article/barthe01type.html" }
Citations (may not include all citations):
342
data abstraction and polymorphism (context) - Cardelli, Wegner et al. - 1985
197
Dependent types in practical programming
- Xi, Pfenning - 1999
191
LEGO proof development system: User's manual (context) - Luo, Pollack - 1992
90
Type systems
- Cardelli - 1996
87
The PVS Proof Checker: A Reference Manual (context) - Shankar, Owre et al.
72
The Theory of LEGO: A Proof Checker for the Extended Calculu..
- Pollack - 1994
69
Cayenne: A language with dependent types
- Augustsson - 1998
64
Metamathematical investigations of a calculus of constructio.. (context) - Coquand - 1990
62
Combinatory reduction systems: Introduction and survey
- Klop, van Oostrom et al. - 1993
42
Using types as search keys in function libraries (context) - Rittri - 1991
31
Journal of Logic and Computation (context) - Luo - 1999
25
The Machine-Checked Literate Formalisation of Algebra in Typ.. (context) - Bailey - 1998
23
Typing algorithm in type theory with inheritance (context) - Saibi - 1997
16
A two-level approach towards lean proofchecking
- Barthe, Ruys et al.
14
The Coq Proof Assistant User's Guide (context) - Barras, Boutin et al. - 1999
12
Isomorphisms of types: from -calculus to information retriev.. (context) - Di Cosmo - 1995
12
Dependent Record Types and Algebraic Structures in Type Theo.. (context) - Betarte - 1998
10
Outils pour la preuve par analogie (context) - Curien - 1995
10
Implicit coercions in type systems
- Barthe
9
Generalization and reuse of tactic proofs
- Felty, Howe - 1994
8
Constructor subtyping
- Barthe, Frade - 1999
8
Universal algebra in type theory
- Capretta - 1999
7
Dependently typed records for representing mathematical stru..
- Pollack - 2000
6
Plastic: An implementation of typed LF with coercive subtypi.. (context) - Callaghan, Luo
6
volume 6 of Mathematics and its Applications (context) - Cohn - 1981
5
orie du Calcul des Constructions Inductives (context) - Werner, ta-th - 1994
5
Type inference for pure type systems (context) - Severi - 1998
3
Generalization at higher types (context) - Hasker, Reddy - 1992
3
Theoretical pearl: type-checking injective pure type systems (context) - Barthe - 1999
3
Specications as search keys for software libraries (context) - Rollins, Wing - 1991
2
Setoids in type theory
- Barthe, Capretta et al. - 2000
2
alisation d'outils d'aide au d#veloppement de grosses th#ori.. (context) - Pons - 1999
2
sentation des structures de donn #es dans Coq: le cas des en.. (context) - Magaud, Bertot - 2001
2
Proof analysis (context) - Kolbe, Walther - 1998
2
Recursive families of inductive types
- Capretta - 2000
2
A short and AEexible proof of strong normalisation for the C.. (context) - Geuvers - 1995
2
Recherche dans une biblioth#que de preuves Coq en utilisant .. (context) - Delahaye, di Cosmo et al. - 1997
2
Available from http://logica (context) - Almeida, of et al. - 1999
1
The algebraic calculus of constructions (context) - Blanqui, Jouannaud et al. - 1999
Documents on the same site (http://www-sop.inria.fr/lemme/personnel/Gilles.Barthe/publis.html): More
Constructor Subtyping - Barthe, Frade (1999)
(Correct)
Setoids in Type Theory - Barthe, Capretta, Pons (2000)
(Correct)
A Formal Executable Semantics of the JavaCard Platform - Barthe, Dufay, Jakubiec..
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC