On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems (Q1164619): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q5565113 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The undecidability of the second-order unification problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordering by Divisibility in Abstract Algebras / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4133944 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Intuitionistic propositional logic is polynomial-space complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The typed lambda-calculus is not elementary recursive / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Completeness, invariance and <i>λ</i>-definability / rank | |||
Normal rank | |||
Latest revision as of 15:49, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems |
scientific article |
Statements
On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems (English)
0 references
1981
0 references
typed lambda calculus
0 references
types of expressions
0 references
decidable unification problems
0 references
polynomial time decidable
0 references
