Minimal term rewriting systems
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 274-290
- https://doi.org/10.1007/3-540-61629-2_48
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Benchmarking implementations of functional languages with ‘Pseudoknot’, a float-intensive benchmarkJournal of Functional Programming, 1996
- Forward and Backward SimulationsInformation and Computation, 1995
- Lazy rewriting and eager machineryPublished by Springer Nature ,1995
- A term pattern-match compiler inspired by finite automata theoryPublished by Springer Nature ,1992
- Open problems in rewritingPublished by Springer Nature ,1991
- Compilation of functional languages by program transformationACM Transactions on Programming Languages and Systems, 1991
- Term-rewriting systems with rule prioritiesTheoretical Computer Science, 1989
- The categorical abstract machinePublished by Springer Nature ,1985
- Pattern Matching in TreesJournal of the ACM, 1982
- A new implementation technique for applicative languagesSoftware: Practice and Experience, 1979