ayberkt / sml-system-tView external linksLinks
SML implementation of System T from PFPL.
☆11Jun 28, 2017Updated 8 years ago
Alternatives and similar repositories for sml-system-t
Users that are interested in sml-system-t are comparing it to the libraries listed below
Sorting:
- ☆11Jul 20, 2016Updated 9 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 language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Mechanizing Types and Programming Languages using Beluga☆21May 29, 2020Updated 5 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
- ☆12May 22, 2016Updated 9 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- Yet another haskell term rewriting library☆18Aug 27, 2025Updated 5 months ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated last month
- ☆10May 3, 2017Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- A practical application launcher for impractical people☆12Dec 21, 2023Updated 2 years ago
- ☆17Jun 10, 2022Updated 3 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- Spacemacs Layer for LiquidHaskell☆13Jun 10, 2017Updated 8 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- LaTeX style file to typeset functional languages like Haskell☆26Mar 25, 2013Updated 12 years ago
- ☆48Jul 5, 2019Updated 6 years ago
- My PhD thesis, titled "Reasonably Programmable Syntax"☆15Aug 28, 2018Updated 7 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Apr 29, 2021Updated 4 years ago
- Generation of abstract binding trees☆27Sep 26, 2025Updated 4 months ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago