Safety analysis versus type inference for partial types

DOI10.1016/0020-0190(92)90196-3MaRDI QIDQ1199876zbMATH OpenOpenAlexFDO

Authors Jens Palsberg, Michael I. Schwartzbach

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 calculuspartial typessafety analysis

Mathematics Subject Classification ID

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

Recommendations

• The Safe Lambda Calculus
• The Safe Lambda Calculus
• Partial Types and Intervals
• scientific article; zbMATH DE number 1256673
• Efficient inference of partial types

Cites work

• A theory of type polymorphism in programming
• 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 3755850 (Why is no real title available?)
• scientific article; zbMATH DE number 177776 (Why is no real title available?)
• Safety analysis versus type inference

Cited in

(10)

• Efficient inference of partial types
• Type inference with non-structural subtyping
• An Improved Safety Solver in Go Using Partial Regions
• An Inference Algorithm for Guaranteeing Safe Destruction
• Types in programming languages and corresponding safety theorems
• Strong normalization with non-structural subtyping
• Comparing flow-based binding-time analyses
• The Safe Lambda Calculus
• The Safe Lambda Calculus
• Towards proving type safety of .NET CIL

Describes a project that uses

Uses Software

• ML

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

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