Sciweavers

745 search results - page 117 / 149
» The Functional Side of Logic Programming
Sort
View
PLILP
1993
Springer
15 years 7 months 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...
117
Voted
ICALP
2000
Springer
15 years 7 months ago
Temporal Rewards for Performance Evaluation
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...
Jeroen Voeten
127
Voted
AMAST
2008
Springer
15 years 5 months ago
A Declarative Debugger for Maude
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
138
Voted
CDES
2008
90views Hardware» more  CDES 2008»
15 years 5 months ago
Nanocompilation for the Cell Matrix Architecture
- The Cell Matrix Architecture is a massive array of dynamically self-configurable, uniformly connected, identical computational units. This architecture can enable efficient, prac...
Thomas Way, Rushikesh Katikar, Ch. Purushotham
145
Voted
APAL
2008
104views more  APAL 2008»
15 years 3 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy