Toxaris / pts
Interpreter for functional pure type systems.
☆21Updated 7 years ago
Alternatives and similar repositories for pts:
Users that are interested in pts are comparing it to the libraries listed below
- being an experiment with potato power☆23Updated 5 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Agda suffices: software written from A to Z in Agda☆15Updated 6 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- van Laarhoven lenses for Idris☆20Updated 7 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 5 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- ☆23Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Concurrent IO language with Uniqueness Types☆9Updated 10 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆14Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago