wh5a / thih
Typing Haskell in Haskell
☆15Updated 14 years ago
Alternatives and similar repositories for thih:
Users that are interested in thih are comparing it to the libraries listed below
- ICFP tutorial☆39Updated 3 years ago
- Efficient parser combinators for Haskell☆39Updated 9 months ago
- A very simple interface for incremental computation using STM in Haskell.☆13Updated last year
- A simple functional programming language.☆21Updated 3 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated 2 weeks ago
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆23Updated 3 weeks ago
- Where my everyday research happens☆52Updated last week
- Tiny type-checker with dependent types☆76Updated 11 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"☆25Updated 7 months ago
- Example row-polymorphism implementations☆61Updated last year
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- ☆38Updated 5 months ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- System F implemented in Haskell☆24Updated 12 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆44Updated 2 years ago
- There are many category theory implementations, but this one is mine☆15Updated 4 months ago
- Libraries for the Effectful Haskell effects system☆22Updated 2 years ago
- A usable type system for call by push-value☆30Updated 5 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- A simple implementation of linear type theory☆38Updated 7 years ago
- ☆47Updated last month
- Nat, Fin, Vec☆24Updated 2 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 7 months ago