The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type (Q5111301)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type |
scientific article; zbMATH DE number 7204425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8381064534187317
0 references
0.8233830332756042
0 references
0.8222706317901611
0 references
