All Outputs (4)

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.