Freefinement

DOI10.1145/2103656.2103661MaRDI QIDQ2942853zbMATH OpenOpenAlexFDO

Authors Stephan van Staden, Cristiano Calcagno, Bertrand Meyer

Publication date 11 September 2015

Published in Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2103656.2103661

zbMATH Keywords

proof theoryrefinementformal systems

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Functional programming and lambda calculus (68N18)

Recommendations

• Refinements for free!
• A calculus of refinements for program derivations
• Refinement of Higher-Order Logic Programs
• scientific article; zbMATH DE number 1104377
• Intuitionistic Refinement Calculus

Cited in

(6)

• scientific article; zbMATH DE number 749964 (Why is no real title available?)
• scientific article; zbMATH DE number 878608 (Why is no real title available?)
• Free dimonoids
• Free CR distributions
• scientific article; zbMATH DE number 3946391 (Why is no real title available?)
• Refinements for free!

This page was built for publication: Freefinement

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