Richard Bird, Lambert Meertens
Abstract. A nested datatype, also known as a non-regular datatype, is a parametrised datatype whose declaration involves different instances of the accompanying type parameters. Nested datatypes have...
The ABC Structure Editor Structure-based Editing for the ABC Programming Environment (2007)
Programming Environment, S. Pemberton, G. Van Rossum, Lambert Meertens, Steven Pemberton, ...
ABC is an interactive programming language where both ease of learning and ease of use stood high amongst its principle design aims. The language is embedded in a dedicated environment that includes...
S. Pemberton, Lambert Meertens, Steven Pemberton
The ergonomics of computer interfaces. Designing a system for human use
Stephen Fitzpatrick, Lambert Meertens
This paper reports on an algorithm for anytime, stochastic, distributed constraint optimization that uses iterated, peer-to-peer interaction to try to achieve rapid, approximate solutions to large...
A Framework, Stephen Fitzpatrick, Lambert Meertens
Soft, real-time distributed graph coloring is presented as a simplification of the problem of distributed resource management in an environment where communication is expensive and subject to...
Lambert Meertens, Stephen Fitzpatrick
This report details an approach to the real-time coordination of large networks of short-range sensors that communicate over short-range, low-bandwidth, high-latency radio channels. Each sensor is...
Stephen Fitzpatrick, Lambert Meertens
This paper reports on a simple, decentralized, anytime, stochastic, soft graph-colouring algorithm. The algorithm is designed to quickly reduce the number of colour conflicts in large, sparse graphs...
Stephen Fitzpatrick, Cordell Green, Lambert Meertens
• Conceptual architecture for dynamic sensor networks • Scheduling in the ANTs challenge problem – Challenge problem models – An iterative repair scheduler based on conflict detection –...
This documents lists some infrastructural needs in component-oriented software construction. These needs appear to form an intricate mesh of interrelated issues. An attempt has been made to unravel...
Designing Constraint Maintainers for User Interaction (1998)
This paper is concerned with the question: How to design, given a constraint R, constraint maintainers of it that are "intuitively natural". 1 Basic definitions and notation
This paper is concerned with the construction of basic building blocks for polytypic programming. A polytypic program is a program that is generic in a type constructor, say F ; by specializing it...
Calculate Polytypically! (1996)
A polytypic function definition is a function definition that is parametrised with a datatype. It embraces a class of algorithms. As an example we define a simple polytypic "crush"...
A Translation from Attribute Grammars to Catamorphisms (1994)
Maarten Fokkinga, Johan Jeuring, Lambert Meertens, Erik Meijer
G has a simple form, so that the actual translation can be formulated without too many indices and the like. 1 . The context free grammar G determines a functor F . . Lemma T is a subset of the...
Fokkinga, Maarten, Meertens, Lambert
We present the category-theoretic notion of adjunction in a way that makes it easy to formally calculate with it; an acquaintance with its algebraic properties may greatly help in understanding the...
Maarten Fokkinga, Lambert Meertens
ing from the particulars, the situation above is described as follows. ffl There are two categories A and B . [In the above example A = Set and B = Mon .] ffl There are two functors F : A ! B and G:...
The ABC structure editor: structure-based editing for the ABC programming environment (1992)
S. Pemberton, G. Van Rossum, Lambert Meertens, Steven Pemberton, Guido Van Rossum
ABC is an interactive programming language where both ease of learning and ease of use stood high amongst its principle design aims. The language is embedded in a dedicated environment that includes...
A Translation from Attribute Grammars to (1990)
Maarten Fokkinga, Johan Jeuring, Lambert Meertens, Erik Meijer
Let AG be an attribute grammar, with underlying context free grammar G and attribute evaluation rules A. The function that decorates —according to A — a parse tree with attribute values and then...
Bitonic Sort on Ultracomputers (1979)
Batcher's bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in Q((log n) 2 ) stages. When adapted to conventional computers, it gives rise to an...