Pages that link to "Item:Q1331625"
From MaRDI portal
The following pages link to Isabelle. A generic theorem prover (Q1331625):
Displaying 42 items.
- 1998 European Summer Meeting of the Association for Symbolic Logic (Q4254644) (← links)
- Verified lightweight bytecode verification (Q4329632) (← links)
- Hoare logic for Java in Isabelle/HOL (Q4329634) (← links)
- Mechanizing Nonstandard Real Analysis (Q4504968) (← links)
- A realizability interpretation of Church's simple theory of types (Q4593235) (← links)
- The correctness of a higher-order lazy functional language implementation: An exercise in mechanical theorem proving (Q4645809) (← links)
- Structuring metatheory on inductive definitions (Q4647512) (← links)
- An embedding of Ruby in Isabelle (Q4647513) (← links)
- Optimizing proof search in model elimination (Q4647531) (← links)
- Proof search with set variable instantiation in the Calculus of Constructions (Q4647555) (← links)
- More Church-Rosser proofs (in Isabelle/HOL) (Q4647561) (← links)
- Ergo 6: A Generic Proof Engine that Uses Prolog Proof Technology (Q4827602) (← links)
- The Relative Consistency of the Axiom of Choice Mechanized Using Isabelle⁄zf (Q4827615) (← links)
- Formalization of Forcing in Isabelle/ZF (Q5049004) (← links)
- Efficient second-order matching (Q5055870) (← links)
- Trustworthy Graph Algorithms (Invited Talk) (Q5092359) (← links)
- A User-friendly Interface for a Lightweight Verification System (Q5170234) (← links)
- Integrating Systems around the User: Combining Isabelle, Maple, and QEPCAD in the Proverʼs Palette (Q5170239) (← links)
- Representing Model Theory in a Type-Theoretical Logical Framework (Q5170290) (← links)
- PVS Embedding of cCSP Semantic Models and Their Relationship (Q5178979) (← links)
- A Theoretical Framework for the Higher-Order Cooperation of Numeric Constraint Domains (Q5179011) (← links)
- A practical implementation of simple consequence relations using inductive definitions (Q5234714) (← links)
- Hybrid interactive theorem proving using nuprl and HOL (Q5234717) (← links)
- Proof tactics for a theory of state machines in a graphical environment (Q5234719) (← links)
- RALL: Machine-supported proofs for relation algebra (Q5234720) (← links)
- Nuprl-Light: An implementation framework for higher-order logics (Q5234721) (← links)
- Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus (Q5251184) (← links)
- Lax Theory Morphisms (Q5277906) (← links)
- Flexary Operators for Formalized Mathematics (Q5495932) (← links)
- Towards Knowledge Management for HOL Light (Q5495935) (← links)
- High-Level Theories (Q5505502) (← links)
- Combining Isabelle and QEPCAD-B in the Prover’s Palette (Q5505513) (← links)
- (Q5875421) (← links)
- (Q5875430) (← links)
- Accessible Reasoning with Diagrams: From Cognition to Automation (Q5878874) (← links)
- A higher-order interpretation of deductive tableau (Q5938542) (← links)
- Verifying safety critical task scheduling systems in PPTL axiom system (Q5963639) (← links)
- I/O automata in Isabelle/HOL (Q6061876) (← links)
- The formal verification of the ctm approach to forcing (Q6151819) (← links)
- Towards automated deduction in cP systems (Q6154793) (← links)
- \textsf{LOGIC}: a Coq library for logics (Q6168989) (← links)
- A fine-grained semantics for arrays and pointers under weak memory models (Q6174541) (← links)