jonsterling / sml-modernized-algolLinks
Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees
☆15Updated 8 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 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 months ago
- second-order abstract syntax☆31Updated 3 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 8 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
- ☆11Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- ☆27Updated 5 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- NbE course @ Chalmers☆28Updated 10 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago