Results 1 - 10 of 46

An Exploration of the Bird-Meertens Formalism

by Roland Backhouse - In STOP Summer School on Constructive Algorithmics, Abeland , 1989
"... Two formalisms that have been used extensively in the last few years for the calculation of programs are the Eindhoven quantifier notation and the formalism developed by Bird and Meertens. Although the former has always been applied with ultimate goal the derivation of imperative programs and th ..."
Abstract - Cited by 32 (3 self) - Add to MetaCart
and the latter with ultimate goal the derivation of functional programs there is a remarkable similarity in the formal games that are played. This paper explores the Bird-Meertens formalism by expressing and deriving within it the basic rules applicable in the Eindhoven quantifier notation. 1 Calculation

Parallelism and the Bird-Meertens Formalism

by D. B. Skillicorn , 1992
"... One of the major reasons for the lack of practical use of parallel computers has been the absence of a suitable model of parallel computation. A useful general model must be architecture independent, must realistically reflect execution costs, and must reduce the cognitive overhead of managing massi ..."
Abstract - Cited by 11 (0 self) - Add to MetaCart
calculi, Bird-Meertens formalism. 1 Introduction There are many interesting problems in the de...

Mapping Adl to the Bird-Meertens Formalism

by Brad Alexander , 1994
"... Bulk data operations such as map and reduce are an elegant medium for expressing repetitive computation over aggregate data structures. They also serve as a tool for abstraction: not all details of the computation, such as the exact ordering of the constituent operations, need to be specified by the ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
operators to each other and to their underlying data types. Much of this research stems from Category Theory where a number of general properties of types and operators have been established. One theoretical framework in particular, the Bird-Meertens Formalism (BMF), has proved to be extremely useful

Automated Parallelisation of code written in the Bird-Meertens Formalism

by Joseph Windows , 2003
"... The Bird-Meertens Formalism (BMF) is a calculus of higher order functions used to derive functional programs. It shows promise as a basis for a parallel model due to its highly parallelisable building blocks and the ease in which its code can be transformed through equalities. There is a reasonably ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
The Bird-Meertens Formalism (BMF) is a calculus of higher order functions used to derive functional programs. It shows promise as a basis for a parallel model due to its highly parallelisable building blocks and the ease in which its code can be transformed through equalities. There is a reasonably

The Bird-Meertens Formalism as a Parallel Model

by D. B. Skillicorn - Software for Parallel Computation, volume 106 of NATO ASI Series F , 1993
"... The expense of developing and maintaining software is the major obstacle to the routine use of parallel computation. Architecture independent programming offers a way of avoiding the problem, but the requirements for a model of parallel computation that will permit it are demanding. The BirdMeertens ..."
Abstract - Cited by 46 (0 self) - Add to MetaCart
The expense of developing and maintaining software is the major obstacle to the routine use of parallel computation. Architecture independent programming offers a way of avoiding the problem, but the requirements for a model of parallel computation that will permit it are demanding. The BirdMeertens

Parallelization of Divide-and-Conquer in the Bird-Meertens Formalism

by Sergei Gorlatch, Christian Lengauer , 1995
"... . An SPMD parallel implementation schema for divide-and-conquer specifications is proposed and derived by formal refinement (transformation) of the specification. The specification is in the form of a mutually recursive functional definition. In a first phase, a parallel functional program schema is ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
is constructed which consists of a communication tree and a functional program that is shared by all nodes of the tree. The fact that this phase proceeds by semanticspreserving transformations in the Bird-Meertens formalism of higher-order functions guarantees the correctness of the resulting functional

Practical Structured Parallelism Using BMF

by David C. Crooke , 1998
"... This thesis concerns the use of the Bird-Meertens Formalism as a mechanism to control parallelism in an imperative programming language. ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
This thesis concerns the use of the Bird-Meertens Formalism as a mechanism to control parallelism in an imperative programming language.

Process Calculi à la Bird-Meertens

by Luís S. Barbarosa , 2001
"... This paper is an attempt to apply the reasoning principles and calculational style underlying the so-called Bird-Meertens formalism to the design of process calculi, parametrized by a behaviour model. In particular, basically equational and pointfree proofs of process properties are given, relying o ..."
Abstract - Add to MetaCart
This paper is an attempt to apply the reasoning principles and calculational style underlying the so-called Bird-Meertens formalism to the design of process calculi, parametrized by a behaviour model. In particular, basically equational and pointfree proofs of process properties are given, relying

Towards Data-Parallel Skeletons for Grid Computing: An Itinerant Mobile Agent Approach

by Seng Wai Loke
"... We present an approach to using the skeleton paradigm for grid computing, where the skeletons are executed by mobile agents. The skeletons we use are based on the Bird-Meertens Formalism, involving higher-order operations over data types. 1. ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
We present an approach to using the skeleton paradigm for grid computing, where the skeletons are executed by mobile agents. The skeletons we use are based on the Bird-Meertens Formalism, involving higher-order operations over data types. 1.

Algorithms from Theorems

by Johan Jeuring, Johan Jeuring - Programming Concepts and Methods , 1990
"... In this paper we show how algorithms are derived from their specification in the Bird-Meertens form,dl,m. The Bird-Meertens formalism is a programming methodology which provides a concise functional notation for algorithms and for every data structure a promotion theorem for proving equalities of ..."
Abstract - Cited by 11 (5 self) - Add to MetaCart
In this paper we show how algorithms are derived from their specification in the Bird-Meertens form,dl,m. The Bird-Meertens formalism is a programming methodology which provides a concise functional notation for algorithms and for every data structure a promotion theorem for proving equalities
Results 1 - 10 of 46