jonsterling / sml-modernized-algol
Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees
☆15Updated 7 years ago
Alternatives and similar repositories for sml-modernized-algol
Users that are interested in sml-modernized-algol are comparing it to the libraries listed below
Sorting:
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated last week
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆11Updated 4 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A bare-bones LCF-style proof assistant☆23Updated 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 8 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- ☆27Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Implementing grep in Agda☆32Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago