gergoerdi / tandoori
Compositional type checking for Haskell
☆37Updated 13 years ago
Alternatives and similar repositories for tandoori:
Users that are interested in tandoori are comparing it to the libraries listed below
- Agda-style equational reasoning in Haskell☆52Updated 2 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- An experimental intermediate language for GHC☆36Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated last week
- being a thing I build on a Saturday☆28Updated 7 years ago
- ☆17Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- A usable type system for call by push-value☆33Updated 5 years ago
- An interpreter for the language described in "The Two Dualities of Computation: Negative and Fractional Types"☆23Updated 12 years ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 3 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- Where my everyday research happens☆52Updated last week
- ICFP tutorial☆39Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated 2 weeks ago
- rewrite rules for type-level equalities☆62Updated 10 months ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago