haflang / heronLinks
A special-purpose processor for pure, non-strict functional languages
☆28Updated 5 months ago
Alternatives and similar repositories for heron
Users that are interested in heron are comparing it to the libraries listed below
Sorting:
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- Formal specification of the Haskell Language Report☆17Updated this week
- Agda category theory library for denotational design☆51Updated last year
- NbE course @ Chalmers☆28Updated 9 months ago
- a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.☆21Updated last year
- CS410 "Advanced Functional Programming"☆24Updated last month
- Fast equality saturation in Haskell☆84Updated 4 months ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A compiler that translates a form of lambda calculus to C☆12Updated last year
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Formalizing nbe in agda☆31Updated 12 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 3 months ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- A monadic library for symbolic evaluation☆67Updated last week
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Type Your Matrices For Great Good☆29Updated 4 years ago
- Linear Types, Symmetric Monoidal Categories, and Tensors☆13Updated last year
- A tutorial on how Agda infers things☆42Updated 4 years ago
- A Galilean revolution for computing: Unboundedly scalable reliability and efficiency☆15Updated last year
- Interpret Haskell programs into any cartesian closed category.☆61Updated last month
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆25Updated last month
- being bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- Agda to C compiler☆10Updated 2 years ago