SophieBosio / contra
A friendly functional language for finding counterexamples 🎯
☆11Updated 10 months ago
Alternatives and similar repositories for contra
Users that are interested in contra are comparing it to the libraries listed below
Sorting:
- Reimplementation of a subset of Cabal☆26Updated 2 months ago
- GenericPersistence is a Haskell persistence library for relational databases. The approach relies on GHC.Generics. A real-world demo can …☆12Updated 4 months ago
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- Implementation of an efficient thread-safe global Symbol Table, with garbage collection☆19Updated 2 months ago
- An efficient graph library for Haskell☆39Updated 9 months ago
- Produce Haskell functions out of partial definitions☆12Updated this week
- Fast parallel calculations in pure mathematics, e.g. Gröbner Bases☆16Updated 8 months ago
- First Class Record Fields in Haskell☆17Updated 2 months ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated last week
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- 🌽 Core types and functions that power the Haskell `co-log` implementation☆18Updated 2 months ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- lucid + htmx = lucid-htmx☆19Updated 9 months ago
- Haskell library for representing and manipulating Symbolic Regression Tree☆11Updated 2 weeks ago
- the dynabook but for haskell☆23Updated 5 years ago
- An implementation of Haskell’s MVars in Racket☆28Updated 7 months ago
- A step-by-step Haskell x Swift project where the commits match the steps described in the accompanying blog post☆14Updated 10 months ago
- Invertible parsing for S-expressions☆34Updated last month
- Leightweight generalized parser combinators☆20Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 8 months ago
- Strongly typed paths in Haskell☆15Updated 2 years ago
- ☆17Updated last year
- ☆12Updated 8 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆30Updated last year
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 months ago
- A Haskell libary for fast arrowized FRP based on signal functions☆18Updated 9 months ago
- ☆44Updated last year
- ☆26Updated 4 months ago