Add to ORKGThe Bird-Meertens Formalism, or `Squiggol', is a calculus for the construction of programs from their specifications by a process of equational reasoning. Developments are directed by considerations of data, as opposed to program, structure. This paper presents a brief introduction to the philosophy and notation of the calculus, in the guise of the (well-known) derivation of a linear-time solution to the `maximum segment sum' problem
N.G. (Dick) de Bruijn was the first to develop a formal language suitable for the complete expressio...
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...
It is an old and beautiful dream of computer science to synthesize software applications from specif...
The Bird–Meertens Formalism, colloquially known as “Squiggol”, is a calculus for program transformat...
In this report, we deal with the paradigm of Constructive Algorithmics or the science of program tra...
AbstractThis paper is an attempt to apply the reasoning principles and calculational style underlyin...
This paper derives a hierarchy of algorithms for pattern matching on arrays in the Bird-Meertens cal...
AbstractA uniform treatment of specifications, programs, and programming is presented. The treatment...
A large part of the effort in formal program developments is expended on repeating the same derivati...
This paper is an attempt to apply the reasoning principles and calculational style underlying the so...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
In chapter one we begin with a historical summary of the iterative programming paradigm. This leads ...
The maximum segment sum problem is to compute, given a list of integers, the largest of the sums of ...
The use of mathematics in the specification and design of practical software systems is discussed. A...
N.G. (Dick) de Bruijn was the first to develop a formal language suitable for the complete expressio...
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...
It is an old and beautiful dream of computer science to synthesize software applications from specif...
The Bird–Meertens Formalism, colloquially known as “Squiggol”, is a calculus for program transformat...
In this report, we deal with the paradigm of Constructive Algorithmics or the science of program tra...
AbstractThis paper is an attempt to apply the reasoning principles and calculational style underlyin...
This paper derives a hierarchy of algorithms for pattern matching on arrays in the Bird-Meertens cal...
AbstractA uniform treatment of specifications, programs, and programming is presented. The treatment...
A large part of the effort in formal program developments is expended on repeating the same derivati...
This paper is an attempt to apply the reasoning principles and calculational style underlying the so...
In this paper we demonstrate that the basic rules and calculational techniques used in two extensive...
We describe a formalization of the meta-mathematics of programming in a higher-order logical calculu...
In chapter one we begin with a historical summary of the iterative programming paradigm. This leads ...
The maximum segment sum problem is to compute, given a list of integers, the largest of the sums of ...
The use of mathematics in the specification and design of practical software systems is discussed. A...
N.G. (Dick) de Bruijn was the first to develop a formal language suitable for the complete expressio...
Using Martin-L\uf6f\u27s set theory as a programming logic one identifies specifications with sets a...
It is an old and beautiful dream of computer science to synthesize software applications from specif...