The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.4230/LIPIcs.FSCD.2017.6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2757364446 / rank | |||
Normal rank | |||
| Property / title | |||
The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (English) | |||
| Property / title: The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (English) / rank | |||
Normal rank | |||
Revision as of 09:04, 30 July 2024
scientific article; zbMATH DE number 7204425
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type |
scientific article; zbMATH DE number 7204425 |
Statements
26 May 2020
0 references
reducibility method
0 references
restricted reducibility theorem
0 references
sum type
0 references
type-directed expansion
0 references
strong normalization
0 references
0 references
0 references
0 references
The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (English)
0 references
