Safety analysis versus type inference for partial types

DOI10.1016/0020-0190(92)90196-3zbMath0763.68024OpenAlexW2050012658MaRDI QIDQ1199876

Michael I. Schwartzbach, Jens Palsberg

Publication date: 17 January 1993

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

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

zbMATH Keywords

functional programminglambda calculussafety analysispartial types

Mathematics Subject Classification ID

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

Related Items (4)

Efficient inference of partial types ⋮ Type inference with non-structural subtyping ⋮ Comparing flow-based binding-time analyses ⋮ Strong normalization with non-structural subtyping

Uses Software

• ML

Cites Work

• A theory of type polymorphism in programming
• Safety analysis versus type inference
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Safety analysis versus type inference for partial types