SMLFamily / The-Mechanization-of-Standard-MLView external linksLinks
The Mechanization of Standard ML
☆75Jul 18, 2022Updated 3 years ago
Alternatives and similar repositories for The-Mechanization-of-Standard-ML
Users that are interested in The-Mechanization-of-Standard-ML are comparing it to the libraries listed below
Sorting:
- SML, The Living Language (aka, Successor ML)☆72Apr 4, 2016Updated 9 years ago
- The Definition of Standard ML, Revised (1997)☆117May 13, 2017Updated 8 years ago
- Standard ML compiler based on typed intermediate languages.☆51Aug 22, 2014Updated 11 years ago
- Implementation of Nuprl's type theory in Coq☆46Dec 3, 2024Updated last year
- The Definition of Standard ML (1990)☆124Oct 27, 2014Updated 11 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A version of the 1997 SML definition with corrections and some proposed Successor ML features added.☆206Aug 15, 2024Updated last year
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 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
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Repository and Wiki for enriching the Standard ML Basis Library☆64Nov 30, 2021Updated 4 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Dafny for Metatheory of Programming Languages☆29Feb 6, 2026Updated last week
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- The Twelf Programming Language☆151Jan 20, 2026Updated 3 weeks ago
- A (formalised) general definition of type theories☆59Jun 10, 2021Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Voevodsky's 2006 paper on homotopy lambda calculus☆15Jan 11, 2015Updated 11 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- The Delphin Project☆10Aug 19, 2016Updated 9 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- Reference type checker for the Lean theorem prover☆64Mar 17, 2017Updated 8 years ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Sep 3, 2019Updated 6 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Feb 20, 2019Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago