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☆24Updated 5 years ago
- being the emperor of Mongo, but also a verb☆15Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Experiments with effect systems☆12Updated 9 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 9 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- being an experiment with potato power☆23Updated 6 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- SML implementation of System T from PFPL.☆11Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 6 months ago
- classical sequent calculus, embedded in Haskell☆21Updated 5 months ago
- Dependently typed Algorithm M and friends☆26Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- A usable type system for call by push-value☆33Updated 6 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago