Frederic Blanqui  Home/Search
Context Related
| loria.fr/~blanqui/papers/fi05.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: In a previous work, we proved that an important part of the Calculus of Inductive Constructions (CIC), the basis of the Coq proof assistant, can be seen as a Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions with functions and predicates defined by higher-order rewrite rules. In this paper, we prove that almost all CIC can be seen as a CAC, and that it can be further extended with non-strictly positive types and inductive-recursive types together with... (Update)
Cited by: More
A Type-Based Termination Criterion for Dependently-Typed.. - Blanqui (2004) (Correct)
Decidability of Type-checking in the Calculus of Algebraic.. - Blanqui (2005) (Correct)
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (Correct)
Active bibliography (related documents): More All
1.4: Inductive Types in the Calculus of Algebraic Constructions - Blanqui (2003) (Correct)
0.5: On the Confluence of λ-Calculus with Conditional.. - Blanqui, Kirchner, Riba (Correct)
0.4: Type Theory and Rewriting - BLANQUI (2001) (Correct)
Similar documents based on text: More All
0.2: Optimal Routing Policy in Two Deterministic Queues - Gaujal, Hyon (2000) (Correct)
0.2: An Open Automated Framework for Constraint Solver.. - Monfroy, Ringeissen (1999) (Correct)
0.2: The Watershed Transform: Definitions, Algorithms and.. - Roerdink, Meijster (2000) (Correct)
Related documents from co-citation: More All
5: The higher-order recursive path ordering - Jouannaud, Rubio - 1999
5: Rewrite systems - Dershowitz, Jouannaud - 1990
5: Rewriting modulo in deduction modulo - Blanqui - 2003
BibTeX entry: (Update)
F. Blanqui. Inductive types in the Calculus of Algebraic Constructions. In and Applications, Lecture Notes in Computer Science 2701, 2003. http://citeseer.ist.psu.edu/article/blanqui05inductive.html More
@misc{ blanqui03inductive,
author = "F. Blanqui",
title = "Inductive types in the Calculus of Algebraic Constructions",
text = "F. Blanqui. Inductive types in the Calculus of Algebraic Constructions.
In and Applications, Lecture Notes in Computer Science 2701, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/article/blanqui05inductive.html" }
Citations (may not include all citations):788 Rewrite Systems - Dershowitz, Jouannaud - 1990
382 Lambda Calculi with types - Barendregt - 1992
268 Proofs and Types (context) - Girard, Lafont et al. - 1988
266 Information and Computation (context) - Coquand, Huet - 1988
83 Counterexamples to termination for the direct sum of term re.. (context) - Toyama - 1987
73 Inductively defined types (context) - Coquand, Paulin-Mohring - 1988
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
45 Strong normalization in a typed lambda calculus with lambda .. (context) - Nederpelt - 1973
44 An Analysis of Girard's Paradox - Coquand - 1986
38 by Iteration and Primitive Recursion on Monotone Inductive T.. (context) - Matthes, Extensions - 1998
35 Theoretical Computer Science (context) - Jouannaud, Okada - 1997
28 Executable Higher-Order Algebraic Specification Languages (context) - Jouannaud, Okada - 1991
26 Modularity of strong normalization and confluence in the alg.. - Barbanera, Fernndez et al. - 1994
25 A general formulation of simultaneous inductive-recursive de.. - Dybjer - 2000
21 Inductive Definition in Type Theory (context) - Mendler - 1987
18 Dependently typed functional programs and their proofs - McBride - 1999
14 Strong Normalizability for the Combined System of the Typed .. (context) - Okada - 1989
10 Confluence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
10 Termination Checking with Types - Abel - 2002
9 Parametricity and variants of Girard's J operator - Harper, Mitchell - 1999
8 Polymorphic Rewriting Conserves Algebraic Strong Normalizati.. (context) - Breazu-Tannen, Gallier - 1989
7 Une Thorie des Constructions Inductives (context) - Werner - 1994
6 Type Theory and Rewriting - Blanqui, Thorie - 2001
5 Definitions by rewriting in the Calculus of Constructions - Blanqui - 2005
5 Definitions by rewriting in the Calculus of Constructions - Blanqui - 2001
4 Katholiecke Universiteit Nijmegen (context) - Stefanova, Properties - 1998
4 Dependently typed records in type theory (context) - Pollack - 2002
2 Personal communication (context) - Paulin-Mohring - 2001
1 Coq-Development-Team: The Coq Proof Assistant Reference Manu.. (context) - Team, Proof et al. - 2004
1 Termination of rewriting in the Calculus of Constructions (context) - aszcz - 2003
1 Confluence of the lambda calculus with left-linear algebraic.. (context) - Mller - 1992
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