☆11Jul 20, 2016Updated 9 years ago
Alternatives and similar repositories for total
Users that are interested in total are comparing it to the libraries listed below
Sorting:
- 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
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- ☆48Jul 5, 2019Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- An interactive interpreter for asynchronous algebraic effects☆15Jun 19, 2024Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- ☆10May 3, 2017Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Haskell geometry library☆17Mar 15, 2020Updated 5 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- A thicker variant of Latin Modern Roman☆15Jun 6, 2025Updated 8 months ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- A simple implementation of linear type theory☆39Apr 21, 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
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago