Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1308055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Typing untyped \(\lambda\)-terms, or reducibility strikes again! |
scientific article; zbMATH DE number 1308055 |
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
0.8254844546318054
0 references
0.7983005046844482
0 references
0.793136715888977
0 references
