swMATH ID: 9416
Software Authors: Plasmeijer, Rinus; Achten, Peter; Koopman, Pieter
Description: An introduction to iTasks: defining interactive work flows for the web. In these lecture notes we present the iTasks 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 automated systems in which tasks are coordinated that have to be executed by either humans or computers. The combinators that we propose support work flow patterns commonly found in commercial work flow systems. In addition, we introduce novel work flow patterns that capture real world requirements, but that can not be dealt with by current systems. Compared with most of these commercial systems, the iTasks system offers several further advantages: tasks are statically typed, tasks can be higher order, the combinators are fully compositional, dynamic and recursive work flows can be specified, and last but not least, the specification is used to generate an executable web-based multi-user work flow application. With the iTasks system, useful work flows can be defined which cannot be expressed in other systems: a work can be interrupted and subsequently directed to other workers for further processing. The iTasks system has been constructed in the programming language Clean, making use of its generic programming facilities, and its iData toolkit with which interactive, thin-client, form-based web applications can be created. In all, iTasks are an excellent case of the expressive power of functional and generic programming.
Homepage: http://wiki.clean.cs.ru.nl/ITasks
Related Software: CLEAN; Miranda; Haskell; ML; GUM; Links; Hop; Eden; AoPA; SmallCheck; EasyCheck; Agda; Multilisp; Symgrid; Alfalfa; Camlflow; Curry; QuickCheck; Nuprl; Ivor
Cited in: 5 Publications
Further Publications: http://wiki.clean.cs.ru.nl/ST_Publications

Citations by Year