A case study in programming coinductive proofs: Howe’s method (Q5236557): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q113857439, #quickstatements; #temporary_batch_1711055989931
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5854733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wellfounded recursion with copatterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-founded recursion with copatterns and sized types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copatterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: A domain equation for bisimulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abella: A System for Reasoning about Relational Specifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalising the pi-calculus using nominal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Psi-calculi in Isabelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly typed term representations in Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundational (co)datatypes and (co)recursion for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with binders and indexed data-types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing proofs with logical relations – Kripke-style / rank
 
Normal rank
Property / cites work
 
Property / cites work: αCheck: A mechanized metatheory model checker / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic Logical Relations for Polymorphic and Recursive Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid. A definitional two-level approach to reasoning with higher-order abstract syntax / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal foundations of operational semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for defining logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\pi\)-calculus in (Co)inductive-type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving congruence of bisimulation in functional programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a mechanized metatheory of standard ML / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence in functional languages with effects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with Higher-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof theory for generic judgments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract models of typed \(\lambda\)-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2844810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Types for Proofs and Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contextual modal type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order psi-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying termination and reduction properties about higher-order logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An insider's look at LF type reconstruction: everything you (n)ever wanted to know / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5277845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Beluga: Programming Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beluga: A Framework for Programming and Reasoning with Deductive Systems (System Description) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4225152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5713333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Howe's method for higher-order languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indexed codata types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof search specifications of bisimulation and modal logics for the π-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut elimination for a logic with induction and co-induction / rank
 
Normal rank

Revision as of 15:37, 20 July 2024

scientific article; zbMATH DE number 7114858
Language Label Description Also known as
English
A case study in programming coinductive proofs: Howe’s method
scientific article; zbMATH DE number 7114858

    Statements

    A case study in programming coinductive proofs: Howe’s method (English)
    0 references
    0 references
    0 references
    0 references
    9 October 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers