Hélène Kirchner  Home/Search
Context Related
| loria.fr/pub/loria...eecriture95.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: fermivista.math.ju...ftp.loria.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Automated deduction motivates the introduction of several extensions of rewriting, especially ordered rewriting, class rewriting and rewriting with constraints. This paper is a survey of these three notions, shows the evolution between them and their increasing power of expressivity. 1 Introduction Term rewriting techniques have a wide range of applications in mainly two domains: the first one is the operational semantics of logico-functional programming languages. This area led to... (Update)
Similar documents based on text: More All
0.3: Promoting Rewriting to a Programming Language: A Compiler.. - Kirchner, Moreau (2000) (Correct)
0.2: On Using Ground Joinable Equations in Equational Theorem .. - Avenhaus, Hillenbrand.. (2000) (Correct)
0.2: ELAN User Manual - Borovansky, Kirchner, Kirchner.. (1997) (Correct)
BibTeX entry: (Update)
H'el`ene Kirchner. Some extensions of rewriting. In H. Comon and J.-P. Jouannaud, editors, Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeaux, France, May 17--21, http://citeseer.ist.psu.edu/ene95some.html More
@inproceedings{ kirchner93some,
author = "Hne Kirchner",
title = "Some Extensions of Rewriting",
booktitle = "Term Rewriting",
pages = "54-73",
year = "1993",
url = "citeseer.ist.psu.edu/ene95some.html" }
Citations (may not include all citations):788 Rewrite Systems - Dershowitz, Jouannaud - 1990
561 Constraint logic programming (context) - Jaffar, Lassez - 1987
299 Conditional rewriting logic as a unified model of concurrenc.. (context) - Meseguer - 1992
121 Handbook of Theoretical Computer Science (context) - Dershowitz, Jouannaud - 1990
103 Complete sets of reductions for some equational theories (context) - Peterson, Stickel - 1981
102 Term graph rewriting (context) - Barendregt - 1987
75 Completion of rewrite systems with membership constraints - Comon - 1992
74 Basic paramodulation and superposition (context) - Bachmair, Ganzinger et al. - 1992
72 Completion without failure - Bachmair, Dershowitz et al. - 1989
64 Basic superposition is complete (context) - Nieuwenhuis, Rubio - 1992
61 Logic Programming over Polymorphically Order-Sorted Types - Smolka - 1989
58 Deduction with symbolic constraints (context) - Kirchner, Kirchner et al. - 1990
55 Theorem proving with ordering constrained clauses (context) - Nieuwenhuis, Rubio - 1992
50 Automated Reasoning: 33 basic research problems (context) - Wos - 1988
47 A rationale for conditional equational programming (context) - Dershowitz, Okada - 1990
[Article contains additional citations not shown here]
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.loria.fr.html): More
Towards a General Signal Interpretation System -.. - Gong, Haton (Correct)
Description of Specification Developments - Souquières, al. (Correct)
Termination Proofs using gpo Ordering Constraints - Genet, Gnaedig (1997) (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