The following pages link to (Q4945200):
Displaying 13 items.
- Monotonicity inference for higher-order formulas (Q438558) (← links)
- Partial and nested recursive function definitions in higher-order logic (Q972425) (← links)
- HasCasl: integrated higher-order specification and program development (Q1006648) (← links)
- An extensible encoding of object-oriented data models in HOL. With an application to IMP++ (Q1040775) (← links)
- A formalized general theory of syntax with bindings (Q1687739) (← links)
- A formalized general theory of syntax with bindings: extended version (Q1984791) (← links)
- A First-Order Syntax for the π-Calculus in Isabelle/HOL using Permutations (Q2841231) (← links)
- Comprehending Isabelle/HOL’s Consistency (Q2988665) (← links)
- A Purely Definitional Universal Domain (Q3183534) (← links)
- Formalising FinFuns – Generating Code for Functions as Data from Isabelle/HOL (Q3183537) (← links)
- The Isabelle Framework (Q3543647) (← links)
- Monotonicity Inference for Higher-Order Formulas (Q5747753) (← links)
- SSCalc: a calculus for Solidity smart contracts (Q6550597) (← links)
