https://refubium.fu-berlin.de/handle/fub188/17746 2026-05-04T03:18:52Z https://refubium.fu-berlin.de/handle/fub188/18725 7 types of cooperation episodes in side-by-side programming Prechelt, Lutz; Stärk, Ulrich; Salinger, Stephan In side-by-side programming, two programmers (typically working on related aspects of a project) move their computers so close to one another that they can effortlessly change between working alone and working together, where working alone is the primary mode. The technique was proposed in order to obtain some of the advantages of pair programming at much lower overhead. As a first step towards understanding how and when to use side-by-side programming, the present study aims at describing when and for what purpose side-by-side programmers get together to cooperate. The main result is a classification of the cooperation episodes by purpose and content into different types: Exchange project details, Exchange general knowledge, Discuss strategy, Discuss step, Debug work product, Integrate work products, and Make remark. These types were derived via the Grounded Theory method and are described conceptually in terms of the types of events of which they consist. All concepts used in these descriptions are grounded in actual observations. 2008-01-01T00:00:00Z https://refubium.fu-berlin.de/handle/fub188/19120 A classification scheme of 3D interaction techniques Kettner, Lutz 1995-01-01T00:00:00Z https://refubium.fu-berlin.de/handle/fub188/17836 A conceptual model for Semantic Web Spaces Paslaru Bontas, Elena; Nixon, Lyndon J. B.; Tolksdorf, Robert 2005-01-01T00:00:00Z https://refubium.fu-berlin.de/handle/fub188/18938 A concurrency monad based on constructor primitives Scholz, Enno A monad is presented which is suitable for writing concurrent programs in a purely functional programming language. In contrast to, for instance, the IO monad [Launchbury, Peyton Jones 94], the primitives added to the functional language are not represented as built-in functions operating on the monad, but rather by Perry-style constructors [Perry 90] of a distinguished algebraic data type. Therefore, monadic expressions representing concurrent computations are not only first-class objects of the language; in addition, they may even be decomposed. A number of examples show that decomposability of concurrent code is crucial for the purely functional construction of more powerful concurrency abstractions like rendezvous, remote procedure call, and critical regions from the primitives. The paper argues that this technique helps to remedy a recurrent dilemma in the design of concurrent programming languages, namely, how to keep the language small, coherent, and rigorously defined, yet to provide the programmer with all the communication constructs required. It is suggested that functional languages are not only capable of describing concurrent programs, but that in terms. 1995-01-01T00:00:00Z