Normal forms have partial types

DOI10.1016/0020-0190(93)90243-3zbMath0795.68030OpenAlexW2162039157MaRDI QIDQ1209305

Jens Palsberg

Publication date: 16 May 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90243-3

zbMATH Keywords

functional programmingpure \(\lambda\)-calculusThatte's partial types

Mathematics Subject Classification ID

Theory of programming languages (68N15) Combinatory logic and lambda calculus (03B40)

Related Items (2)

Efficient inference of partial types ⋮ Strong normalization for non-structural subtyping via saturated sets

Cites Work

• The lambda calculus, its syntax and semantics
• Unnamed Item
• Unnamed Item

This page was built for publication: Normal forms have partial types