Sciweavers

1989 search results - page 238 / 398
» Set functions for functional logic programming
Sort
View
140
Voted
ENTCS
2008
116views more  ENTCS 2008»
15 years 3 months ago
Computational Origami Construction as Constraint Solving and Rewriting
Computational origami is the computer assisted study of mathematical and computational aspects of origami. An origami is constructed by a finite sequence of fold steps, each consi...
Tetsuo Ida, Mircea Marin, Hidekazu Takahashi, Fado...
CORR
2004
Springer
85views Education» more  CORR 2004»
15 years 3 months ago
A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree
It is well-known that freeness and linearity information positively interact with aliasing information, allowing both the precision and the efficiency of the sharing analysis of l...
Patricia M. Hill, Enea Zaffanella, Roberto Bagnara
118
Voted
ENTCS
2000
80views more  ENTCS 2000»
15 years 3 months ago
Behavioral and Coinductive Rewriting
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
Joseph A. Goguen, Kai Lin, Grigore Rosu
KR
2000
Springer
15 years 7 months ago
Reasoning with Axioms: Theory and Practice
When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to a...
Ian Horrocks, Stephan Tobies
TPDS
1998
124views more  TPDS 1998»
15 years 3 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad