1017 search results - page 91 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
166
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
ICFP
2010
ACM
14 years 11 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
ICALP
2007
Springer
15 years 1 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
ICLP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract The ntcc process calculus is a timed concurrent constraint programming (ccp) model equipped with a first-order linear-temporal logic (LTL) for expressing process specifi...
176
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...