shayan-najd / QFeldsparLinks
QFeldspar: a QDSL front-end for MiniFeldspar
☆14Updated 10 years ago
Alternatives and similar repositories for QFeldspar
Users that are interested in QFeldspar are comparing it to the libraries listed below
Sorting:
- Pure Type Systems for Functional Programming☆31Updated 5 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 10 months ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- ☆62Updated 6 years ago
- An implementation of Functional Reactive Programming☆41Updated 10 years ago
- TODO☆23Updated 10 years ago
- Dealing with Flags and Options☆13Updated 4 years ago
- Ring solver for Idris☆20Updated 7 years ago
- A pure subset of Prolog, implemented in Haskell☆31Updated 12 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- A blog about Coq☆46Updated 3 years ago
- Miller/pattern unification in Agda☆66Updated 2 months ago
- Formal topology (and some probability) in Coq☆31Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A playground for type theory implementations in Racket☆20Updated 10 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 10 years ago
- Work in progress☆38Updated 7 months ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆31Updated 4 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- machine fusion☆16Updated 7 years ago
- second-order abstract syntax☆31Updated 4 years ago
- Lollimon, a monadic concurrent linear logic programming language☆28Updated 14 years ago
- Algebraic Combinatorics in Coq☆39Updated 3 months ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- Obsidian Language Repository☆41Updated 7 years ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- This is the compiler for the Feldspar Language.☆23Updated 5 years ago