haskellari / tree-diffLinks
Diffing of (expression) trees.
☆78Updated 5 months ago
Alternatives and similar repositories for tree-diff
Users that are interested in tree-diff are comparing it to the libraries listed below
Sorting:
- rewrite rules for type-level equalities☆62Updated 3 months ago
- Compile Dhall expressions to Cabal files☆101Updated 2 years ago
- ☆54Updated 7 years ago
- ☆45Updated 4 years ago
- A GHC plugin and library for analysing GHC Core☆54Updated 10 months ago
- Serializable closures for distributed programming.☆65Updated 2 years ago
- A monad for managed values☆51Updated last month
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated 2 weeks ago
- Get all your structure and rip it apart.☆32Updated 7 years ago
- Standard module for type-level programming in Haskell☆31Updated 6 years ago
- Maps using values' monoidal structure during merging☆42Updated 8 months ago
- Dynamic linking and runtime evaluation of Haskell, and C, including dependency chasing and package resolution.☆53Updated 2 years ago
- ghc --make reimplemented with Shake☆32Updated 2 years ago
- Ghosts of Departed Proofs☆62Updated 5 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last month
- Rapid prototyping with GHCi☆59Updated 7 years ago
- Automatically trace all (showable) binds in do expressions☆84Updated 7 years ago
- An in-memory full text search engine library. It lets you run full-text queries on a collection of your documents.☆49Updated 10 months ago
- UI experiments for coda☆66Updated 4 years ago
- 💄🐞 Combinators for writing pretty type errors easily☆56Updated 3 years ago
- van Laarhoven Free Monad with Extensible Effects☆24Updated 9 years ago
- Dependently-typed finite maps (partial dependent products)☆66Updated last month
- First-class type families☆90Updated last month
- Extensible type-safe unions for Haskell☆34Updated 9 months ago
- Symbol manipulation☆37Updated 2 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 4 months ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆49Updated last year
- Deep evaluation of data structures☆43Updated 6 months ago
- Use hpack's phrasing in dhall to write cabal files☆31Updated 11 months ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago