nomeata / veggiesLinks
Hopefully verifiable code generation in GHC
☆94Updated 8 years ago
Alternatives and similar repositories for veggies
Users that are interested in veggies are comparing it to the libraries listed below
Sorting:
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Updated 8 years ago
- JHC Haskell compiler split into reusable components☆57Updated 6 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆79Updated 5 years ago
- A language based on homotopy type theory with an interval☆83Updated 10 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Haskell tool to generate expressions from types☆101Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Compact regions library for Haskell☆82Updated last year
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Literature review of GHC's Core language, System FC☆67Updated 7 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 3 years ago
- The Helium compiler, Helium-as-a-library, and the texthint interpreter☆98Updated 10 months ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 8 months ago
- Generic random generators☆81Updated 2 years ago
- Let GHC prove program equations for you☆146Updated 6 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- ☆41Updated 8 years ago
- Monad Transformers and Classes☆76Updated 6 years ago
- compiler with polyhedral optmization for a lazy functional programming language☆68Updated 7 years ago
- compile your own functional language☆36Updated 6 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago