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 Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- second-order abstract syntax☆31Updated 3 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆53Updated 8 years ago
- ☆11Updated 5 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 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
- a version of the 2048 game for Coq☆22Updated last year
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Type-Theory in Sequent Calculus☆14Updated 10 years ago
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- IO using sized types and copatterns☆35Updated 4 years ago