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 small implementation of a proof refinement logic.☆50Updated 8 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- ☆31Updated 10 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Observational Type Theory as an Agda library☆54Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Where my everyday research happens☆54Updated last month
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆74Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- ☆45Updated 6 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Updated 10 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- ☆19Updated 11 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago