sweirich / hs-inferno
Generic unification-based type inference library
☆25Updated 9 years ago
Alternatives and similar repositories for hs-inferno:
Users that are interested in hs-inferno are comparing it to the libraries listed below
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- Alternative Core language for GHC plugins☆39Updated 8 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules☆31Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Decision procedures for Presburger arithmetic in Haskell☆29Updated 4 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- System F in coq.☆19Updated 10 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.☆2Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated 3 weeks ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- OCaml backend for Agda☆39Updated 6 years ago
- being the beginnings of at least zero typecheckers☆32Updated 7 years ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆17Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 7 years ago
- My Agda experiments☆12Updated 5 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆16Updated 10 years ago