Sciweavers

169 search results - page 30 / 34
» A type system for well-founded recursion
Sort
View
ICFP
2007
ACM
13 years 11 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
IJCAI
1993
13 years 9 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
SIAMSC
2008
148views more  SIAMSC 2008»
13 years 7 months ago
Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
A multilevel adaptive aggregation method for calculating the stationary probability vector of an irreducible stochastic matrix is described. The method is a special case of the ada...
Hans De Sterck, Thomas A. Manteuffel, Stephen F. M...
RTSS
2006
IEEE
14 years 1 months ago
Generalized Elastic Scheduling
The elastic task model proposed by Buttazzo, et. al. [9] is a powerful model for adapting real-time systems in the presence of uncertainty. This paper generalizes the existing ela...
Thidapat Chantem, Xiaobo Sharon Hu, Michael D. Lem...
TGC
2005
Springer
14 years 1 months ago
Mixin Modules for Dynamic Rebinding
Dynamic rebinding is the ability of changing the definitions of names at execution time. While dynamic rebinding is clearly useful in practice, and increasingly needed in modern s...
Davide Ancona, Sonia Fagorzi, Elena Zucca