tommythorn / Reduceron
FPGA Haskell machine with game changing performance. Reduceron is Matthew Naylor, Colin Runciman and Jason Reich's high performance FPGA softcore for running lazy functional programs, including hardware garbage collection. Reduceron has been implemented on various FPGAs with clock frequency ranging from 60 to 150 MHz depending on the FPGA. A h…
☆429Updated 3 months ago
Alternatives and similar repositories for Reduceron:
Users that are interested in Reduceron are comparing it to the libraries listed below
- Functional programming with fewer indirections☆760Updated 4 years ago
- A prototype successor to Idris☆539Updated 5 years ago
- Software Foundations in Idris☆454Updated 5 years ago
- A bare-bones calculus-of-constructions☆377Updated 2 years ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,037Updated last year
- A demo implementation of a simple dependently-typed language☆591Updated 4 months ago
- ATS2: Unleashing the Potentials of Types and Templates☆359Updated 2 months ago
- Experimental implementation of Cubical Type Theory☆579Updated last year
- Algebraic graphs☆737Updated 10 months ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆370Updated last year
- Compiling to Categories☆447Updated last year
- Type safe interface for working in subcategories of Hask☆420Updated 5 years ago
- The Ivory EDSL☆398Updated 5 years ago
- Haskell implemented with combinators☆458Updated this week
- A simple expressions language with polymorphic extensible row types.☆302Updated last year
- Functional Reactive Programming domain-specific language for efficient hybrid systems☆457Updated last month
- Liquid Types For Haskell☆1,231Updated this week
- Industrial-strength monadic parser combinator library☆941Updated 2 months ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆253Updated this week
- Minimal implementations for dependent type checking and elaboration☆651Updated 2 months ago
- A dependently typed programming language, a successor to Idris☆899Updated 4 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆608Updated last month
- Haskell bindings for LLVM☆518Updated 8 months ago
- Generically derive traversals, lenses, and prisms.☆441Updated 3 months ago
- Optimal evaluator of λ-calculus terms.☆274Updated 2 years ago
- Parser combinators for Idris☆240Updated 5 years ago
- A user-centric visual STG implementation to help understand GHC/Haskell's execution model.☆531Updated 3 years ago
- WIP implementation of a Haskell-like Lisp in Racket☆1,169Updated 11 months ago
- A DSL for embedded hard realtime applications.☆271Updated 7 years ago
- A fast, flexible, fused effect system for Haskell☆653Updated 2 months ago