1017 search results - page 178 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
104
click to vote
JLP
2007
14 years 9 months ago
2007
This work faces the problem of web service selection and composition, discussing the advantages that derive from the inclusion, in a web service declarative description, of the hi...
ATVA
2006
Springer
15 years 1 months ago
2006
Springer
Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e....
ER
1995
Springer
15 years 1 months ago
1995
Springer
Abstract. This paper presents techniques for reverse engineering of relational database applications. The target of such an effort is the definition of a fully equipped object-orie...
69
Voted
CADE
2003
Springer
15 years 10 months ago
2003
Springer
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
VMCAI
2010
Springer
15 years 6 months ago
2010
Springer
Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a sub...