Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language (Q6151555): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parameterised notions of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward the interpretation of non-constructive reasoning as non-monotonic learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Imperative Programs from Proofs: In-place Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic fixed point logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imperative programs as proofs via game semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective interactive proofs for higher-order imperative programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Denotational cost semantics for functional languages with inductive types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic operational semantics for the lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic extensions of untyped \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic  -calculus and Quantitative Program Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of non-functional programs using interpretations in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Herbrand disjunctions by functional interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic basis for computer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3203061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3564946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Graph Model for Imperative Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Predicates and Mutable ADTs in Hoare Type Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive interpretation of Ramsey's theorem via the product of selection functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting Proofs-as-Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gödel's functional interpretation and the concept of learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A functional interpretation with state / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well Quasi-orders and the Functional Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for Krull's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reasoning for Higher-Order Functions with Local State / rank
 
Normal rank

Latest revision as of 09:11, 28 August 2024

scientific article; zbMATH DE number 7814915
Language Label Description Also known as
English
Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
scientific article; zbMATH DE number 7814915

    Statements

    Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language (English)
    0 references
    11 March 2024
    0 references
    program extraction
    0 references
    modified realizability
    0 references
    imperative programs
    0 references
    state monad
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers