Download JAR files tagged by prover with all dependencies

princess-smt-parser_2.12 from group io.github.uuverifiers (version 2024-03-22)

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.

Group: io.github.uuverifiers Artifact: princess-smt-parser_2.12
Show all versions Show documentation Show source

0 downloads

Artifact princess-smt-parser_2.12
Group io.github.uuverifiers
Version 2024-03-22
Last update 21. March 2024
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!

princess-parser_2.12 from group io.github.uuverifiers (version 2024-03-22)

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.

Group: io.github.uuverifiers Artifact: princess-parser_2.12
Show all versions Show documentation Show source

0 downloads

Artifact princess-parser_2.12
Group io.github.uuverifiers
Version 2024-03-22
Last update 21. March 2024
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!

princess_2.11 from group io.github.uuverifiers (version 2024-03-22)

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.

Group: io.github.uuverifiers Artifact: princess_2.11
Show all versions Show documentation Show source

0 downloads

Artifact princess_2.11
Group io.github.uuverifiers
Version 2024-03-22
Last update 21. March 2024
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 5
Dependencies scala-library, princess-parser_2.11, princess-smt-parser_2.11, scala-parser-combinators_2.11, java-cup,
There are maybe transitive dependencies!

princess-smt-parser_2.11 from group io.github.uuverifiers (version 2024-03-22)

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.

Group: io.github.uuverifiers Artifact: princess-smt-parser_2.11
Show all versions Show documentation Show source

0 downloads

Artifact princess-smt-parser_2.11
Group io.github.uuverifiers
Version 2024-03-22
Last update 21. March 2024
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!

princess-parser_2.11 from group io.github.uuverifiers (version 2024-03-22)

Princess is a theorem prover (aka SMT Solver) for Presburger arithmetic, uninterpreted predicates, and various other theories.

Group: io.github.uuverifiers Artifact: princess-parser_2.11
Show all versions Show documentation Show source

0 downloads

Artifact princess-parser_2.11
Group io.github.uuverifiers
Version 2024-03-22
Last update 21. March 2024
Organization io.github.uuverifiers
URL https://philipp.ruemmer.org/princess.shtml
License BSD-3-Clause
Dependencies amount 1
Dependencies scala-library,
There are maybe transitive dependencies!

shapesafe-macro_2.13 from group ai.acyclic.shapesafe (version 0.1.4)

SHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory

Group: ai.acyclic.shapesafe Artifact: shapesafe-macro_2.13
Show all versions Show documentation Show source

0 downloads

Artifact shapesafe-macro_2.13
Group ai.acyclic.shapesafe
Version 0.1.4
Last update 02. June 2022
Organization not specified
URL https://github.com/tribbloid/shapesafe
License Apache License, Version 2.0
Dependencies amount 2
Dependencies shapesafe-graph-commons_2.13, singleton-ops_2.13,
There are maybe transitive dependencies!

shapesafe-graph-commons_2.13 from group ai.acyclic.shapesafe (version 0.1.4)

SHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory

Group: ai.acyclic.shapesafe Artifact: shapesafe-graph-commons_2.13
Show all versions Show documentation Show source

0 downloads

Artifact shapesafe-graph-commons_2.13
Group ai.acyclic.shapesafe
Version 0.1.4
Last update 02. June 2022
Organization not specified
URL https://github.com/tribbloid/shapesafe
License Apache License, Version 2.0
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!

shapesafe-core_2.13 from group ai.acyclic.shapesafe (version 0.1.4)

SHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory

Group: ai.acyclic.shapesafe Artifact: shapesafe-core_2.13
Show all versions Show documentation Show source

0 downloads

Artifact shapesafe-core_2.13
Group ai.acyclic.shapesafe
Version 0.1.4
Last update 02. June 2022
Organization not specified
URL https://github.com/tribbloid/shapesafe
License Apache License, Version 2.0
Dependencies amount 1
Dependencies shapesafe-macro_2.13,
There are maybe transitive dependencies!

leuras-commons from group com.github.leuras (version 1.0.1)

Este projeto visa prover classes utilitárias que simplifiquem tarefas do cotidiano de desenvolvedores java, tornando mais simples a implementação de soluções voltadas especificamente para o âmbito nacional.

Group: com.github.leuras Artifact: leuras-commons
Show all versions Show documentation Show source

0 downloads

Artifact leuras-commons
Group com.github.leuras
Version 1.0.1
Last update 19. April 2020
Organization not specified
URL https://github.com/leuras/leuras-commons
License GNU General Public License version 3
Dependencies amount 7
Dependencies commons-lang3, poi, poi-ooxml, commons-email, jasperreports, itext, jtwig-core,
There are maybe transitive dependencies!

eprover from group org.eprover (version 1.6)

E is a theorem prover for full first-order logic with equality. It accepts a problem specification, typically consisting of a number of first-order clauses or formulas, and a conjecture, again either in clausal or full first-order form. The system will then try to find a formal proof for the conjecture, assuming the axioms.

Group: org.eprover Artifact: eprover

0 downloads

Artifact eprover
Group org.eprover
Version 1.6
Last update 21. November 2012
Organization not specified
URL http://www.eprover.org
License GNU General Public License, version 2
Dependencies amount 0
Dependencies No dependencies
There are maybe transitive dependencies!

Page 2 from 2 (items total 20)