Blaisorblade / abtLinks
Implementing Abstract Binding Trees (in Scala, ...)
☆19Updated 9 years ago
Alternatives and similar repositories for abt
Users that are interested in abt are comparing it to the libraries listed below
Sorting:
- an exploration of subtyping-based category theory in scala☆25Updated 14 years ago
- A recursion scheme library for Idris.☆25Updated last month
- An Idris type provider for communicating type-checkable protocols.☆26Updated 7 years ago
- A http client for Idris based on libcurl☆10Updated 9 years ago
- Invertible syntax for Scala.☆13Updated 8 years ago
- ☆23Updated 8 years ago
- Free Monads and useful constructions to work with them☆26Updated 7 years ago
- dhall-scala is a Scala library for consuming dhall configuration files from Scala programming language.☆39Updated 6 years ago
- Streams for (Co)Free! — The supporting repository for a 2016 Scala By The Bay presentation☆14Updated 8 years ago
- Talks on category-parametric programming.☆22Updated last year
- A JVM bytecode assembler written in Haskell.☆36Updated 9 years ago
- Pretty printer of Scala☆20Updated 4 years ago
- An arrowized FRP library for Idris with static safety guarantees.☆16Updated 7 years ago
- Lambda syntax for Scala EDSLs☆27Updated last year
- A small bifunctor library for idris☆21Updated 4 years ago
- General, extensible effect monad for Scala with message-passing semantics☆38Updated 7 years ago
- eta-spark is a library that provides complete bindings for Apache Spark☆21Updated 7 years ago
- Reasonable Haskell default import☆27Updated 3 years ago
- Functional Programing in Scala (in Idris) [Idris]☆16Updated 10 years ago
- ☆23Updated 7 years ago
- A small profunctor library for idris☆17Updated 2 years ago
- Code accompanying the paper Reflection without Remorse:Revealing a hidden sequence to speed up monadic reflection☆67Updated 3 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆21Updated last year
- Port of Scala/Haskell Refined library to Idris☆17Updated 4 years ago
- State machines in Idris☆37Updated 8 years ago
- A definition and reference implementation for MRA in PureScript.☆17Updated 8 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆14Updated 7 years ago