exaexa / minihmLinks
toy implementation of Hindley-Milner type system that prints out inference steps
☆14Updated 6 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 4 years ago
- ☆44Updated 6 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A simple supercompiler formally verified in Agda☆34Updated 8 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 6 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- Deferring the Details and Deriving Programs☆14Updated 6 years ago
- my phd thesis☆26Updated last year
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- being bits and pieces I'm inclined to leave lying around☆54Updated 3 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- ☆30Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- Coq library for handling names☆19Updated 3 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated 2 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- An Agda library for programming with ternary relations☆17Updated 6 months ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Updated 5 years ago