Operational Theories of Improvement in Functional Languages (Extended Abstract)

Operational Theories of Improvement in Functional Languages (Extended Abstract) (1991)

Cached

Download Links

[www.cs.chalmers.se]

Other Repositories/Bibliography

DBLP

by David Sands

Venue:	In Proceedings of the Fourth Glasgow Workshop on Functional Programming
Citations:	19 - 9 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Operational Theories of Improvement in Functional Languages (Extended Abstract)	user correction - Legacy Corrections
AUTHOR NAME	David Sands	SVM HeaderParse 0.1
AUTHOR AFFIL	; Department of Computing, Imperial College; 1	SVM HeaderParse 0.2
AUTHOR ADDR	; 180 Queens Gate, London SW7 2BZ	SVM HeaderParse 0.1
ABSTRACT	) David Sands y Department of Computing, Imperial College 180 Queens Gate, London SW7 2BZ email: ds@uk.ac.ic.doc Abstract In this paper we address the technical foundations essential to the aim of providing a semantic basis for the formal treatment of relative efficiency in functional languages. For a general class of "functional" computation systems, we define a family of improvement preorderings which express, in a variety of ways, when one expression is more efficient than another. The main results of this paper build on Howe's study of equality in lazy computation systems, and are concerned with the question of when a given improvement relation is subject to the usual forms of (in)equational reasoning (so that, for example, we can improve an expression by improving any sub-expression). For a general class of computation systems we establish conditions on the operators of the language which guarantee that an improvement relation is a precongruence. In addition, for...	user correction - Legacy Corrections
YEAR	1991	INFERENCE
VENUE	In Proceedings of the Fourth Glasgow Workshop on Functional Programming	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	298--311	INFERENCE
CITATIONS	18 found	ParsCit 1.0