Combinatory reduction systems: Introduction and survey (Q1314356): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Automath / rank | |||
Normal rank | |||
Revision as of 04:51, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combinatory reduction systems: Introduction and survey |
scientific article |
Statements
Combinatory reduction systems: Introduction and survey (English)
0 references
26 September 1994
0 references
This paper investigates combinatory reduction systems (CRSs), i.e. usual first-order term rewriting systems with the presence of bound variables. It introduces orthogonal CRSs (illustrated with many examples) and gives an outline of the proof of confluence. It also shows an extension of the finite development theorem.
0 references
lambda calculus
0 references
combinatory reduction systems
0 references
term rewriting systems
0 references
confluence
0 references
extension of the finite developments theorem
0 references
