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
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalizations of strong normalization proofs☆34Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 2 months ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- some "modernized" brouwerian mathematics, inspired by Hancock, Ghani & Pattinson☆8Updated 9 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- Category theory and algebra☆28Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A monadic (and pretty) pretty printer for Haskell☆37Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated last month
- being a thing I build on a Saturday☆28Updated 6 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
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 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
- Embedding a Full Linear Lambda Calculus in Haskell☆8Updated 9 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago