RedPRL / sml-typed-abtsLinks
second-order abstract syntax
☆31Updated 3 years ago
Alternatives and similar repositories for sml-typed-abts
Users that are interested in sml-typed-abts are comparing it to the libraries listed below
Sorting:
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Category theory and algebra☆27Updated 9 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Observational Type Theory as an Agda library☆55Updated 8 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Web based opetopic editor☆35Updated 10 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- ☆45Updated 6 years ago
- Where my everyday research happens☆55Updated 3 months ago
- ☆31Updated 11 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 9 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago