Sciweavers

750 search results - page 36 / 150
» Declarative event-oriented programming
Sort
View
CL
2000
Springer
13 years 7 months ago
Semantics of well-moded input-consuming logic programs
Recent logic programming languages employ dynamic scheduling of calls to improve e ciency of programs. Dynamic scheduling is realized by allowing some calls to be dynamically &quo...
Annalisa Bossi, Sandro Etalle, Sabina Rossi
ENTCS
2007
190views more  ENTCS 2007»
13 years 7 months ago
Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
Stefano Bistarelli, Ugo Montanari, Francesca Rossi...
FPLE
1995
13 years 11 months ago
Explaining Algebraic Theory with Functional Programs
Abstract. A hierarchy of six important structures from abstract algebra (groups, rings, fields etc.) is introduced as Gofer class definitions and laws about them. Many instance d...
Jeroen Fokker
SLP
1994
118views more  SLP 1994»
13 years 9 months ago
A Simple Program Transformation for Parallelism
Most of the research, to date, on optimizing program transformations for declarative languages has focused on sequential execution strategies. In this paper, we consider a class o...
Saumya K. Debray, Mudita Jain
FUIN
2010
93views more  FUIN 2010»
13 years 6 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien