A decidable theory of type assignment
From MaRDI portal
Publication:365669
DOI10.1007/s00153-013-0335-xzbMath1303.03036OpenAlexW1972202041MaRDI QIDQ365669
Publication date: 9 September 2013
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-013-0335-x
lambda calculustype reconstructionprimitive recursive functionalsreduction sequencestypabilitytype assignmenttype checking
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to assign ordinal numbers to combinatory terms with polymorphic types
- Combinatory logic. With two sections by William Craig.
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Typability and type checking in System F are equivalent and undecidable
- Combinatory logic. Vol. II
- An upper bound for reduction sequences in the typed \(\lambda\)-calculus
- Exact bounds for lengths of reductions in typed λ-calculus
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES