Descriptive and Relative Completeness of Logics for Higher-Order Functions

DOI10.1007/11787006_31zbMath1133.03333OpenAlexW1867526098MaRDI QIDQ3591433

Nobuko Yoshida, Martin Berger, Kohei Honda

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) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

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 ⋮ Interpreting a finitary pi-calculus in differential interaction nets

Uses Software

• SIMPLIFY

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