thautwarm / Quick-BackendLinks
Idris, make back end, in 15 minutes, reusable, concise: https://bitbucket.org/thautwarm/ppl2020-idris-codegen-backend/src/master
☆24Updated 5 years ago
Alternatives and similar repositories for Quick-Backend
Users that are interested in Quick-Backend are comparing it to the libraries listed below
Sorting:
- Idris 2 bindings to various C libraries☆15Updated 4 years ago
- Lua backend for Idris 2☆28Updated 3 years ago
- Idris port of Haskell's sop-core library☆37Updated 5 months ago
- Julia embedded in Haskell☆52Updated last year
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆27Updated 2 months ago
- A mini-book on category theory. Superseded by https://github.com/jonsterling/forest☆53Updated 3 years ago
- Experimental effects library for Idris 2☆43Updated 3 years ago
- A partial implementation of Protocol Buffers in Idris☆32Updated 8 years ago
- An extended typed Lambda Calculus☆21Updated last year
- Inigo: A Package Manager for Idris2☆62Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- Command line interface library in Idris☆33Updated last year
- Formalizing linear algebra in Agda by representing matrices as functions☆27Updated 2 years ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆66Updated 4 years ago
- TParsec - Total Parser Combinators in Idris☆99Updated 2 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A TOML parser for Idris 2☆17Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Automatic piecewise-mutable references for your types☆42Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆33Updated 4 years ago
- Provably total, tail-call optimized monadic recursion in Idris2☆14Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Morte IDE☆29Updated 10 months ago
- Benchmarking algebraic effect handler implementations☆27Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆41Updated 4 years ago