1781 search results - page 212 / 357 » Functional Answer Set Programming |
150
click to vote
IFIP
2004
Springer
15 years 7 months ago
2004
Springer
Pure Pattern Type Systems (P2 TS) combine in a unified setting the capabilities of rewriting and λ-calculus. Their type systems, adapted from Barendregt’s λ-cube, are especial...
CP
2003
Springer
15 years 7 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
100
click to vote
SPLC
2000
15 years 3 months ago
2000
: We consider a set of programs a family when it pays to look at their common aspects before looking at their differences. For commercial software developers the implications are t...
112
click to vote
ICSOC
2010
Springer
15 years 6 days ago
2010
Springer
A request to a service registry must be answered with a service that fits in several regards, including semantic compatibility, non-functional compatibility, and interface compati...
126
click to vote
RTCSA
2009
IEEE
15 years 8 months ago
2009
IEEE
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time liter...