88 search results - page 13 / 18 » Declarative Specialization of Object-Oriented Programs |
LOPSTR
1994
Springer
15 years 1 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
DATESO
2009
14 years 7 months ago
2009
Top trees are a dynamic self-adjusting data structure that can be used by any tree algorithm. Actually, an arbitrary number of different tree algorithms can use a single structure....
81
Voted
ICLP
1991
Springer
15 years 1 months ago
1991
Springer
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
141
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
We propose to demonstrate SGL, a language and system for writing computer games using data management techniques. We will demonstrate a complete game built using the system, and s...
206
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
We present an integrated proof language for guiding the actions of multiple reasoning systems as they work together to prove complex correctness properties of imperative programs....