All Outputs (51)

Review of Mike Gordon and Tom Melham (editors), An Introduction to HOL, a Theorem Proving Environment for Higher Order Logic (1994)
Journal Article
Hutton, G. (1994). Review of Mike Gordon and Tom Melham (editors), An Introduction to HOL, a Theorem Proving Environment for Higher Order Logic. Journal of Functional Programming, 4(4),

Categories, Allegories, and Circuit Design (1994)
Conference Proceeding
Brown, C., & Hutton, G. (1994). Categories, Allegories, and Circuit Design.

Languages based upon binary relations offer an appealing setting for constructing programs from specifications. For example, working with relations rather than functions allows specifications to be more abstract (for example, many programs have a na... Read More about Categories, Allegories, and Circuit Design.

The Ruby Interpreter (1993)
Book
Hutton, G. (1993). The Ruby Interpreter. Department of Computing Science

Ruby is a relational calculus for designing digital circuits. This document is a guide to the Ruby interpreter, which allows a special class of $quot;implementable$quot; Ruby programs to be executed. The Ruby interpreter is written in the functional... Read More about The Ruby Interpreter.

Between functions and relations in calculating programs (1992)
Thesis
Hutton, G. M. Between functions and relations in calculating programs. (Thesis). University of Glasgow. Retrieved from https://nottingham-repository.worktribe.com/output/1164861

This thesis is about the calculational approach to programming, in which one derives programs from specifications. One such calculational paradigm is Ruby, the relational calculus developed by Jones and Sheeran for describing and designing circuits.... Read More about Between functions and relations in calculating programs.

Higher-Order Functions for Parsing (1992)
Journal Article
Hutton, G. (1992). Higher-Order Functions for Parsing. Journal of Functional Programming, 2(3),

In combinator parsing, the text of parsers resembles BNF notation. We present the basic method, and a number of extensions. We address the special problems presented by white-space, and parsers with separate lexical and syntactic phases. In partic... Read More about Higher-Order Functions for Parsing.

A Calculational Theory of Pers as Types (1992)
Book
Hutton, G., & Voermans, E. (1992). A Calculational Theory of Pers as Types. Department of Computing Science

In the calculational approach to programming, programs are derived from specifications by algebraic reasoning. This report presents a calculational programming framework based upon the notion of binary relations as programs, and partial equivalence... Read More about A Calculational Theory of Pers as Types.

A Relational Derivation of a Functional Program (1992)
Conference Proceeding
Hutton, G. (1992). A Relational Derivation of a Functional Program.

This article is an introduction to the use of relational calculi in deriving programs. Using the relational caluclus Ruby, we derive a functional program that adds one bit to a binary number to give a new binary number. The resulting program is uns... Read More about A Relational Derivation of a Functional Program.

Making Functionality More General (1992)
Conference Proceeding
Hutton, G., & Voermans, E. (1992). Making Functionality More General.

The definition for the notion of a "function" is not cast in stone, but depends upon what we adopt as types in our language. With partial equivalence relations (pers) as types in a relational language, we show that the functional relations are preci... Read More about Making Functionality More General.

Functional Programming With Relations (1991)
Conference Proceeding
Hutton, G. (1991). Functional Programming With Relations.

While programming in a relational framework has much to offer over the functional style in terms of expressiveness, computing with relations is less efficient, and more semantically troublesome. In this paper we propose a novel blend of the function... Read More about Functional Programming With Relations.

Modularity and implementation of mathematical operational semantics
Conference Proceeding
Jaskelioff, M. J., Ghani, N., & Hutton, G. Modularity and implementation of mathematical operational semantics.

Structural operational semantics is a popular technique for specifying the meaning of programs by means of inductive clauses. One seeks syntactic restrictions on those clauses so that the resulting operational semantics is well-behaved. This approa... Read More about Modularity and implementation of mathematical operational semantics.

A tool for relational programmers
Book
Hutton, G., Meijer, E., & Voermans, E. A tool for relational programmers. Chalmers University, Sweden