Tags : Browse Projects

Select a tag to browse associated projects and drill deeper into the tag cloud.

GNU Prolog

Compare

Claimed by GNU Analyzed 1 day ago

GNU Prolog is a free implementation (under GPL) of the logic programming language PROLOG. It can compile to native machine code which is extremely fast in execution. Another feature is the included constraint solver.

511K lines of code

1 current contributors

9 months since last commit

10 users on Open Hub

Very Low Activity
5.0
 
I Use This
Licenses: gpl, lgpv3_or_...

OVal - Object Validation for Java 5

Compare

  Analyzed about 14 hours ago

OVal is a pragmatic and extensible validation framework for any kind of Java objects (not only JavaBeans). Constraints can be declared with annotations (@NotNull, @MaxLength), POJOs or XML. Custom constraints can be expressed as custom Java classes or by using scripting languages such as ... [More] JavaScript, Groovy, BeanShell, OGNL or MVEL. Besides field/property validation OVal implements Programming by Contract features by utilizing AspectJ based aspects. This for example allows runtime validation of method arguments. [Less]

29K lines of code

2 current contributors

over 2 years since last commit

5 users on Open Hub

Inactive
5.0
 
I Use This

cassowary.js

Compare

  Analyzed about 4 hours ago

Cassowary/JS, better, faster, future-ready

9.53K lines of code

0 current contributors

almost 7 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

Cassowary

Compare

  Analyzed about 5 hours ago

Cassowary is an incremental constraint solving toolkit that efficiently solves systems of linear equalities and inequalities. Constraints may be either requirements or preferences. Re-solving the system happens rapidly, supporting UI applications.

107K lines of code

0 current contributors

almost 13 years since last commit

1 users on Open Hub

Inactive
5.0
 
I Use This
Licenses: No declared licenses

CVC4

Compare

  Analyzed about 13 hours ago

CVC4 is an efficient open-source automatic theorem prover for satisfiability modulo theories (SMT) problems. It can be used to prove the validity (or, dually, the satisfiability) of first-order formulas in a large number of built-in logical theories and their combination.

387K lines of code

16 current contributors

1 day since last commit

1 users on Open Hub

High Activity
5.0
 
I Use This

Grid Style Sheets (GSS)

Compare

Claimed by TheGrid Analyzed about 17 hours ago

GSS reimagines CSS layout & replaces the browser’s layout engine with one that harnesses the Cassowary Constraint Solver — the same algorithm Apple uses to compute native layout.

43.5K lines of code

0 current contributors

over 4 years since last commit

1 users on Open Hub

Inactive
0.0
 
I Use This

finitedomain

Compare

Claimed by TheGrid Analyzed 1 day ago

Finite Domain Constraint Solver

96.5K lines of code

0 current contributors

about 7 years since last commit

0 users on Open Hub

Inactive
0.0
 
I Use This

Java Validation Framework

Compare

  Analyzed about 15 hours ago

Java Validation Framework (not a JSR-303 implementation). This framework allows to modify (correct) test values; supports validation of localized values; allows to convert values into and from text representation; formats error messages, depending on the context; supports metadata, which allows to ... [More] check any entity types (not only Java Beans or POJOs) and more. Also this framework has long list of predefined validation components. [Less]

180K lines of code

1 current contributors

almost 2 years since last commit

0 users on Open Hub

Very Low Activity
0.0
 
I Use This