5499 search results - page 283 / 1100 » Generalized Rewrite Theories |
222
click to vote
PLDI
2003
ACM
16 years 17 days ago
2003
ACM
We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. We first present a domainspeci...
179
click to vote
LPNMR
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
199
click to vote
SIGGRAPH
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are s...
235
click to vote
FP
1992
15 years 11 months ago
1992
The interface with the outside world has always been one of the weakest points of functional languages. It is not easy to incorporate I/O without being allowed to do side-effects....
232
click to vote
KBSE
2000
IEEE
15 years 11 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...