pigworker / Ohrid-AgdaLinks
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
Sorting:
- 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
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- ☆11Updated 4 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆10Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 6 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago