jonsterling / agda-zipper-machineLinks
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:
- System F in coq.☆19Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Category theory and algebra☆27Updated 9 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A prototype implementation of the Frank programming language☆17Updated 9 years ago
- second-order abstract syntax☆31Updated 4 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 9 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- secret project☆17Updated 7 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
- A Certified Interpreter for ML with Structural Polymorphism☆44Updated 5 months ago