Simulating expansions without expansions (Q4322432): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Strong normalization for typed terms with surjective pairing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the implementation of abstract data types by programming language constructs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3727946 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Church-Rosser theorem for the typed lambda-calculus with pairing pairing / rank | |||
Normal rank | |||
Latest revision as of 11:50, 23 May 2024
scientific article; zbMATH DE number 720875
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simulating expansions without expansions |
scientific article; zbMATH DE number 720875 |
Statements
Simulating expansions without expansions (English)
0 references
18 February 1996
0 references
extensional equalities
0 references
typed \(\lambda\)-calculus
0 references
sums
0 references
bounded recursion
0 references
rewriting system
0 references
unbounded recursion
0 references
expansion rules
0 references
strong normalization
0 references
confluence
0 references
0 references
