conal / talk-2020-calculating-compilers-categorically
A talk
☆28Updated 3 years ago
Alternatives and similar repositories for talk-2020-calculating-compilers-categorically:
Users that are interested in talk-2020-calculating-compilers-categorically are comparing it to the libraries listed below
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- ☆30Updated 6 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 3 years ago
- Agda-style equational reasoning in Haskell☆52Updated 2 months ago
- Invertible parsing for S-expressions☆34Updated 6 months ago
- Interpret Haskell programs into any cartesian closed category.☆58Updated 2 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- An efficient graph library for Haskell☆39Updated 7 months ago
- Fine-grained lattice primitives for Haskell☆36Updated last month
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆26Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- oleg modules☆30Updated 12 years ago
- Generic functions for single-sorted first-order structural unification☆42Updated 2 weeks ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆29Updated last year
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Automatic piecewise-mutable references for your types☆42Updated 4 years ago
- GRIN backend for Idris☆51Updated 4 years ago
- The Prettiest Printer☆35Updated last year
- Type Your Matrices For Great Good☆30Updated 4 years ago
- Grammatical parsers - combinator library for parsing general context-free grammars☆36Updated last month
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- higher-kinded data☆30Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago