Accompanying code for "Types and Programming Languages", ported to Standard ML
☆30Jul 10, 2015Updated 10 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:
- ☆17Oct 16, 2018Updated 7 years ago
- company-mode completion back-end for MLton/Standard ML☆16Dec 7, 2020Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 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'…☆12Aug 5, 2016Updated 9 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Tool for detecting bad style in Standard ML programs☆17Mar 10, 2019Updated 6 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years 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 thicker variant of Latin Modern Roman☆15Jun 6, 2025Updated 8 months ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- SML On Stilts☆37Feb 6, 2014Updated 12 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- doom☆17Mar 8, 2016Updated 9 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Category theory formalized in cubical agda☆21Feb 16, 2020Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- Experiments about intermediate representations in compilers☆28Aug 24, 2012Updated 13 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Mar 21, 2024Updated last year
- A handful of potentially useful crap for Standard ML☆21Sep 11, 2017Updated 8 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- An auto-formatter for the Standard ML language☆23Apr 22, 2020Updated 5 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Oct 26, 2023Updated 2 years ago