Standard ML compiler based on typed intermediate languages.
☆51Aug 22, 2014Updated 11 years ago
Alternatives and similar repositories for TILT-Compiler
Users that are interested in TILT-Compiler are comparing it to the libraries listed below
Sorting:
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- The Mechanization of Standard ML☆75Jul 18, 2022Updated 3 years ago
- An auto-formatter for the Standard ML language☆23Apr 22, 2020Updated 5 years ago
- The Delphin Project☆10Aug 19, 2016Updated 9 years ago
- Standard ML Parser Combinator Library☆17Jan 9, 2026Updated last month
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated this week
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- Prototype code that accompanies the paper "Compiling Successor ML Pattern Guards"☆25Jul 26, 2022Updated 3 years ago
- SML reference interpreter☆122Oct 17, 2025Updated 4 months ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- This is an attempt at painting as many bikesheds as possible with a typeclass hierarchy for idris reflecting "Algebra"☆19Dec 24, 2018Updated 7 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 5 months ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A small bifunctor library for idris☆21Dec 28, 2020Updated 5 years ago
- PL syntax macros.☆21Nov 30, 2025Updated 3 months ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Martin-Löf Extensible Specification and Simulator☆29Jul 1, 2015Updated 10 years ago
- ☆12May 9, 2015Updated 10 years ago
- ☆12Feb 11, 2019Updated 7 years ago
- an implementation of gradual typing in mit-scheme☆10Apr 11, 2021Updated 4 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- An experimental language server for SomewhatML☆24Dec 30, 2022Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- MLWorks is a Standard ML compiler and development environment.☆180Apr 15, 2018Updated 7 years ago
- A version of the 1997 SML definition with corrections and some proposed Successor ML features added.☆206Aug 15, 2024Updated last year
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- The Twelf Programming Language☆151Jan 20, 2026Updated last month
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- A handful of potentially useful crap for Standard ML☆21Sep 11, 2017Updated 8 years ago