An algebraic theory of recursive definitions and recursive languages

Authors:
Eric G. Wagner
Affiliations:
-
Venue:
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Year:
1971

Citing 0
Cited 2

Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
From algebras to programming languages

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is the introductory paper in a series devoted to a general algebraic theory of “recursive definitions” and “recursive languages”. In this paper we present the fundamental concepts and theorems concerning the basic structure (basic syntax), the semantics and the combination and manipulation of “recursive definitions” and the closure properties of “recursive languages”. The development is carried out within the framework of category theory and lattice theory. To illustrate the generality of the approach and our results we show how they apply directly to the specific examples of “recursive languages” of (generalized) context-free grammars, Turing machines, and flowcharts.