ayberkt / sml-system-tLinks
SML implementation of System T from PFPL.
☆11Updated 8 years ago
Alternatives and similar repositories for sml-system-t
Users that are interested in sml-system-t are comparing it to the libraries listed below
Sorting:
- ☆17Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- ☆12Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 11 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆18Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- Control.Effects☆19Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- An attempt to formalize unix cat in fiat☆11Updated 8 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 8 years ago
- An abstract machine using indexed containers and their zippers☆13Updated 9 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- A tiny implementation of dependent types.☆11Updated 8 years ago