RedPRL / sml-cats
Some basic categorical & algebraic structures for Standard ML
☆9Updated 7 years ago
Alternatives and similar repositories for sml-cats:
Users that are interested in sml-cats are comparing it to the libraries listed below
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 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
- SML implementation of System T from PFPL.☆11Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 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
- being an experiment with potato power☆23Updated 5 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
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 4 months ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 5 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- what I did on my holidays☆12Updated 6 years ago
- ☆11Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago