shayan-najd / QFeldspar
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
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- System F in coq.☆19Updated 10 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 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
- Scrap Your Boilerplate for MetaOCaml with modular implicits☆18Updated 9 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Work in progress☆34Updated 4 months ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆65Updated last year
- Luck -- A Language for Property-Based Generators☆34Updated last month
- Generic unification-based type inference library☆25Updated 9 years ago
- A blog about Coq☆47Updated 2 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- Mathematical stories☆13Updated 4 years ago
- A language-integrated proof assistant, for and in Racket☆39Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- The Prettiest Printer☆35Updated last year
- ☆18Updated 7 years ago
- machine fusion☆16Updated 6 years ago
- Haskell Bindings to the Lean Theorem Prover http://leanprover.github.io/☆21Updated 7 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Directed type theory for formal category theory☆17Updated 7 years ago
- An implementation of Functional Reactive Programming☆40Updated 10 years ago