jonsterling / agda-zipper-machine
An abstract machine using indexed containers and their zippers
☆14Updated 8 years ago
Alternatives and similar repositories for agda-zipper-machine
Users that are interested in agda-zipper-machine are comparing it to the libraries listed below
Sorting:
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- Category theory and algebra☆28Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Type-Theory in Sequent Calculus☆13Updated 9 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 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
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 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
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- what I did on my holidays☆12Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 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
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago