McMasterU / HashedExpressionLinks
Type-safe modelling DSL, symbolic transformation, and code generation for solving optimization problems.
☆43Updated 6 months ago
Alternatives and similar repositories for HashedExpression
Users that are interested in HashedExpression are comparing it to the libraries listed below
Sorting:
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 3 weeks ago
- ☆23Updated last year
- do-notation for Category and "Arrow without arr"☆63Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 10 months ago
- The theory of algebraic graphs formalised in Agda☆90Updated 6 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated this week
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Haskell library for semigroup actions and torsors☆62Updated 4 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Benchmark of the main linear algebra libraries in Haskell☆24Updated 5 years ago
- Haskell embedding of PlusCal☆61Updated 3 years ago
- An efficient graph library for Haskell☆39Updated last week
- Generic functions for single-sorted first-order structural unification☆46Updated last month
- ☆47Updated this week
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 2 months ago
- Where my everyday research happens☆53Updated last month
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated last week
- Interpret Haskell programs into any cartesian closed category.☆61Updated 2 weeks ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆14Updated 7 years ago
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆26Updated 3 months ago
- ☆40Updated 5 years ago
- Functions and newtype wrappers for traversing Trees☆30Updated 8 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Haskell bindings to ArrayFire☆60Updated 5 months ago