Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:58, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Typing untyped \(\lambda\)-terms, or reducibility strikes again! |
scientific article |
Statements
Typing untyped \(\lambda\)-terms, or reducibility strikes again! (English)
0 references
15 February 2000
0 references
type assignment
0 references
lambda calculus
0 references
conjunctive types
0 references
normalizable terms
0 references
meta-theorems relating properties of \(\lambda\)-terms and their typability
0 references
reducibility
0 references
weak head-normal forms
0 references
realizability method
0 references
