Applications of feedback in functional programming

Authors:
Robert M. Keller;Gary Lindstrom
Affiliations:
Department of Computer Science, University of Utah, Salt Lake City, Utah;Department of Computer Science, University of Utah, Salt Lake City, Utah
Venue:
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Year:
1981

Citing 7
Cited 5

Petri Nets

ACM Computing Surveys (CSUR)
The Theory of Parsing, Translation, and Compiling

The Theory of Parsing, Translation, and Compiling
A Family Of Pass-Oriented Attribute Grammar Evaluators

ACM '78 Proceedings of the 1978 annual conference
Applications of feedback in functional programming

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Applicative caching: Programmer control of object sharing and lifetime in. distributed implementations of applicative languages

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
A lazy evaluator

POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
The coroutine model of attribute grammar evaluation.

The coroutine model of attribute grammar evaluation.

Efficient demand-driven evaluation. Part 1

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Static evaluation of functional programs

SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Applications of feedback in functional programming

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Applicative caching: Programmer control of object sharing and lifetime in. distributed implementations of applicative languages

FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Lenient evaluation is neither strict nor lazy

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

The use of feedback loops in functional programming languages is explored, particularly in the context of graph-based semantic models. In this setting, program cycles (termed “applicative loops”) offer benefits that are both conceptual (e.g. providing simpler programs) and pragmatic (e.g. offering improved execution efficiency). These benefits are discussed under three general categories, each illustrated with a sample problem: (1) direct encoding of cyclic stream processing algorithms, illustrated by a Dynamo-style “continuous” simulation; (2) resolution of complex evaluation order problems, illustrated by attribute grammar parsing; (3) programmed management of computational aggressiveness, illustrated by a bounded-buffer controller.