shayan-najd / QFeldsparLinks
QFeldspar: a QDSL front-end for MiniFeldspar
☆14Updated 9 years ago
Alternatives and similar repositories for QFeldspar
Users that are interested in QFeldspar are comparing it to the libraries listed below
Sorting:
- A language-integrated proof assistant, for and in Racket☆39Updated 9 years ago
- machine fusion☆16Updated 6 years ago
- Coq proof for the paper "Compiling a Fifty Year Journey"☆13Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- Pure Type Systems for Functional Programming☆31Updated 4 years ago
- Miller/pattern unification in Agda☆68Updated 11 years ago
- Scrap Your Boilerplate for MetaOCaml with modular implicits☆18Updated 9 years ago
- A pure subset of Prolog, implemented in Haskell☆31Updated 12 years ago
- System F in coq.☆19Updated 10 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 7 months ago
- A blog about Coq☆46Updated 3 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- ☆62Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Logic for story telling!☆34Updated 7 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
- An embedded DSL for creating, composing, and using probability measures.☆41Updated 6 years ago
- A library for composable and effectful production, transformation and consumption of streams of data in Idris☆37Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Generates natural language versions of Coq proofs☆51Updated 7 years ago
- Ring solver for Idris☆20Updated 6 years ago
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- TODO☆23Updated 10 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- OCaml backend for Agda☆40Updated 7 years ago
- The LVish Haskell library☆80Updated 2 years ago
- Algebraic Combinatorics in Coq☆39Updated this week