Efficient inference of partial types

DOI10.1016/S0022-0000(05)80051-0MaRDI QIDQ1337466zbMATH OpenFDO

Authors Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach

Publication date 6 November 1994

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

Full work available at URL https://doi.org/10.1016/S0022-0000(05)80051-0

zbMATH Keywords

\(\lambda\)-calculusfinite automatoninference

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1256673
• Efficient inference of object types
• scientific article; zbMATH DE number 2044493
• Partial Types and Intervals
• Type Inference for a Polynomial Lambda Calculus

Cites work

• scientific article; zbMATH DE number 4058828 (Why is no real title available?)
• scientific article; zbMATH DE number 1256673 (Why is no real title available?)
• Normal forms have partial types
• Safety analysis versus type inference for partial types

Cited in

(19)

• Safety analysis versus type inference for partial types
• Type inference with partial types
• Strong normalization for non-structural subtyping via saturated sets
• Type inference with non-structural subtyping
• Tarskian set constraints
• Type inference for record concatenation and subtyping
• Non-structural subtype entailment in automata theory
• Efficient inference of object types
• Type Inference for a Polynomial Lambda Calculus
• scientific article; zbMATH DE number 4051569 (Why is no real title available?)
• scientific article; zbMATH DE number 4058828 (Why is no real title available?)
• scientific article; zbMATH DE number 177846 (Why is no real title available?)
• scientific article; zbMATH DE number 1256673 (Why is no real title available?)
• scientific article; zbMATH DE number 2044493 (Why is no real title available?)
• scientific article; zbMATH DE number 2087431 (Why is no real title available?)
• Strong normalization with non-structural subtyping
• Rational spaces and set constraints
• Sound and complete type inference for closed effect rows
• Rational spaces and set constraints

This page was built for publication: Efficient inference of partial types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337466)