Partiality and recursion in interactive theorem provers – an overview (Q5741556): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adapting functional programs to higher order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation by Prophecy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling general recursion in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terminating general recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOLCF = HOL + LCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of computation and monads / rank
 
Normal rank
Property / cites work
 
Property / cites work: The view from the left / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tutorial on Type-Based Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order unification by structural recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial functions in ACL2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-Based Termination with Sized Products / rank
 
Normal rank
Property / cites work
 
Property / cites work: CIC $\widehat{~}$ : Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type-based termination of recursive definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic covering undefinedness in program proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theoretical Aspects of the Optimal Fixedpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive Invariants for Nested Recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial and nested recursive function definitions in higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified Size-Change Termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The foundation of a generic theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing recursion operators in intuitionistic type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Purely Definitional Universal Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Code Generation via Higher-Order Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating Dependent Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induction proofs with partial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of nested and mutually recursive algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial functions in a total setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple type theory with partial functions and subtypes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general formulation of simultaneous inductive-recursive definitions in type theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculus of constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL / rank
 
Normal rank

Revision as of 08:09, 12 July 2024

scientific article; zbMATH DE number 6607272
Language Label Description Also known as
English
Partiality and recursion in interactive theorem provers – an overview
scientific article; zbMATH DE number 6607272

    Statements

    Partiality and recursion in interactive theorem provers – an overview (English)
    0 references
    0 references
    0 references
    0 references
    28 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers