Name
Abstract | ||
|---|---|---|
As a minimal environment for the study of permutative reductions an extension LambdaJ of the untyped lambda-calculus is considered. In this non-terminating system with non-trivial critical pairs, conuence is established by studying triangle properties that allow to treat permutative reductions modularly and could be extended to more complex term systems with permutations. Standardization is shown by means of an inductive definition of standard reduction that closely follows the inductive term... |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1007/10721975_10 | RTA |
Keywords | Field | DocType |
generalized applications,lambda calculus | Lambda calculus,Typed lambda calculus,Natural deduction,Computer science,Permutation,Algorithm,Critical pair,Confluence,Standardization | Conference |
Volume | ISSN | ISBN |
1833 | 0302-9743 | 3-540-67778-X |
Citations | PageRank | References |
14 | 0.93 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Felix Joachimski | 1 | 61 | 4.85 |
| Ralph Matthes | 2 | 201 | 21.67 |