Pages that link to "Item:Q972425"
From MaRDI portal
The following pages link to Partial and nested recursive function definitions in higher-order logic (Q972425):
Displaying 15 items.
- A two-valued logic for properties of strict functional programs allowing partial functions (Q352946) (← links)
- A framework for developing stand-alone certifiers (Q530847) (← links)
- Formalization of the resolution calculus for first-order logic (Q1663242) (← links)
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL (Q1722647) (← links)
- Refinement to imperative HOL (Q1739909) (← links)
- Proof pearl: A mechanized proof of GHC's mergesort (Q2351394) (← links)
- Translating Scala Programs to Isabelle/HOL (Q2817953) (← links)
- Deriving Comparators and Show Functions in Isabelle/HOL (Q2945654) (← links)
- Termination of Isabelle Functions via Termination of Rewriting (Q3088004) (← links)
- Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism (Q3088012) (← links)
- Type Inference for ZFH (Q3453108) (← links)
- Mechanizing coinduction and corecursion in higher-order logic (Q4340418) (← links)
- ACKERMANN’S FUNCTION IN ITERATIVE FORM: A PROOF ASSISTANT EXPERIMENT (Q5037519) (← links)
- Partiality and recursion in interactive theorem provers – an overview (Q5741556) (← links)
- A step-indexing approach to partial functions (Q6587252) (← links)