Pages that link to "Item:Q909488"
From MaRDI portal
The following pages link to Term rewriting and beyond -- theorem proving in Isabelle (Q909488):
Displaying 14 items.
- Formal verification of C systems code. Structured types, separation logic and theorem proving (Q835768) (← links)
- A few exercises in theorem processing (Q879370) (← links)
- Experimenting with Isabelle in ZF set theory (Q1312157) (← links)
- Introduction to ``Milestones in interactive theorem proving'' (Q1663212) (← links)
- Towards formalising Schutz' axioms for Minkowski spacetime in Isabelle/HOL (Q2102946) (← links)
- Proof pearl: A mechanized proof of GHC's mergesort (Q2351394) (← links)
- Tactic-based inductive theorem prover for data types with partial operations (Diss., Univ. Kaiserslautern, 1999) (Q2726307) (← links)
- More SPASS with Isabelle (Q2914754) (← links)
- Using the TPTP Language for Writing Derivations and Finite Interpretations (Q3613401) (← links)
- Transparent optimisation of rewriting combinators (Q4267719) (← links)
- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages (Q5049000) (← links)
- RALL: Machine-supported proofs for relation algebra (Q5234720) (← links)
- Rewriting Techniques and Applications (Q5901573) (← links)
- Function definition in higher-order logic (Q6567726) (← links)