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
- The Ivory EDSL☆398Updated 5 years ago
- Compiling to Categories☆447Updated last year
- A demo implementation of a simple dependently-typed language☆591Updated 4 months ago
- ATS2: Unleashing the Potentials of Types and Templates☆358Updated 2 months ago
- Haskell implemented with combinators☆458Updated this week
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆370Updated last year
- A bare-bones calculus-of-constructions☆377Updated 2 years ago
- A DSL for embedded hard realtime applications.☆271Updated 7 years ago
- Software Foundations in Idris☆454Updated 5 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆608Updated last month
- Functional programming with fewer indirections☆760Updated 4 years ago
- CakeML: A Verified Implementation of ML☆1,012Updated this week
- Functional Reactive Programming domain-specific language for efficient hybrid systems☆456Updated last month
- A prototype successor to Idris☆539Updated 5 years ago
- The People's Refinement Logic☆229Updated 2 years ago
- Industrial-strength monadic parser combinator library☆940Updated 2 months ago
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆252Updated this week
- Experimental implementation of Cubical Type Theory☆578Updated last year
- Haskell bindings for LLVM☆518Updated 8 months ago
- The Ott tool for writing definitions of programming languages and calculi☆367Updated 3 months ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,037Updated last year
- Minimal implementations for dependent type checking and elaboration☆651Updated 2 months ago
- Convert lambda expressions to CCC combinators☆146Updated 9 years ago
- Parser combinators for Idris☆240Updated 5 years ago
- Poly/ML☆496Updated 2 months ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆375Updated last year
- Demo for high-performance type theory elaboration☆541Updated last year
- Programming language agnostic type construction language based on polynomials.☆367Updated 10 months ago
- A categorical programming language with effects☆275Updated 2 years ago
- A proof assistant for general type theories☆302Updated 5 months ago