Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada  Home/Search
Context Related
| lri.fr/~blanqui/publi...rta99full.ps.gz lri.fr/~blanqui/publis/rta99.ps.gz lri.fr/~blanqui/paper...rta99full.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: cmu.edu/~fp/lfsbib (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generalizes inductive types equipped with higher-order primitive recursion, by providing definitions of functions by pattern-matching which capture recursor definitions for arbitrary non-dependent and non-polymorphic inductive types satisfying a strictly positivity condition. CAC also generalizes the first-order framework of... (Update)
Cited by: More
Definitions by Rewriting in the Calculus of Constructions - Blanqui (2001) (Correct)
Type Theory and Rewriting - BLANQUI (2001) (Correct)
Definitions by rewriting in the Calculus of Constructions - Blanqui (2003) (Correct)
Similar documents (at the sentence level): More
39.8%: The Calculus of Algebraic Constructions Fr'ed'eric Blanqui - Jean-Pierre Jouannaud And (Correct)
20.9%: The Calculus of Algebraic Constructions - Frederic Blanqui Jean-Pierre (1999) (Correct)
13.7%: Inductive Data Type Systems - Blanqui, Jouannaud, Okada (1998) (Correct)
Active bibliography (related documents): More All
0.5: Rewrite Orderings for Higher-Order Terms in η-Long.. - Jouannaud, Rubio (Correct)
0.2: Termination and Confluence of Higher-Order Rewrite Systems - Blanqui (Correct)
0.2: Order-Sorted Inductive Types - Barthe (1999) (Correct)
Similar documents based on text: More All
0.6: Inductive-Data-Type Systems - Blanqui, Jouannaud, Okada (2002) (Correct)
0.4: An Isabelle formalization of protocol-independent secrecy with an .. - Blanqui (Correct)
Related documents from co-citation: More All
13: Theoretical Computer Science (context) - Jouannaud, Okada et al. - 1997
9: Rewrite systems - Dershowitz, Jouannaud - 1990
8: The higher-order recursive path ordering - Jouannaud, Rubio - 1999
BibTeX entry: (Update)
F. Blanqui, J.-P. Jouannaud, and M. Okada. The Calculus of Algebraic Constructions. In RTA'99, 1999. http://citeseer.ist.psu.edu/article/blanqui99calculu.html More
@article{ blanqui99calculus,
author = "Fr{\'e}d{\'e}ric Blanqui and Jean-Pierre Jouannaud and Mitsuhiro Okada",
title = "The Calculus of Algebraic Constructions",
journal = "Lecture Notes in Computer Science",
volume = "1631",
pages = "301--??",
year = "1999",
url = "citeseer.ist.psu.edu/article/blanqui99calculu.html" }
Citations (may not include all citations):266 Information and Computation (context) - Coquand, Huet et al. - 1988
133 Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1988
126 Higher-order critical pairs (context) - Nipkow - 1991
79 Pattern matching with dependent types (context) - Coquand - 1992
73 Inductively defined types (context) - Coquand, Paulin-Mohring - 1990
62 Combinatory reduction systems: introduction and survey - Klop, van Oostrom et al. - 1993
55 Combining algebra and higher-order types (context) - Breazu-Tannen - 1988
54 Polymorphic rewriting conserves algebraic strong normalizati.. (context) - Breazu-Tannen, Gallier - 1991
43 Candidats de R'eductibilit'e (context) - Gallier - 1990
39 Introduction to generalized type systems (context) - Barendregt - 1992
35 Theoretical Computer Science (context) - Jouannaud, Okada et al. - 1997
24 Theorem proving modulo - Dowek, Hardin et al. - 1998
22 The Coq Proof Assistant Reference Manual Version (context) - Proof, Manual et al. - 1998
14 A proof of strong normalization for the Theory of Constructi.. - Coquand, Gallier - 1990
14 Strong normalizability for the combined system of the typed .. (context) - Okada - 1989
11 Modularity of strong normalization in the algebraic--cube (context) - Barbanera, Fern'andez et al. - 1997
8 A module calculus for Pure Type Systems - Courant
8 ese, Universit (context) - Werner, des et al. - 1994
6 Combining algebraic rewriting (context) - Di Cosmo, Kesner - 1996
4 ese de lemmes d (context) - Cornes, langage et al. - 1997
2 Inductive Data Type Systems (context) - Blanqui, Jouannaud et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/~fp/lfs-bib.html): More
How to Believe a Machine-Checked Proof - Pollack (1996) (Correct)
F1.059e+06>The Journal of Functional and Logic.. - Volume Article April (1999) (Correct)
Implementing Tactics and Tacticals in a Higher-Order Logic.. - Amy Felty (1993) (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