Type Reconstruction for General Refinement Types

DOI10.1007/978-3-540-71316-6_34MaRDI QIDQ5756517zbMATH OpenOpenAlexFDO

Authors Kenneth Knowles, Cormac Flanagan

Publication date 4 September 2007

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71316-6_34

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Abstract refinement types
• An insider's look at LF type reconstruction: everything you (n)ever wanted to know
• Gradual refinement types
• Refinement types for program analysis
• Principles and applications of refinement types

Cited in

(14)

• Construction of tame types
• ICE-based refinement type discovery for higher-order functional programs
• Automatic reconstruction of data types in the decompilation problem
• Abstract refinement types
• ICE-based refinement type discovery for higher-order functional programs
• An insider's look at LF type reconstruction: everything you (n)ever wanted to know
• A Modular Type Reconstruction Algorithm
• Principles and applications of refinement types
• Polymorphic contracts
• Liquid types for array invariant synthesis
• Type reconstruction in F_ω
• Learning refinement types
• scientific article; zbMATH DE number 4126684 (Why is no real title available?)
• scientific article; zbMATH DE number 827981 (Why is no real title available?)

This page was built for publication: Type Reconstruction for General Refinement Types

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