Procedure compilation in the refinement calculus

DOI10.1007/S00165-006-0091-3zbMATH Open1102.68439OpenAlexW2068438882MaRDI QIDQ2432239FDOQ2432239

Authors: Karl Lermer, Colin Fidge 

Publication date: 25 October 2006

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://eprints.qut.edu.au/224936/1/5318.pdf

Recommendations

• scientific article; zbMATH DE number 1104382
• A calculus of refinements for program derivations
• scientific article; zbMATH DE number 2090154
• scientific article; zbMATH DE number 1538032
• Refinement of Higher-Order Logic Programs

zbMATH Keywords

Predicate transformersProceduresProgram compilationProgram refinement

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cited In (6)

• Interfaces for refining recursion and procedures
• Title not available (Why is that?)
• Compiler Construction
• A theoretical basis for stepwise refinement and the programming calculus
• Title not available (Why is that?)
• Correctness of procedure representations in higher-order assembly language

This page was built for publication: Procedure compilation in the refinement calculus

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