Classes of functions for computing on binary trees (Extended Abstract)

Authors:
F. Hawrusik;K. N. Venkataraman;A. Yasuhara
Affiliations:
-;-;-
Venue:
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Year:
1981

Citing 6
Cited 1

Proving Properties of Complex Data Structures

Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras

Journal of the ACM (JACM)
Reasoning About Recursively Defined Data Structures

Journal of the ACM (JACM)
Abstract data types and the development of data structures

Communications of the ACM
Efficient reducibility between programming systems (Preliminary Report)

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Data type specification: Parameterization and the power of specification techniques

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Decidability of the purely existential fragment of the theory of term algebras

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper constitutes part of a general investigation into abstract computability on finitely generated free algebras (term algebras). The general idea is to determine an abstract computational process appropriate for computing on term algebras, the effectiveness of which should be apparent from the inductive structure of that domain, without reference to computability on the natural numbers (say, via coding).