mvr / cfLinks
"Exact" real arithmetic for Haskell using continued fractions (Not formally proven correct)
☆40Updated 9 years ago
Alternatives and similar repositories for cf
Users that are interested in cf are comparing it to the libraries listed below
Sorting:
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Generic random generators☆81Updated 2 years ago
- ☆45Updated 6 years ago
- Mirror of ghc repository. DO NOT SUBMIT PULL REQUESTS HERE☆24Updated 6 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- constraint level if statements☆117Updated 7 years ago
- A tool for formally verifying Haskell code in Agda☆28Updated 8 years ago
- Haskell tool to generate expressions from types☆101Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- Monad Transformers and Classes☆76Updated 6 years ago
- Distributed programming language that desugars to Morte☆92Updated 2 years ago
- A preprocessor for GHC for alternate Haskell syntaxes☆38Updated 9 years ago
- Category theory for Haskell with a lens flavor (you need GHC 7.8.3, not 7.8.2 to build this!)☆162Updated 4 years ago
- being the scrapings of my stackoverflow answers☆48Updated 5 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Source material for "Functional Pearl: Getting a Quick Fix on Comonads"☆46Updated 7 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 2 years ago
- Sort any Traversable container☆41Updated 3 years ago
- second-order abstract syntax☆31Updated 3 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
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- The theory of algebraic graphs formalised in Agda☆90Updated 7 years ago
- ☆31Updated 10 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- ☆23Updated last year
- A simple GUI for Agda☆31Updated 9 years ago
- Verified left pad☆19Updated 7 years ago