A Collection of Papers and Memoirs Celebrating the Contribution of Rod Burstall to Advances in Computer Science
are dedicated to Professor Rod Burstall, and, as a collection of papers, memoirs and incidental pieces, form a Festschrift for Rod. The contributions are made by some of the many who know Rod and have been in uenced by him. The ...
POP, A Broad-Spectrum Programming Language, 1967–2002
This paper discusses the POP-2 language and Multipop time-sharing system developed during the second half of the 1960s. POP-2's expressiveness spanned numeric and symbolic programming and supported experiments in logic of programming languages (...
Should ML be Object-Oriented?
At a fundamental level, functional and object-oriented programming languages are all ‘higher-order’, in the sense that they support computing with values that are themselves pieces of program code encapsulated with a local environment. In ...
The List Introduction Strategy for the Derivation of Logic Programs
We present a new program transformation strategy based on the introduction of lists. This strategy is an extension of the tupling strategy which is based on the introduction of tuples of fixed length. The list introduction strategy overcomes ...
Architectural Specifications in CASL
One of the most novel features of CASL, the Common Algebraic Specification Language, is the provision of so-called architectural specifications for describing the modular structure of software systems. A brief discussion of refinement of CASL ...
Institution Morphisms
Institutions formalise the intuitive notion of logical system, including syntax, semantics, and the relation of satisfaction between them. Our exposition emphasises the natural way that institutions can support deduction on sentences, and ...
Variations on Algebra: Monadicity and Generalisations of Equational Therories
This is a largely tutorial paper about the categorical notion of monad and the ways in which monads on different categories correspond to variations on the standard notion of algebraic theory.
Shallow Linear Action Graphs and their Embeddings
Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents ...
A New Approach to Abstract Syntax with Variable Binding
The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and Mostowski in the 1930s, supports notions of ‘name-abstraction’ and ‘fresh name’ that provide a new way to represent, compute with, and reason about the syntax of ...
Three Inadequate Models
The connection between operational and denotational semantics is of longstanding interest in the study of programming languages. The emphasis has been on positive results, whether for adequacy or full abstraction. One normally considers the ...
Dependently Typed Records in Type Theory
The language Pebble of Burstall and Lampson proposed dependent types as the underlying principle in a unified framework to explain facilities for programming in the large, such as modules and signatures, as well as for programming in the small. ...
Proofs-as-Programs as a Framework for the Design of an Analogy-Based ML Editor
CYNTHIA is a transformation-based editor for a functional subset of ML that lies somewhere between a structure editor and a framework for formal program development. Users construct programs from existing code by applying editing commands that ...
The Ancient Theory of Mind
Happiness and suffering are both the result of two factors combined: the situation in which one is placed and our consciousness of it. Happiness is not only of personal importance, it is also a necessary factor for ensuring peace in society. ...