pigworker / Ohrid-Agda
being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017
☆9Updated 7 years ago
Alternatives and similar repositories for Ohrid-Agda:
Users that are interested in Ohrid-Agda are comparing it to the libraries listed below
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 8 years ago
- Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.☆11Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- Experiments with effect systems☆12Updated 8 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- Dependently typed elimination functions using singletons☆28Updated last month
- An attempt to formalize unix cat in fiat☆12Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- ☆12Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆15Updated 5 years ago