A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
☆16Feb 13, 2018Updated 8 years ago
Alternatives and similar repositories for sml-dependent-lcf
Users that are interested in sml-dependent-lcf are comparing it to the libraries listed below
Sorting:
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- The People's Refinement Logic☆229Jan 1, 2023Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆47Feb 25, 2026Updated 3 weeks ago
- ☆21Apr 15, 2018Updated 7 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Feb 20, 2019Updated 7 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- an SML language server that uses SML/NJ's "visible compiler" feature☆24Jan 15, 2018Updated 8 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- ML Basis for Poly/ML☆13Oct 18, 2025Updated 5 months ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 4 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 6 months ago
- Interpreter for functional pure type systems.☆21Jun 30, 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
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- Cohesive type theory☆19Dec 6, 2021Updated 4 years ago
- Hakyll support for Agda literate files☆19Jul 20, 2021Updated 4 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Apr 18, 2018Updated 7 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- libcurl for Standard ML and http client with asynchronous support (via sml-ev)☆14Jan 5, 2024Updated 2 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A Henkin-style completeness proof for the modal logic S5☆17Jun 20, 2021Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- company-mode completion back-end for MLton/Standard ML☆16Dec 7, 2020Updated 5 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Categorical logic from a categorical point of view☆81Oct 19, 2023Updated 2 years ago
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 9 years ago
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- A simple GUI for Agda☆31Dec 13, 2015Updated 10 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- Standard ML Grammar for Tree-sitter☆25Jan 14, 2022Updated 4 years ago