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 4 months ago
Alternatives and similar repositories for jnumbertools
Users that are interested in jnumbertools are comparing it to the libraries listed below
Sorting:
- Proof combinators used in Liquid Haskell for theorem proving☆12Updated 7 years ago
- A set of tools that make working with the Scala ecosystem even better.☆11Updated last week
- Resumable exceptions and delimited continuations for JVM☆44Updated 5 months ago
- ☆48Updated last month
- A SOM Smalltalk implemented on top of Oracle's Truffle Framework☆34Updated last month
- The Flix Programming Book☆19Updated last week
- A gentle introduction to Isabelle and Isabelle/HOL☆13Updated 6 months ago
- ☆71Updated 5 years ago
- An implementation of Oz on top of Truffle and Graal☆42Updated 3 years ago
- purple: compiling a reflective language☆33Updated 11 months ago
- bayesPop R package☆10Updated 3 months ago
- ☆31Updated 2 years ago
- Matita (proof assistant) with embedded elpi☆14Updated 7 years ago
- Fuzzy Aggregators and Similarity Into a Logic Language☆26Updated last year
- an implementation of Observational Type Theory (OTT) and more☆28Updated 2 years ago
- Awesome Agda Programming☆18Updated last week
- Distributed Algorithms — Online Textbook☆16Updated 4 years ago
- A Java implementation of the Shen programming language☆28Updated 6 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 4 months ago
- prototyping logic programming in Scala☆41Updated 3 years ago
- Idris2 syntax highlighting, compiler-supported editing, interactive REPL and more things for Emacs.☆27Updated 9 months ago
- ☆14Updated last month
- An experimental language server for SomewhatML☆24Updated 2 years ago
- The fastest way to build a language☆43Updated 3 years ago
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆37Updated last week
- Practical type inference for arbitrary-rank types☆11Updated 6 years ago
- Prove formulas of Presburger Arithmetic☆11Updated last year
- A Hindley-Milner type inference implementation in Prolog☆13Updated 10 years ago
- A formalization of the Dedekind real numbers in Coq [maintainer=@andrejbauer]☆44Updated last year
- Animation of Yves Lafont's Interaction Combinators☆19Updated 3 years ago