Efficient inference of partial types

DOI10.1016/S0022-0000(05)80051-0zbMath0823.68011MaRDI QIDQ1337466

Michael I. Schwartzbach, Dexter Kozen, Jens Palsberg

Publication date: 6 November 1994

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

finite automatoninference\(\lambda\)-calculus

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items

Type inference for record concatenation and subtyping ⋮ Non-structural subtype entailment in automata theory ⋮ Strong normalization for non-structural subtyping via saturated sets ⋮ Type inference with non-structural subtyping ⋮ Strong normalization with non-structural subtyping ⋮ Rational spaces and set constraints ⋮ Rational spaces and set constraints ⋮ Tarskian set constraints

Cites Work

• Safety analysis versus type inference for partial types
• Normal forms have partial types
• Unnamed Item
• Unnamed Item