5810 search results - page 381 / 1162 » An Approach to Programming Based on Concepts |
156
click to vote
PEPM
2007
ACM
16 years 24 days ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
164
click to vote
SPAA
2006
ACM
16 years 19 days ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
160
click to vote
PPOPP
2005
ACM
16 years 7 days ago
2005
ACM
In concurrent programming, non-blocking synchronization is very efficient but difficult to design correctly. This paper presents a static analysis to show that code blocks are ato...
291
click to vote
ASP
2005
Springer
16 years 7 days ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
198
click to vote
PLDI
2000
ACM
15 years 11 months ago
2000
ACM
Functional Reactive Programming, or FRP, is a general framework for programming hybrid systems in a high-level, declarative manner. The key ideas in FRP are its notions of behavio...