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
- 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
- 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
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- Formalizations of strong normalization proofs☆35Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- ☆27Updated 4 years ago
- System F in coq.☆19Updated 10 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- The Prettiest Printer☆34Updated last year
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- STLC-related snippets in Agda☆16Updated 11 years ago
- Logical relations proof in Agda☆26Updated 9 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Specification of Agda.☆25Updated 6 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
- ☆26Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 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
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago