Proving syntactic properties of exceptions in an ordered logical framework

DOI10.1007/3-540-44716-4_4MaRDI QIDQ2763630zbMATH OpenFDO

Authors Jeff Polakow, Kwangkeun Yi

Publication date 21 January 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2024/20240061

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• The proof monad
• An axiomatic treatment of exception handling in an expression-oriented language
• Exceptional syntax
• scientific article; zbMATH DE number 1497779
• scientific article; zbMATH DE number 2185662

Cited in

(5)

• A first-order one-pass CPS transformation
• Formalization of metatheory of the Quipper quantum programming language in a linear logic
• A classical propositional logic for reasoning about reversible logic circuits
• Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax
• A Survey of the Proof-Theoretic Foundations of Logic Programming

This page was built for publication: Proving syntactic properties of exceptions in an ordered logical framework

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