Data refinement for call-by-value programming languages

DOI10.1007/3-540-48168-0_39MaRDI QIDQ4945251zbMATH OpenFDO

Authors Yoshiki Kinoshita, John Power

Publication date 26 September 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48168-0_39

zbMATH Keywords

simply typed \(\lambda\)-calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Axiomatics for data refinement in call by value programming languages
• Category theoretic models of data refinement
• Data refinement, call by value and higher order programs
• scientific article; zbMATH DE number 1512616
• An axiomatic approach to binary logical relations with applications to data refinement

Cited in

(8)

• Data refinement, call by value and higher order programs
• An axiomatic approach to binary logical relations with applications to data refinement
• scientific article; zbMATH DE number 1512616 (Why is no real title available?)
• An Isbell duality theorem for type refinement systems
• Models for the computational -calculus
• Category theoretic models of data refinement
• Axiomatics for data refinement in call by value programming languages
• Generic models for computational effects

This page was built for publication: Data refinement for call-by-value programming languages

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