Sciweavers

2145 search results - page 314 / 429
» Lax Logical Relations
Sort
View
PLILP
1993
Springer
14 years 1 days ago
A Demand Driven Computation Strategy for Lazy Narrowing
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...
Rita Loogen, Francisco Javier López-Fraguas...
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
14 years 1 days ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
SC
1993
ACM
14 years 1 days ago
Optimal fully adaptive wormhole routing for meshes
A deadlock-free fully adaptive routing algorithm for 2D meshes which is optimal in the number of virtual channels required and in the number of restrictions placed on the use of t...
Loren Schwiebert, D. N. Jayasimha
CIE
2006
Springer
13 years 11 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
CPAIOR
2006
Springer
13 years 11 months ago
Event-Driven Probabilistic Constraint Programming
Real-life management decisions are usually made in uncertain environments, and decision support systems that ignore this uncertainty are unlikely to provide realistic guidance. We ...
Armagan Tarim, Brahim Hnich, Steven David Prestwic...