On the Hoare theory of monadic recursion schemes

DOI10.1145/2603088.2603157zbMath1401.68045OpenAlexW2084414320MaRDI QIDQ4635654

Konstantinos Mamouras

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

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

zbMATH Keywords

Hoare logicmonadic recursion schemespropositional Hoare logicmonadic program schemessound and complete Hoare calculus

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ Synthesis of Strategies Using the Hoare Logic of Angelic and Demonic Nondeterminism ⋮ Equational Theories of Abnormal Termination Based on Kleene Algebra

This page was built for publication: On the Hoare theory of monadic recursion schemes