ICALP
1990
Springer
14 years 7 months ago
1990
Springer
Any tree can be represented in a max/ma//y compact form as a directed acyclic graph where common subtrees are factored and shared, being represented only once. Such a compaction ca...
ICALP
1990
Springer
14 years 7 months ago
1990
Springer
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
IBM
1990
14 years 7 months ago
1990
IBM
1990
14 years 7 months ago
1990
ICALP
1989
Springer
14 years 7 months ago
1989
Springer
ESOP
1990
Springer
14 years 7 months ago
1990
Springer
The need to integrate several versions of a program into a common one arises frequently, but it is a tedious and time consuming task to merge programs by hand. The program-integrat...
ICALP
1989
Springer
14 years 7 months ago
1989
Springer
ICALP
1989
Springer
14 years 7 months ago
1989
Springer
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
ICALP
1989
Springer
14 years 7 months ago
1989
Springer
ESOP
1990
Springer
14 years 7 months ago
1990
Springer
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...