4835 search results - page 592 / 967 » Refactoring Functional Programs |
170
click to vote
AUTOMATICA
2004
15 years 6 months ago
2004
In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the...
178
click to vote
ENTCS
2002
15 years 6 months ago
2002
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
174
click to vote
JCB
2000
15 years 6 months ago
2000
We present an implementation of McCaskill's algorithm for computing the base pair probabilities of an RNA molecule for massively parallel message passing architectures. The p...
176
click to vote
AROBOTS
1998
15 years 6 months ago
1998
We describe a uniform technique for representing both sensory data and the attentional state of an agent using a subset of modal logic with indexicals. The resulting representation...
165
click to vote
SAS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Properties of programs can be formulated using various techdataflow analysis, abstract interpretation and type-like inference systems. This paper reconstructs strictness...