Toxaris / ptsLinks
Interpreter for functional pure type systems.
☆21Updated 8 years ago
Alternatives and similar repositories for pts
Users that are interested in pts are comparing it to the libraries listed below
Sorting:
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 8 months ago
- being an experiment with potato power☆23Updated 5 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 weeks ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 7 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Type Theory with Indexed Equality☆26Updated 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
- ☆16Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 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
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago