jonsterling / agda-zipper-machineView external linksLinks
An abstract machine using indexed containers and their zippers
☆13Dec 29, 2016Updated 9 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:
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- an SML language server that uses SML/NJ's "visible compiler" feature☆24Jan 15, 2018Updated 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
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- ☆10May 3, 2017Updated 8 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 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'…☆12Aug 5, 2016Updated 9 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- Work on modular implicits☆25Oct 23, 2018Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- Typeset version of EGA and SGA by Grothendieck.☆12Jan 28, 2014Updated 12 years ago
- A personal library, formalizing cohesive homotopy type theory in Agda.☆13Apr 30, 2019Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago
- Unicode text for OCaml☆14Feb 19, 2018Updated 7 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- Ropes ("heavyweight strings") for OCaml☆48Jul 27, 2024Updated last year
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- A crowd-sourced document that details the changes in upcoming OCaml releases, in particular explains compatibility-breaking changes and p…☆28Jul 13, 2017Updated 8 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Coherence typechecker for infinity categories☆20Dec 29, 2025Updated last month
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Jun 5, 2019Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago