See this document in CiteSeerX!

Type Theory and Rewriting (2001)  (Make Corrections)  (6 citations)
Frederic BLANQUI



  Home/Search   Context   Related

 
View or download:
loria.fr/~blanqui/papers...thesis.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  loria.fr/~blanqui/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: ng helped me to correct both errors and lack of precision. I also thank every person in the D  EMONS team from the LRI and the Coq team (newly baptized LogiCal) from the INRIA Rocquencourt, in particular Christine Paulin and Claude Marche who helped several times. These two teams are a privileged research place in a pleasant atmosphere. I also thank the referees of this thesis, Thierry Coquand and Herman Geuvers, for their interest in my work and the remarks they made for improving it.... (Update)

Similar documents based on text:   More   All
0.4:   Definitions by Rewriting in the Calculus of Constructions - Blanqui (2001)   (Correct)
0.4:   The Calculus of Algebraic and Inductive Constructions - Blanqui (1998)   (Correct)
0.4:   The Calculus of Algebraic Constructions Fr'ed'eric Blanqui - Jean-Pierre Jouannaud And   (Correct)

Related documents from co-citation:   More   All
5:   Theoretical Computer Science (context) - Jouannaud, Okada et al. - 1997
5:   Combinatory reduction systems: Introduction and survey - Klop, van Oostrom et al. - 1993
5:   Rewrite systems - Dershowitz, Jouannaud - 1990

BibTeX entry:   (Update)

F. Blanqui. Type Theory and Rewriting. PhD thesis, Univeriste Paris XI, Sept. 2001. http://citeseer.ist.psu.edu/blanqui01type.html   More

@misc{ blanqui01type,
  author = "F. Blanqui",
  title = "Type Theory and Rewriting",
  text = "F. Blanqui. Type Theory and Rewriting. PhD thesis, Univeriste Paris XI,
    Sept. 2001.",
  year = "2001",
  url = "citeseer.ist.psu.edu/blanqui01type.html" }
