Elderry / TaPL-SMLLinks
Accompanying code for "Types and Programming Languages", ported to Standard ML
☆30Updated 9 years ago
Alternatives and similar repositories for TaPL-SML
Users that are interested in TaPL-SML are comparing it to the libraries listed below
Sorting:
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- 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
- Standard ML compiler based on typed intermediate languages.☆48Updated 10 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 7 years ago
- A discouraging story.☆15Updated 7 years ago
- being the beginnings of at least zero typecheckers☆33Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Updated last month
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆37Updated 2 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆26Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- FunTAL: mixing a functional language with assembly.☆40Updated 7 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- my phd thesis☆26Updated 9 months ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Martin-Löf Extensible Specification and Simulator☆29Updated 9 years ago
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 12 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago