Descriptive and Relative Completeness of Logics for Higher-Order Functions

DOI10.1007/11787006_31MaRDI QIDQ3591433zbMATH OpenOpenAlexFDO

Authors Kohei Honda, Martin Berger, Nobuko Yoshida

Publication date 11 September 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11787006_31

Mathematics Subject Classification ID

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

Recommendations

• An observationally complete program logic for imperative higher-order functions
• Relative completeness for logics of functional programs
• The completeness of functional logic
• Logical Reasoning for Higher-Order Functions with Local State
• A functional logic for higher level reasoning about computation

Cited in

(8)

• The completeness of functional logic
• Relative completeness for logics of functional programs
• scientific article; zbMATH DE number 2185697 (Why is no real title available?)
• Time bounds for general function pointers
• An observationally complete program logic for imperative higher-order functions
• Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
• A completeness result for inequational reasoning in a full higher-order setting
• Interpreting a finitary pi-calculus in differential interaction nets

Describes a project that uses

Uses Software

• SIMPLIFY

This page was built for publication: Descriptive and Relative Completeness of Logics for Higher-Order Functions

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