See this document in CiteSeerX!

Termination of Rewriting in the Calculus of Constructions (2000)  (Make Corrections)  (3 citations)
Daria Walukiewicz-Chrzaszcz



  Home/Search   Context   Related

 
View or download:
sop.inria.fr/certil...Walukiewicz.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  sop.inria.fr/certilab/LFM...index (more)
(Enter author homepages)

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

Abstract: The aim of this paper is to incorporate a rewriting mechanism to the Calculus of Constructions (CC) and present a method that proves strong normalization of the combined calculus. Practical motivations of our work... (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)

Active bibliography (related documents):   More   All
0.6:   Higher-Order Recursive Path Orderings à la carte - Jouannaud, Rubio   (Correct)
0.3:   Complete Monotonic Semantic Path Orderings - Borralleras, Ferreira, Rubio (2000)   (Correct)
0.2:   A Total AC-Compatible Reduction Ordering on Higher-Order Terms - Walukiewicz   (Correct)

Similar documents based on text:   More   All
0.1:   The Point Spectrum Of The Dirac Operator On Noncompact.. - Goette, Semmelmann   (Correct)
0.1:   Compelling Interest - Examining the Evidence on Racial Dynamics .. - Chang, al.   (Correct)
0.1:   Learning Rules Within the Framework of Environmental Sciences - Ria No Departament   (Correct)

Related documents from co-citation:   More   All
6:   Theoretical Computer Science (context) - Jouannaud, Okada et al. - 1997
4:   The higher-order recursive path ordering - Jouannaud, Rubio - 1999
4:   Polymorphic Rewriting Conserves Algebraic Strong Normalization and Con uence (context) - Breazu-Tannen, Gallier - 1989

BibTeX entry:   (Update)

D. Walukiewicz. Termination of rewriting in the Calculus of Constructions (extended abstract). In Proc. of the Workshop on Logical Frameworks and Meta-languages, 2000. http://citeseer.ist.psu.edu/walukiewicz-chrzaszc00termination.html   More

@misc{ walukiewicz00termination,
  author = "D. Walukiewicz",
  title = "Termination of rewriting in the Calculus of Constructions",
  text = "D. Walukiewicz. Termination of rewriting in the Calculus of Constructions
    (extended abstract). In Proc. of the Workshop on Logical Frameworks and
    Meta-languages, 2000.",
  year = "2000",
  url = "citeseer.ist.psu.edu/walukiewicz-chrzaszc00termination.html" }
Citations (may not include all citations):
214   Orderings for term rewriting systems (context) - Dershowitz - 1982
22   The Coq Proof Assistant Reference Manual Version - Barras, Boutin et al. - 1998
22   Proof normalization modulo - Dowek, Werner - 1999
14   A proof of strong normalization for the Theory of Constructi.. - Coquand, Gallier - 1990
13   The Calculus of Algebraic Constructions - Blanqui, Jouannaud et al. - 1999
11   Modularity of strong normalization in the algebraic--cube (context) - Barbanera, Fern et al. - 1997
7   Rapport de recherche INRIA (context) - Dowek, Hardin et al. - 1998
5   orie du Calcul des Constructions Inductives (context) - Werner, ta-th - 1994
4   Theoretical Computer Science (context) - Jouannaud, Okada et al. - 1997
3   The higher-order recursive path ordering (context) - Jouannaud, Rubio - 1999
1   Inductive denitions in the system COQ (context) - Paulin-Mohring - 1993

Documents on the same site (http://www-sop.inria.fr/certilab/LFM00/Proceedings/index.html):   More
Modularity in Meta-Languages - Mosses   (Correct)
Properties of Terms in Continuation-Passing Style in an.. - Polakow, Pfenning (2000)   (Correct)
TinkerType: A Language for Playing with Formal Systems - Levin, Pierce (2000)   (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