Correct and optimal implementations of recursion in a simple programming language
Reads0
Chats0
TLDR
This paper describes an implementation of recursion which is both correct and optimal in a general class of sequential languages, and therefore constitutes an attractive alternative to both “ call-by-name” and “call- by-value”.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1974-12-01 and is currently open access. It has received 125 citations till now. The article focuses on the topics: Mutual recursion & Left recursion.read more
Citations
More filters
Journal ArticleDOI
LCF considered as a programming language
TL;DR: Study of connections between denotational and operational semantics for a simple programming language based on LCF finds that by allowing further parallel facilities, every r.e. element of the fully abstract semantics becomes definable, thus characterising the programming language, up to interdefinability, from the set of elements of the domains of the semantics.
Journal ArticleDOI
Viewing control structures as patterns of passing messages
TL;DR: A light sensing apparatus is described which employs a GaAsP MOS light-receiving element to which a potential is applied for creating a depletion region.
Book ChapterDOI
Equations and rewrite rules: a survey
Gérard Huet,Derek C. Oppen +1 more
TL;DR: The problem of "solving" equations, the problem of proving termination of sets of rewrite rules, and the decidability and complexity of word problems and of combinations of equational theories are discussed.
Book
Purely functional data structures
TL;DR: This work describes several techniques for designing functional data structures, and numerous original data structures based on these techniques, including multiple variations of lists, queues, double-ended queues, and heaps, many supporting more exotic features such as random access or efficient catenation.
Journal ArticleDOI
Conception, evolution, and application of functional programming languages
TL;DR: The foundations of functional programming languages are examined from both historical and technical perspectives, and current research areas—such as parallelism, nondeterminism, input/output, and state-oriented computations—are examined with the goal of predicting the future development and application of functional languages.
References
More filters
Book
Outline of a Mathematical Theory of Computation
TL;DR: However, Scott does realize that the approach argued for above is simply an argument for an approach that accomodates human understanding of computation and that the operational approach must not be ignored because the machines that the programs of study run on are not capable of dealing with such an abstract level of understanding.
Dissertation
Lambda-calculus models of programming languages.
TL;DR: This paper presents a meta-management model that combines a probabilistic approach to management, a reinforcement-gauging approach, and a management style called “strategic decision-making” that was developed during the course of this dissertation.
Journal ArticleDOI
Tree-Manipulating Systems and Church-Rosser Theorems
TL;DR: It is shown that recursively defined functions are single-valued despite the nondeterminism of the evaluation algorithm and that these functions solve their defining equations in a “canonical” manner.
Book
Recursive definitions of partial functions and their computations
J. M. Cadiou,Zohar Manna +1 more
TL;DR: In this article, the authors present a syntactic and semantic model for recursive definitions, and study the relation between their computed functions and their fixpoints, which are also computed functions of the recursive definition.