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 6 years ago
- An abstract machine using indexed containers and their zippers☆14Updated 8 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- System F in coq.☆19Updated 9 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- 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 playground for type theory implementations in Racket☆20Updated 9 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- ☆11Updated 4 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Coq code accompanying several articles on semantics of functional programming languages☆10Updated 6 years ago
- Miller/pattern unification in Agda☆63Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- Some basic categorical & algebraic structures for Standard ML☆9Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- The Prettiest Printer☆35Updated 11 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Specification of Agda.☆25Updated 6 years ago
- ☆18Updated 2 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago