Comparing flow-based binding-time analyses

DOI10.1007/3-540-59293-8_220MaRDI QIDQ5096754zbMATH OpenOpenAlexFDO

Authors Jens Palsberg

Publication date 18 August 2022

Published in TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59293-8_220

Mathematics Subject Classification ID

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

Recommendations

• Automatic binding time analysis for a typed -calculus
• Program Development in Computational Logic
• scientific article; zbMATH DE number 1696778
• scientific article; zbMATH DE number 1738290
• Flow Analysis, Linearity, and PTIME

Cites work

• Automatic autoprojection of higher order recursive equations
• Automatic binding time analysis for a typed -calculus
• scientific article; zbMATH DE number 711035 (Why is no real title available?)
• scientific article; zbMATH DE number 6148924 (Why is no real title available?)
• scientific article; zbMATH DE number 1456967 (Why is no real title available?)
• Safety analysis versus type inference
• Safety analysis versus type inference for partial types

Cited in

(5)

• Automatic binding time analysis for a typed -calculus
• Accurate binding-time analysis for imperative languages: Flow, context, and return sensitivity
• Binding-Time Annotations without Binding-Time Analysis
• Flow Analysis, Linearity, and PTIME
• scientific article; zbMATH DE number 1231585 (Why is no real title available?)

This page was built for publication: Comparing flow-based binding-time analyses

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