tommythorn / ReduceronLinks
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…
☆434Updated last month
Alternatives and similar repositories for Reduceron
Users that are interested in Reduceron are comparing it to the libraries listed below
Sorting:
- A demo implementation of a simple dependently-typed language☆594Updated 6 months ago
- Compiling to Categories☆450Updated last year
- Functional programming with fewer indirections☆765Updated 4 years ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,042Updated 2 years ago
- Haskell implemented with combinators☆484Updated this week
- ATS2: Unleashing the Potentials of Types and Templates☆363Updated 5 months ago
- A bare-bones calculus-of-constructions☆380Updated 2 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆372Updated 2 years ago
- Software Foundations in Idris☆454Updated 6 years ago
- Type safe interface for working in subcategories of Hask☆419Updated 6 years ago
- Malfunctional Programming☆347Updated 6 months ago
- The Ivory EDSL☆398Updated 5 years ago
- A prototype successor to Idris☆540Updated 5 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆618Updated 3 weeks ago
- Convert Haskell source code to Coq source code☆281Updated 4 years ago
- Optimal evaluator of λ-calculus terms.☆276Updated 2 years ago
- A simple expressions language with polymorphic extensible row types.☆302Updated 2 years ago
- A DSL for embedded hard realtime applications.☆271Updated 8 years ago
- Functional language for parallel programming☆433Updated 7 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- Convert lambda expressions to CCC combinators☆146Updated 9 years ago
- Parser combinators for Idris☆243Updated 6 years ago
- Minimal implementations for dependent type checking and elaboration☆673Updated this week
- Programming language agnostic type construction language based on polynomials.☆368Updated last year
- Generically derive traversals, lenses, and prisms.☆441Updated last month
- Classic Algorithm W for type inference.☆253Updated 15 years ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆255Updated this week
- Functional Reactive Programming domain-specific language for efficient hybrid systems☆459Updated 3 months ago
- Demo for high-performance type theory elaboration☆554Updated last year
- Industrial-strength monadic parser combinator library☆944Updated 4 months ago