Relative Hilbert-Post completeness for exceptions

DOI10.1007/978-3-319-32859-1_51MaRDI QIDQ2807879zbMATH OpenOpenAlexFDO

Authors Jean-Guillaume Dumas, Dominique Duval, Burak Ekici, Damien Pous, Jean-Claude Reynaud

Publication date 25 May 2016

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-32859-1_51

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Meager and replete failures of relative completeness
• On relative completeness of Hoare logics
• scientific article; zbMATH DE number 4022609
• Relative completeness for logics of functional programs
• On the completeness of modular proof systems

Cited in

(1)

• Meager and replete failures of relative completeness

Describes a project that uses

Uses Software

• Coq

This page was built for publication: Relative Hilbert-Post completeness for exceptions

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