G. Huet, J.-J. L evy. Call by Need Computations in Non-Ambiguous Linear Term Rewriting Systems. Rapport de recherche INRIA 359, 1979. Reprinted as: Computations in orthogonal rewriting systems. In J.-L. Lassez and G. D. Plotkin, editors, Computational Logic; Essays in Honor of Alan Robinson, pages 394--443. MIT Press, 1991. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents
TERSE: TErm Rewritin Support Environment - Kawaguchi, Sakabe, Inagaki (1994) (Correct)
On Double Categories and Multiplicative Linear Logic - Melliès (1999) (Correct)
Strong and NV-sequentiality of constructor systems (Extended.. - Lucas (2000) (Correct)
A Conflict Between Call-by-Need Computation and Parallelism - Kennaway (1994) (13 citations) (Correct)
Context-Sensitive Rewriting Strategies - Lucas (1997) (2 citations) (Correct)
Perpetual Reductions in λ-Calculus - van Raamsdonk, Severi.. (1999) (6 citations) (Correct)
Semantics and Strong Sequentiality of Priority Term Rewriting.. - And (Correct)
Adding Algebraic Rewriting to the Untyped Lambda Calculus - Dougherty (21 citations) (Correct)
Term Graph Rewriting and Strong Sequentiality - Smetsers (Correct)
Incremental Needed Narrowing - Alpuente, Escobar, Lucas (1999) (Correct)
The Functional Strategy and Transitive Term Rewriting.. - Toyama, Smetsers, van .. (1993) (11 citations) (Correct)
Compiling Lazy Pattern Matching - Maranget (1992) (2 citations) (Correct)
Pattern Matching in Order-Sorted Languages - Kesner (1991) (Correct)
Free Sequentiality in Orthogonal Order-Sorted Rewriting Systems.. - Kesner (1992) (2 citations) (Correct)
ML pattern match compilation and partial evaluation - Sestoft (1996) (5 citations) (Correct)
Two Techniques for Compiling Lazy Pattern Matching - Maranget (1994) (6 citations) (Correct)
Axiomatic Rewriting Theory I - A Diagrammatic Standardization.. - Mellies (2001) (Correct)
Braids described as an orthogonal rewriting system.. - Faculteit Der Wiskunde (Correct)
MacLane's coherence theorem expressed as a word problem - Mellies (Correct)
Axiomatic Rewriting Theory III - A factorisation theorem in.. - Mellies (1997) (2 citations) (Correct)
Axiomatic Rewriting Theory II - The λσ-calculus.. - Mellies (Correct)
Double Categories: a modular model of multiplicative linear logic - Mellies (Correct)
Non-Deterministic untyped λ-calculus - A study about.. - Liguoro (1991) (Correct)
On Head-Rewriting Paths in the λσ-Calculus - Mellies (2002) (Correct)
Problems in Rewriting III - Dershowitz, Jouannaud, Klop (1995) (11 citations) (Correct)
First 50 documents
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