Frederic Blanqui  Home/Search
Context Related
| loria.fr/~blanqui/pap...rta04full.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: loria.fr/~blanqui/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several authors devised type-based termination criteria for ML-like languages (polymorphic #-calculi with inductive types and case analysis), that allows non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful termination criterion for the combination of rewriting and #-reduction in the Calculus of Constructions. 1 (Update)
Cited by: More
Practical Inference for Typed-Based Termination in a.. - Barthe, Gregoire.. (Correct)
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005) (Correct)
Termination Checking with Types - Abel (1999) (Correct)
Active bibliography (related documents): More All
3.7: A Type-Based Termination Criterion for Dependently-Typed.. - Blanqui (2004) (Correct)
1.5: Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (Correct)
0.8: Inductive Types in the Calculus of Algebraic Constructions - Blanqui (2003) (Correct)
Similar documents based on text: More All
0.2: Modelling Interfaces in SDL with Gate Types - Holz (Correct)
0.2: Rewriting modulo in Deduction modulo - Blanqui (2003) (Correct)
0.1: Type-Based Analysis and Applications - Palsberg (2001) (Correct)
Related documents from co-citation: More All
4: Proving the correctness of reactive systems using sized types - Hughes, Pareto et al. - 1996
3: Dependent types in practical programming - Xi, Pfenning - 1999
3: Type-based termination of recursive de nitions (context) - Barthe, Frade et al. - 2003
BibTeX entry: (Update)
F. Blanqui. A type-based termination criterion for dependently-typed higher-order rewrite systems. In 15th International Conference on Rewriting Techniques and Applications (RTA 04), June 3 - 5, 2004. http://citeseer.ist.psu.edu/article/blanqui04typebased.html More
@misc{ blanqui04typebased,
author = "F. Blanqui",
title = "A type-based termination criterion for dependently-typed higher-order rewrite
systems",
text = "F. Blanqui. A type-based termination criterion for dependently-typed higher-order
rewrite systems. In 15th International Conference on Rewriting Techniques
and Applications (RTA 04), June 3 - 5, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/article/blanqui04typebased.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
382 Lambda calculi with types - Barendregt - 1992
266 Information and Computation (context) - Coquand, Huet et al. - 1988
110 Eliminating array bound checking through dependent types - Pfenning, Xi - 1998
83 Counterexamples to termination for the direct sum of term re.. (context) - Toyama - 1987
65 Proving the correctness of reactive systems using sized type.. - Hughes, Pareto et al. - 1996
62 Combinatory reduction systems: introduction and survey - Klop, van Oostrom et al. - 1993
59 On termination of the direct sum of term-rewriting systems (context) - Rusinowitch - 1987
44 An analysis of Girard's paradox - Coquand - 1986
43 Termination of nested and mutually recursive algorithms - Giesl - 1997
36 Termination analysis for functional programs using term orde.. - Giesl - 1995
35 Theoretical Computer Science (context) - Blanqui, Jouannaud et al. - 2002
29 The Higher-Order Recursive Path Ordering - Jouannaud, Rubio - 1999
22 Proof normalization modulo - Dowek, Werner - 1998
20 Calculating sized types - Chin, Khoo - 2001
17 Automated termination proofs with measure functions - Giesl
12 Argument-bounded algorithms as a basis for automated termina.. (context) - Walther - 1988
11 Type-based termination of recursive de nitions (context) - Barthe, Frade et al. - 2004
10 Termination checking with types - Abel - 2003
10 Termination checking with types - Abel - 2002
10 Dependent types for program termination veri cation (context) - Xi - 2001
10 Dependent types for program termination veri cation (context) - Xi - 2002
9 nitions by rewriting in the Calculus of Constructions (context) - Blanqui - 2001
9 Parametricity and variants of Girard's J operator - Harper, Mitchell - 1999
6 Rewriting modulo in Deduction modulo - Blanqui - 2003
5 Termination of rewriting in the Calculus of Constructions (context) - Walukiewicz-Chrzszcz - 2003
5 Inductive types in the Calculus of Algebraic Constructions - Blanqui - 2003
5 A bounds inference method for vector-based memoisation (context) - Chin, Hagiya - 1997
5 nitions in type theory (context) - Gimnez, de - 1998
4 Universit Paris VII (context) - Chen, Type et al. - 1998
4 Katholiecke Universiteit Nijmegen (context) - Stefanova, Typing et al. - 1998
4 Constructor subtyping in the calculus of inductive construct.. - Barthe, van Raamsdonk - 2000
4 Termination and con uence of higher-order rewrite systems (context) - Blanqui - 2000
4 nition in Type Theory (context) - Mendler - 1987
3 Dependent types with subtyping and late-bound overloading - Castagna, Chen - 2001
2 nement types for ML (context) - Freeman - 1994
2 Termination and productivity checking with continuous types - Abel - 2003
2 To appear in Mathematical Structures in Computer Science (context) - Blanqui, nitions et al. - 2003
1 cation and proof in membership equational logic (context) - Bouhoula, Jouannaud et al. - 2000
1 we prove Theorem 3 by following Chen's technique (context) - Zenger, Theoretical et al. - 1997
1 Type inference and reconstruction for rst order dependent t.. (context) - Nelson - 1995
1 nement types for logical frameworks (context) - Pfenning - 1993
1 and Interactive Theorem Proving - Towards a Uni ed Language .. (context) - Stehr, Speci - 2002
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)
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (Correct)
Inductive Types in the Calculus of Algebraic Constructions - Blanqui (2005) (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