Operational Theories of Improvement in Functional Languages (Extended Abstract)

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

by David Sands

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

92	Equality In Lazy Computation Systems – Douglas J. Howe - 1998
218	The Lazy Lambda Calculus – Samson Abramsky - 1990
55	Total Correctness by Local Improvement in the Transformation of Functional Programs – David Sands - 1996
109	Bisimilarity as a theory of functional programming – Andrew Gordon
375	Deforestation: Transforming programs to eliminate trees – Philip Wadler - 1990
533	A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
35	From Operational Semantics to Domain Theory – Ian A. Mason, Scott F. Smith, Carolyn L. Talcott - 1995
9	Fully abstract models of the typed - calculus – R Milner - 1977
105	A Syntactic Theory of Sequential Control – M Felleisen, D P Friedman, E E Kohlbecker, B F Duba - 1987
40	A Naïve Time Analysis and its Theory of Cost Equivalence – David Sands - 1995
1225	Introduction to functional programming – Philip Wadler - 1995
219	Call-by-name, call-by-value, and the -calculus – G D Plotkin - 1975
102	Functional programming and input/output – A D Gordon - 1994
2970	Communication and Concurrency – R Milner - 1989
597	Concurrency and automata on infinite sequences – D M R Park - 1981
73	Operationally-based theories of program equivalence – Andrew Pitts - 1997
27	Proving the Correctness of Recursion-Based Automatic Program Transformations – David Sands - 1996
155	The Concept of a Supercompiler – Valentin F. Turchin - 1986
14	About transformation system: A theoretical study – L Kott - 1978