deepeshpatel / jnumbertoolsLinks
JNumberTools is an open-source Java library for solving complex problems in combinatorics and number theory. Whether you're a researcher, developer, or student, this library offers a comprehensive set of APIs to efficiently handle a wide range of mathematical tasks, from basic to advanced combinatorial computations
☆12Updated 8 months ago
Alternatives and similar repositories for jnumbertools
Users that are interested in jnumbertools are comparing it to the libraries listed below
Sorting:
- Resumable exceptions and delimited continuations for JVM☆44Updated 9 months ago
- A set of tools that make working with the Scala ecosystem even better.☆12Updated this week
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- ☆31Updated 2 years ago
- ☆71Updated 5 years ago
- prototyping logic programming in Scala☆42Updated 3 years ago
- A Gradual Dependently-typed Language☆14Updated 6 years ago
- (CL)S - Combinatory Logic Synthesizer☆12Updated 4 years ago
- Matita (proof assistant) with embedded elpi☆15Updated 8 years ago
- A toolkit for building multi-result supercompilers☆32Updated 4 years ago
- pattern combinators extending racket/match to capture 🔗 contexts 📦☆20Updated 6 years ago
- The Flix Programming Book☆21Updated 2 weeks ago
- An implementation of Oz on top of Truffle and Graal☆42Updated 4 years ago
- A SOM Smalltalk implemented on top of Oracle's Truffle Framework☆34Updated last month
- Normalization-by-evaluation in miniKanren☆25Updated 2 years ago
- Staging area for new benchmarking infrastructure for Scala Native.☆15Updated 2 years ago
- A command-line parser for Standard ML☆21Updated last month
- Prove formulas of Presburger Arithmetic☆11Updated last year
- ☆49Updated 2 months ago
- Fuzzy Aggregators and Similarity Into a Logic Language☆26Updated last year
- A very little language☆16Updated 2 years ago
- A prototype of soft contract verification for an untyped functional language☆35Updated 4 years ago
- purple: compiling a reflective language☆33Updated last year
- A gentle introduction to Isabelle and Isabelle/HOL☆17Updated 10 months ago
- ☆15Updated 2 months ago
- Package for a computer algebra system integrated with satisfiability modulo theory algorithms, developed in Scala.☆33Updated 11 years ago
- software archaeology of reflective towers of interpreters☆16Updated 8 months ago
- ☆12Updated last year
- Cur dependently-typed language in miniKanren.☆17Updated 8 years ago
- miniKanren for search, SMT for solving☆13Updated 6 years ago