exaexa / minihmLinks
toy implementation of Hindley-Milner type system that prints out inference steps
☆14Updated 5 months ago
Alternatives and similar repositories for minihm
Users that are interested in minihm are comparing it to the libraries listed below
Sorting:
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A dependent type theory with user defined data types☆47Updated 3 years ago
- An Agda library for programming with ternary relations☆17Updated 4 months ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- ☆29Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- being bits and pieces I'm inclined to leave lying around☆53Updated 2 months ago
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated 3 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 3 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Let's rethink how we interact with Agda☆18Updated 2 years ago
- 🩺 A library for compiler diagnostics☆47Updated 3 weeks ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year