nbenton / x86proved
☆13Updated 6 years ago
Related projects: ⓘ
- A language-generic implementation of equality saturation in Haskell☆21Updated 5 years ago
- NbE course @ Chalmers☆28Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆14Updated this week
- A simple supercompiler formally verified in Agda☆29Updated 7 years ago
- ☆13Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆21Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 3 years ago
- ☆22Updated 8 years ago
- Work in progress on semi-simplicial types☆23Updated last year
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- ☆12Updated 2 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆14Updated 9 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- ☆28Updated 9 years ago
- A certified semantics for relational programming workout.☆25Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆15Updated 4 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆21Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆18Updated 2 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- A cost-aware logical framework, embedded in Agda.☆52Updated last month
- being bits and pieces I'm inclined to leave lying around☆45Updated last month