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 2 months ago
Alternatives and similar repositories for Reduceron
Users that are interested in Reduceron are comparing it to the libraries listed below
Sorting:
- ATS2: Unleashing the Potentials of Types and Templates☆365Updated 2 weeks ago
- Experimental implementation of Cubical Type Theory☆582Updated last year
- Software Foundations in Idris☆454Updated 6 years ago
- Functional programming with fewer indirections☆765Updated 4 years ago
- Haskell implemented with combinators☆520Updated last week
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,040Updated 2 weeks ago
- A demo implementation of a simple dependently-typed language☆594Updated 7 months ago
- A bare-bones calculus-of-constructions☆380Updated 2 years ago
- Haskell bindings for LLVM☆520Updated 11 months ago
- Compiling to Categories☆454Updated last year
- The Ott tool for writing definitions of programming languages and calculi☆376Updated 6 months ago
- The Ivory EDSL☆397Updated 5 years ago
- A proof assistant for general type theories☆304Updated 8 months ago
- Poly/ML☆504Updated 3 weeks ago
- Demo for high-performance type theory elaboration☆557Updated last year
- Bootstrapping ATS3☆221Updated this week
- A prototype successor to Idris☆539Updated 5 years ago
- Minimal implementations for dependent type checking and elaboration☆681Updated last month
- A simple expressions language with polymorphic extensible row types.☆302Updated 2 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆618Updated last month
- SMT Based Verification in Haskell. Express properties about Haskell programs and automatically prove them using SMT solvers.☆254Updated this week
- A fast, flexible, fused effect system for Haskell☆658Updated 2 months ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆370Updated 2 years ago
- Convert Haskell source code to Coq source code☆281Updated 4 years ago
- Industrial-strength monadic parser combinator library☆946Updated this week
- CakeML: A Verified Implementation of ML☆1,058Updated this week
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆378Updated last year
- Generalized bananas, lenses and barbed wire☆347Updated 6 months ago
- Functional Reactive Programming domain-specific language for efficient hybrid systems☆460Updated 4 months ago
- Liquid Types For Haskell☆1,247Updated 2 weeks ago