Citations (may not include all citations):
788   Rewrite systems - Dershowitz, Jouannaud - 1990
382   Lambda calculi with types - Barendregt - 1992
353   Term Rewriting and All That (context) - Baader, Nipkow - 1998
325   Towards a theory of type structure (context) - Reynolds - 1974
268   Proofs and Types (context) - Girard, Lafont et al. - 1988
266   Information and Computation (context) - Coquand, Huet et al. - 1988
259   Combinatory Logic (context) - Curry, Feys - 1958
251   A logic programming language with lambda-abstraction - Miller - 1989
233   The formulae-as-types notion of construction (context) - Howard - 1969
214   Orderings for term rewriting systems (context) - Dershowitz - 1982
214   Orderings for term rewriting systems (context) - Dershowitz - 1979
191   LEGO Proof Development System : User's manual (context) - Luo, Pollack
146   Investigations into logical deduction (context) - Gentzen - 1933
137   Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
126   Higher-order critical pairs (context) - Nipkow - 1991
96   An algorithm for testing conversion in type theory (context) - Coquand - 1991
95   An Extended Calculus of Constructions - Luo - 1990
83   Counterexamples to termination for the direct sum of term re.. (context) - Toyama - 1987
82   Principles of OBJ (context) - Futatsugi, Goguen et al. - 1985
79   Pattern matching with dependent types (context) - Coquand - 1992
68   Logics and Type Systems - Geuvers - 1993
62   Combinatory reduction systems : introduction and survey - Klop, van Oostrom et al. - 1993
61   Une extension de l'interpretation de Godel a l'analyse et.. (context) - Girard - 1971
59   On termination of the direct sum of term-rewriting systems (context) - Rusinowitch - 1987
50   Cambridge University Press (context) - Whitehead, Russell - 1911
45   Strong normalization in a typed lambda calculus with lambda .. (context) - Nederpelt - 1973
44   Maude: Speci cation and Programming in Rewriting Logic (context) - Clavel, Dur et al. - 1999
40   volume 133 of Studies in Logic and the Foundations of Mathem.. (context) - Geuvers, Nederpelt et al. - 1994
39   A modular proof of strong normalization for the Calculus of .. (context) - Geuvers, Nederhof - 1991
39   Introduction to generalized type systems (context) - Barendregt - 1991
38   by Iteration and Primitive Recursion on Monotone Inductive T.. (context) - Matthes, System - 1998
35   Theoretical Computer Science (context) - Blanqui, Jouannaud et al. - 2002
35   Theoretical Computer Science (context) - Jouannaud, Okada et al. - 1997
34   Automatic proofs by induction in theories without constructo.. (context) - Jouannaud, Kounalis - 1989
29   The Higher-Order Recursive Path Ordering - Jouannaud, Rubio - 1999
29   Higher-order recursive path orderings - Jouannaud, Rubio
28   Intensional interpretations of functionals of nite type (context) - Tait - 1967
27   Hierarchical termination - Dershowitz - 1994
26   Verifying process algebra proofs in type theory - Sellink - 1993
24   Theorem proving modulo - Dowek, Hardin et al. - 1998
23   An introduction to OBJ : a language for writing and testing .. (context) - Goguen, Tardo - 1979
22   The Coq Proof Assistant Reference Manual { Version - Barras, Boutin et al. - 1999
22   Proof normalization modulo - Dowek, Werner - 1998
21   Adding algebraic rewriting to the untyped lambda calculus - Dougherty - 1992
21   Adding algebraic rewriting to the untyped lambda calculus - Dougherty - 1991
20   Inductive Types and Strong Normalization (context) - Altenkirch - 1993
20   The mathematical language AUTOMATH (context) - de Bruijn - 1968
20   Studies in Logic and the Foundations of Mathematics (context) - Szabo, papers et al. - 1969
19   Computing in systems described by equations (context) - O'Donnell - 1977
18   Towards a mathematical analysis of the Coquand-Huet Calculus.. (context) - Berardi - 1988
18   A termination ordering for higher order rewrite systems - Lysne, Piris - 1995
15   Intuitionistic type theory (context) - Martin-L - 1984
14   Strong normalizability for the combined system of the typed .. (context) - Okada - 1989
13   The Calculus of Algebraic Constructions - Blanqui, Jouannaud et al. - 1999
12   Proof by induction in equational theories without constructo.. (context) - Jouannaud, Kounalis - 1986
11   Oxford University Press (context) - odel, vol - 1990
11   Topics in Automated Theorem Proving and Program Generation (context) - Hsiang - 1982
11   Modularity of strong normalization in the algebraic--cube (context) - Barbanera, Fern et al. - 1997
10   Congruence types - Barthe, Geuvers - 1995
10   Auto-validation d'un systeme de preuves avec familles induc.. (context) - Barras - 1999
10   Combining algebra and higher-order types (context) - Breazu-Tannen - 1988
9   chapter Simple word problems in universal algebra (context) - Bendix, Knuth et al. - 1970
9   s programs from proofs in the Calculus of Constructions (context) - Paulin-Mohring - 1989
9   De nitions by rewriting in the Calculus of Constructions (context) - Blanqui - 2001
8   Polymorphic rewriting conserves algebraic strong normalizati.. (context) - Breazu-Tannen, Gallier - 1991
8   Inductively de ned types (context) - Coquand, Paulin-Mohring - 1988
8   Adding algebraic rewriting to the Calculus of Constructions .. (context) - Barbanera - 1990
8   Inductive de nitions in the system Coq - rules and propertie.. (context) - Paulin-Mohring - 1993
8   Polymorphic rewriting conserves algebraic strong normalizati.. (context) - Breazu-Tannen, Gallier - 1989
7   Termination of higher-order rewrite systems (context) - Pol - 1996
7   Structural recursive de nitions in type theory (context) - Gim - 1998
7   the subject reduction property for algebraic type systems - Barthe, Melli et al. - 1996
7   Modular properties of algebraic type systems - Barthe, Geuvers - 1995
6   on Logic in Computer Science (context) - Harper, Honsell et al. - 1987
6   Information and Computation (context) - Jutting, pure et al. - 1993
6   ELAN User Manual (context) - Borovansk, Cirstea et al. - 2000
5   Normalized types - Courtieu - 2001
5   a proof checker for the Extended Calculus of Constructions (context) - Pollack, of - 1994
5   The relevance of proof-irrelevance (context) - Barthe - 1998
5   Modularity of strong normalization and con uence in the alge.. (context) - Barbanera, Fern et al. - 1994
4   Termination and con uence of higher-order rewrite systems (context) - Blanqui - 2000
4   Termination of algebraic type systems : the syntactic approa.. - Barthe, van Raamsdonk - 1997
4   Pure Types Systems with de nitions (context) - Poll, Severi - 1994
4   Properties of Typing Systems (context) - Stefanova - 1998
3   De nierbare Funktionen im {Kalkul mit Typen (context) - Schwichtenberg - 1976
3   Termination of rewriting in the Calculus of Constructions - Walukiewicz - 2000
3   Paper presented at the 1st Int (context) - Coquand, Gallier et al. - 1990
3   Executable higher-order algebraic speci cation languages (context) - Jouannaud, Okada - 1991
3   Con uence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
3   Polymorphic rewriting conserves algebraic con uence (context) - Breazu-Tannen, Gallier - 1994
3   eorie des Constructions Inductives (context) - Werner - 1994
3   A simple theory of types (context) - Church - 1940
3   Monotone xed-point types and strong normalization (context) - Matthes - 1998
3   La part du calcul (context) - Dowek - 1999
2   On theories with a combinatorial de nition of equivalence (context) - Newman - 1942
2   Modularity of termination and con uence in combinations of r.. (context) - Barbanera, Fern - 1993
2   call-by-value and the minimum problem (context) - Colson, Fredholm - 1998
2   Con uence of the lambda calculus with left-linear algebraic .. (context) - uller - 1992
2   On Girard's \Candidats de Reductibilite (context) - Gallier - 1990
1   Modular rewriting in the Calculus of Constructions (context) - Chrzaszcz - 2000
1   The Coq Development Team. The Coq Proof Assistant Reference .. (context) - Development, Coq et al.
1   rewrite and - calculus (context) - Loria-Saenz, Steinbach et al. - 1992
1   Un Calcul de Constructions in nies et son application a la .. (context) - Gim - 1996
1   A recursive path ordering for higher-order terms in eta-long.. - Jouannaud, Rubio - 1996
1   An inconsistent theory modulo de ned by a con- inria (context) - Dowek, Werner
1   Uber einer bisher noch nicht benutzte Erweiterung des niten.. (context) - odel - 1958
1   Haupsatz for the intuitionnistic theory of iterated inductiv.. (context) - Martin-L - 1971
1   Passau University (context) - Drosten, thesis - 1989
1   eles de calculs multiparadigmes fondes sur la reecriture (context) - Fern, Mod - 1993
1   overloading and parametrization in OBJ (context) - Jouannaud, Kirchner et al. - 1992
1   Combining rst and higher order rewrite systems with type ass.. (context) - Barbanera, Fern - 1993
1   A recursively de ned ordering for proving termination of ter.. (context) - Plaisted - 1978
1   Inductive De nition in Type Theory (context) - Mendler - 1987
1   Available httpwww (context) - Monate, Available et al. - 2000
1   Excluded middle without de nite descriptions in the theory o.. (context) - Seldin - 1991
1   Lambda calculus: A case for inductive de uence (context) - Matthes - 1998
1   Een nadera bewijstheoretische analyse van GSTT's (context) - Terlouw - 1989
1   Paper presented at the Int (context) - Coquand, Huet et al. - 1984



The graph only includes citing articles where the year of publication is known.

Documents on the same site (http://www.loria.fr/~blanqui/papers.html):   More
An Isabelle formalization of protocol-independent secrecy with an .. - Blanqui (2002)   (Correct)
A Type-Based Termination Criterion for Dependently-Typed.. - Blanqui (2004)   (Correct)
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003)   (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