Name
Abstract | ||
|---|---|---|
This paper proposes a solution to the problem of implementing an optimal evaluation strategy for the lambda calculus. The solution uses in a substantial way the notion of composition of rewriting rules, first studied by Ehrig and others, in the algebraic approach to graph grammars, under the name concurrent productions. |
Year | DOI | Venue |
|---|---|---|
1982 | 10.1007/BFb0000121 | Graph-Grammars and Their Application to Computer Science |
Keywords | Field | DocType |
two-level expression representation,faster evaluation,lambda calculus | Deductive lambda calculus,Lambda calculus,Normalisation by evaluation,Simply typed lambda calculus,Typed lambda calculus,Fixed-point combinator,Algorithm,Theoretical computer science,Church encoding,Rewriting,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-12310-5 | 2 | 3.87 |
References | Authors | |
4 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Staples | 1 | 103 | 22.59 |