Writeup that goes along with this:
☆16Apr 19, 2018Updated 7 years ago
Alternatives and similar repositories for howtoprovefullabstraction
Users that are interested in howtoprovefullabstraction are comparing it to the libraries listed below
Sorting:
- secret project☆17Mar 14, 2018Updated 7 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- A framework for implementing and certifying impure computations in Coq☆53Jan 16, 2024Updated 2 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Roundtrip allows the definition of bidirectional (de-)serialization specifications☆16Oct 16, 2024Updated last year
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- The Prettiest Printer☆35Feb 14, 2024Updated 2 years ago
- Porting of software foundations book to Agda☆39Feb 16, 2014Updated 12 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Nat, Fin, Vec☆25May 2, 2025Updated 10 months ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 3 months ago
- Polynomial semantics of linear logic☆13Apr 15, 2018Updated 7 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- MixML prototype interpreter☆27Dec 13, 2019Updated 6 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- State machines in Idris☆37Nov 6, 2016Updated 9 years ago
- Work on modular implicits☆25Oct 23, 2018Updated 7 years ago
- ☆12Feb 11, 2019Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- IODyn: A functional language for implicitly-incremental programs with dynamic input and output collections☆15Feb 22, 2018Updated 8 years ago
- Extra and extended datatypes for Lean 4☆12Nov 12, 2022Updated 3 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- An experimental interactive shell for Alpaca, the ML language that runs on the Erlang VM☆10Jun 7, 2017Updated 8 years ago
- A simple ML dialect☆11Jan 2, 2017Updated 9 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- Programming with LVars, by example☆36Jul 20, 2015Updated 10 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆26Feb 7, 2017Updated 9 years ago