Correct and optimal implementations of recursion in a simple programming language

Authors:
Jean Vuillemin
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1974

Citing 1
Cited 9

Tree-Manipulating Systems and Church-Rosser Theorems

Journal of the ACM (JACM)

Parallel beta reduction is not elementary recursive

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel beta reduction is not elementary recursive

Information and Computation
An interpreter generator using tree pattern matching

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A syntactic correspondence between context-sensitive calculi and abstract machines

Theoretical Computer Science
Aspects of Applicative Programming for Parallel Processing

IEEE Transactions on Computers
Reduction strategies for left-linear term rewriting systems

Processes, Terms and Cycles
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation

Theoretical Computer Science
CONCUR: A language for continuous, concurrent processes

Computer Languages
The ζ-Semantics: A Comprehensive Semantics for Functional Programs

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the worst solution value that can be ...