RobertHarper / TILT-Compiler
Standard ML compiler based on typed intermediate languages.
☆46Updated 10 years ago
Related projects ⓘ
Alternatives and complementary repositories for TILT-Compiler
- FunTAL: mixing a functional language with assembly.☆40Updated 7 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Updated 2 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆60Updated 2 years ago
- The Mechanization of Standard ML☆72Updated 2 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Updated 7 years ago
- MixML prototype interpreter☆27Updated 4 years ago
- SML Parser Combinator Library☆27Updated 8 years ago
- Miller/pattern unification in Agda☆62Updated 10 years ago
- A Scheme-like CBPV language with Racket Interoperability☆39Updated 8 months ago
- SML code for Handbook of Practical Logic and Automated Reasoning - For Isabelle too☆34Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆64Updated last year
- PLT Redex model of basic Dependently Typed Racket calculus☆18Updated 9 years ago
- A SuperCompiler for Martin-Löf's Type Theory☆120Updated 2 years ago
- Formalizations of Gradually Typed Languages in Agda☆54Updated last month
- ☆29Updated 9 years ago
- MetaML and MetaOCaml bibliography☆85Updated 2 months ago
- Racket bindings for Z3☆24Updated 5 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 11 months ago
- The Alms Programming Language☆44Updated 6 years ago
- Signature documentation tool for Standard ML☆14Updated last year
- Mirror of Epigram 2, by Conor McBride, et al.☆48Updated 4 years ago
- A compiler for the gradually typed lambda calculus☆76Updated 3 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆43Updated 2 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆99Updated last year
- Generic implementation of different CFA families based on monadic decomposition☆21Updated 11 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago