The following pages link to Scott Owens (Q287360):
Displaying 19 items.
- Self-formalisation of higher-order logic. Semantics, soundness, and a verified implementation (Q287361) (← links)
- Adapting functional programs to higher order logic (Q1029815) (← links)
- Proof producing synthesis of arithmetic and cryptographic hardware (Q2642982) (← links)
- Lem: reusable engineering of real-world semantics (Q2819676) (← links)
- Proof-producing translation of higher-order logic into pure and stateful ML (Q2875232) (← links)
- HOL with Definitions: Semantics, Soundness, and a Verified Implementation (Q2879260) (← links)
- Lem: A Lightweight Tool for Heavyweight Semantics (Q3088021) (← links)
- Regular-expression derivatives re-examined (Q3616446) (← links)
- The verified CakeML compiler backend (Q4972072) (← links)
- Proof-producing synthesis of ML from higher-order logic (Q5168887) (← links)
- Ott (Q5168920) (← links)
- Ott: Effective tool support for the working semanticist (Q5189646) (← links)
- Steps towards Verified Implementations of HOL Light (Q5327372) (← links)
- Functional Correctness Proofs of Encryption Algorithms (Q5387863) (← links)
- CakeML (Q5408415) (← links)
- Mathematizing C++ concurrency (Q5408531) (← links)
- A Sound Semantics for OCaml light (Q5458382) (← links)
- From structures and functors to modules and units (Q5501460) (← links)
- Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic (Q5756497) (← links)
