Functional Programming With Relations

QR Code

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 functional and relational styles. We identify a class of...

Full description

Bibliographic Details
Main Author:	Hutton, Graham
Format:	Conference or Workshop Item
Published:	1991
Online Access:	https://eprints.nottingham.ac.uk/239/

Similar Items

Between functions and relations in calculating programs
by: Hutton, Graham
Published: (1992)

A Relational Derivation of a Functional Program
by: Hutton, Graham
Published: (1992)

Higher-Order Functions for Parsing
by: Hutton, Graham
Published: (1992)

Fold and Unfold for Program Semantics
by: Hutton, Graham
Published: (1998)

Programs for cheap!
by: Hackett, Jennifer, et al.
Published: (2015)

Making Functionality More General
by: Hutton, Graham, et al.
Published: (1992)

Proof Methods for Corecursive Programs
by: Hutton, Graham, et al.
Published: (2005)

Proof methods for structured corecursive programs
by: Gibbons, Jeremy, et al.
Published: (1999)

Back to Basics: Deriving Representation Changers Functionally
by: Hutton, Graham, et al.
Published: (1996)

A tool for relational programmers
by: Hutton, Graham, et al.
Published: (1994)

AutoBench: comparing the time performance of Haskell programs
by: Handley, Martin A.T., et al.
Published: (2018)

Contractive functions on infinite data structures
by: Capretta, Venanzio, et al.
Published: (2017)

When is a function a fold or an unfold?
by: Gibbons, Jeremy, et al.
Published: (2001)

The under-performing unfold: a new approach to optimising corecursive programs
by: Hackett, Jennifer, et al.
Published: (2013)

The Countdown Problem
by: Hutton, Graham
Published: (2002)

The Ruby Interpreter
by: Hutton, Graham
Published: (1993)

Review of Mike Gordon and Tom Melham (editors), An Introduction to HOL, a Theorem Proving Environment for Higher Order Logic
by: Hutton, Graham
Published: (1994)

Report on BCTCS 2005
by: Hutton, Graham
Published: (2005)

A Tutorial on the Universality and Expressiveness of Fold
by: Hutton, Graham
Published: (1999)

Worker/wrapper/makes it/faster
by: Hackett, Jennifer, et al.
Published: (2014)

Work it, wrap it, fix it, fold it
by: Sculthorpe, Neil, et al.
Published: (2014)

Towards modular compilers for effects
by: Day, Laurence, et al.
Published: (2012)

Compiling concurrency correctly: cutting out the middle man
by: Hu, Liyang, et al.
Published: (2010)

Compact fusion
by: Hope, Catherine, et al.
Published: (2006)

Calculating an exceptional machine
by: Hutton, Graham, et al.
Published: (2006)

Bananas in space: extending fold and unfold to exponential types
by: Meijer, Erik, et al.
Published: (1995)

The Generic Approximation Lemma
by: Hutton, Graham, et al.
Published: (2001)

Compiling Exceptions Correctly
by: Hutton, Graham, et al.
Published: (2004)

Categories, Allegories, and Circuit Design
by: Brown, Carolyn, et al.
Published: (1994)

Calculating an Exceptional Machine
by: Hutton, Graham, et al.
Published: (2005)

Monadic parser combinators
by: Hutton, Graham, et al.
Published: (1996)

A Calculational Theory of Pers as Types
by: Hutton, Graham, et al.
Published: (1992)

Accurate Step Counting
by: Hope, Catherine, et al.
Published: (2005)

Monadic parsing in Haskell
by: Hutton, Graham, et al.
Published: (1998)

Towards a theory of reach
by: Fowler, Jonathan, et al.
Published: (2016)

Calculating correct compilers
by: Bahr, Patrick, et al.
Published: (2015)

Cutting out continuations
by: Hutton, Graham, et al.
Published: (2016)

Failing faster: overlapping patterns for property-based testing
by: Fowler, Jonathan, et al.
Published: (2016)

Parametric polymorphism and operational improvement
by: Hackett, Jennifer, et al.
Published: (2018)

Compiling a 50-year journey
by: Hutton, Graham, et al.
Published: (2017)