toy implementation of Hindley-Milner type system that prints out inference steps
☆17Oct 26, 2025Updated 4 months ago
Alternatives and similar repositories for minihm
Users that are interested in minihm are comparing it to the libraries listed below
Sorting:
- ☆11May 12, 2025Updated 9 months ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- A OCaml generator for well-typed terms (that use their arguments).☆11Feb 22, 2025Updated last year
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- ☆16Feb 18, 2025Updated last year
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆16Updated this week
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Coq plugin for extracting Rust code☆18Dec 15, 2025Updated 2 months ago
- A well typed by construction kernel language for bidirectional programming☆14Jan 2, 2025Updated last year
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- Implementation of the Delta Language☆13Mar 18, 2024Updated last year
- ☆16Jul 24, 2024Updated last year
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Oct 8, 2020Updated 5 years ago
- Typelevel Brainfuck; Brainfuck implemented solely in Haskell's type system (no TemplateHaskell)☆17Dec 30, 2023Updated 2 years ago
- Dependently typed core calculus with erasure☆19Aug 31, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 2 months ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Feb 7, 2024Updated 2 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Calculus of Constructions☆17Jul 17, 2019Updated 6 years ago
- A port of the gloss library from Haskell to Idris☆23Jul 9, 2018Updated 7 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- An experimental language server for SomewhatML☆24Dec 30, 2022Updated 3 years ago
- Monadic Constraint Programming framework☆28May 9, 2018Updated 7 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Divide without division☆20Aug 9, 2025Updated 6 months ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Implementation for ICFP 2020 paper☆54Jul 5, 2021Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- ☆22May 19, 2016Updated 9 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Nov 27, 2023Updated 2 years ago
- A PPX deriver that automates differential testing for OCaml modules☆26Nov 30, 2024Updated last year
- Idris tactics for (commutative) monoids☆20May 24, 2020Updated 5 years ago