4 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.AI2015
Generalized Support and Formal Development of Constraint Propagators
James Caldwell, Ian P. Gent, Peter Nightingale
Constraint programming is a family of techniques for solving combinatorial problems, where the problem is modelled as a set of decision variables (typically with finite domains) an…
cs.PL2013★ 2 cited
Structural Induction Principles for Functional Programmers
James Caldwell
User defined recursive types are a fundamental feature of modern functional programming languages like Haskell, Clean, and the ML family of languages. Properties of programs define…
cs.LO2010★ 4 cited
A Machine Checked Model of Idempotent MGU Axioms For Lists of Equational Constraints
Sunil Kothari, James Caldwell
We present formalized proofs verifying that the first-order unification algorithm defined over lists of satisfiable constraints generates a most general unifier (MGU), which also h…