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:
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- ☆17Updated 6 years ago
- Interpreter for functional pure type systems.☆21Updated 8 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- Mechanizing Types and Programming Languages using Beluga☆20Updated 5 years ago
- Formalisation of the linear lambda calculus in Coq☆10Updated 6 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 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 9 months ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 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
- Mtac in Agda☆28Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ☆18Updated 3 years ago