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
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 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 10 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- van Laarhoven lenses for Idris☆20Updated 8 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- Experiments with effect systems☆12Updated 9 years ago