Feldspar / feldspar-languageLinks
The goal of the Feldspar project is to define a high-level language that allows description of high-performance digital signal processing algorithms.
☆47Updated 3 years ago
Alternatives and similar repositories for feldspar-language
Users that are interested in feldspar-language are comparing it to the libraries listed below
Sorting:
- Kansas Lava☆48Updated 5 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- From Haskell to Hardware via CCCs☆58Updated 9 years ago
- A partial implementation of Protocol Buffers in Idris☆31Updated 7 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Resource-AWare Feldspar☆38Updated 3 years ago
- Operad Programming Language in Haskell, by David Darais☆31Updated 11 years ago
- Invertible parsing for S-expressions☆34Updated 4 months ago
- Cλash/Haskell FPGA-based SKI calculus evaluator☆49Updated 9 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- Interpret Haskell programs into any cartesian closed category.☆63Updated 2 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- ☆31Updated 7 years ago
- Work in progress☆37Updated 2 months ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- The SAW core language.☆54Updated 4 years ago
- Haskell Join-calculus DSL☆24Updated 6 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- ☆23Updated last year
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- A monad for interfacing with external SAT solvers☆64Updated last month
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 3 months ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated this week
- being an experiment with potato power☆23Updated 5 years ago
- Haskell FFI bindings to CUDA☆78Updated 3 months ago
- Interpreter for the reversible functional language rFun☆36Updated 7 years ago
- A talk☆28Updated 4 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago