walck / cyclotomicLinks
A subfield of the complex numbers for exact calculation.
☆22Updated 5 years ago
Alternatives and similar repositories for cyclotomic
Users that are interested in cyclotomic are comparing it to the libraries listed below
Sorting:
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Vector & affine spaces, linear maps, and derivatives☆49Updated 6 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆37Updated 4 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- An OS written in Idris (eventually...)☆20Updated 10 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated last year
- ICFP Bingo 2017 (Idris edition)☆30Updated 6 years ago
- Tools for working with derived Show instances in Haskell.☆57Updated 2 years ago
- ☆35Updated 7 years ago
- Interpret Haskell programs into any cartesian closed category.☆67Updated last week
- A talk☆28Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Brent's PhD thesis.☆69Updated 9 years ago
- ALGT 2.0☆30Updated 5 years ago
- Manipulating numbers with inherent measurement/experimental uncertainty.☆25Updated last year
- A geometric algebra implementation in Haskell☆32Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 2 months ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆69Updated 3 months ago
- Universal Register Machine implemented at the type-level of Haskell☆23Updated 9 years ago
- A hip inductive theorem prover!☆90Updated 4 years ago
- Morte IDE☆29Updated 8 months ago
- A nano "theorem prover".☆62Updated 6 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 7 months ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- A usable type system for call by push-value☆33Updated 5 years ago