toy implementation of Hindley-Milner type system that prints out inference steps
☆18Oct 26, 2025Updated last year
Alternatives and similar repositories for minihm
Users that are interested in minihm are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Simple implementation of ST LC type checker in Haskell☆13Apr 18, 2022Updated 4 years ago
- Typelevel Brainfuck; Brainfuck implemented solely in Haskell's type system (no TemplateHaskell)☆17Dec 30, 2023Updated 2 years ago
- ☆11May 12, 2025Updated last year
- Build, traverse and deserialise packed data in Haskell☆11Sep 16, 2026Updated last month
- ☆16Feb 18, 2025Updated last year
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 9 years 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 well typed by construction kernel language for bidirectional programming☆14Jan 2, 2025Updated last year
- A lighweight and parallel snapshot testing framework in rust☆41Aug 17, 2023Updated 3 years ago
- Divide without division☆20Aug 1, 2026Updated 3 months ago
- Resources for "One Monad to Prove Them All"☆29Sep 30, 2026Updated last month
- Simple and easy-to-use typst template for problem sets/homeworks/assignments.☆12Sep 5, 2026Updated last month
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆14Nov 19, 2017Updated 8 years ago
- ☆14May 7, 2026Updated 5 months ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- A Haskell monad for fair enumeration of infinite sets.☆16Nov 15, 2025Updated 11 months ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- A OCaml generator for well-typed terms (that use their arguments).☆13Feb 22, 2025Updated last year
- OCaml as a Tactic Language for the Rocq Prover☆22Updated this week
- A clean implementation of Parsing with Zippers.☆39Sep 22, 2018Updated 8 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 10 months ago
- Pure functional programming with whole-program mutability inference☆109Sep 29, 2026Updated last month
- Syng: A syntactic approach to concurrent separation logic with propositional ghost state, fully mechanized in Agda☆12Nov 18, 2022Updated 3 years ago
- My final year project at the University of Strathclyde☆14Jan 26, 2023Updated 3 years ago
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Implementation of the Delta Language☆14Mar 18, 2024Updated 2 years ago
- Course on Metaprogramming☆78Feb 5, 2026Updated 8 months ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Oct 8, 2020Updated 6 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆17Dec 10, 2019Updated 6 years ago
- Материали за курса ООП, Информатика, 2024☆16Jun 8, 2024Updated 2 years ago
- Материали за курсът СДП и СДП-практикум във ФМИ за учебната 2024/25 година☆13Jan 18, 2025Updated last year
- Writeup that goes along with this:☆41Jan 18, 2018Updated 8 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆15Feb 14, 2023Updated 3 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Calculus of Constructions☆19Jul 17, 2019Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 8 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 7 years ago
- An implementation of a simple Neural network in Idris using category theory.☆25Sep 18, 2024Updated 2 years ago
- A Tokio-inspired concurrency library and work-stealing scheduler for Lean 4, with machine-checked proofs.☆29Oct 24, 2026Updated last week
- Simple, boilerplate-free operations on tree shaped data types. Port of the Uniplate Haskell library into Rust.☆25Sep 6, 2026Updated last month
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆12Apr 3, 2026Updated 6 months ago