Recursive data structures

DOI10.1007/BF00976239zbMath0301.68037DBLPjournals/ijpp/Hoare75OpenAlexW2028074529WikidataQ29544937 ScholiaQ29544937MaRDI QIDQ4055171

C. A. R. Hoare

Publication date: 1975

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00976239

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01)

Related Items (13)

Explicit cyclic substitutions ⋮ A logic of reachable patterns in linked data-structures ⋮ Inheritance hierarchies: Semantics and unifications ⋮ A set constructor for inductive sets in Martin-Löf's type theory ⋮ Mechanizing structural induction. I: Formal system ⋮ Mechanizing structural induction. II: Strategies ⋮ Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees ⋮ Solving constrained Horn clauses over algebraic data types ⋮ More comments on the programming language Pascal ⋮ Language design methods based on semantic principles ⋮ On removing the machine from the language ⋮ Algebraic specification of data types: A synthetic approach ⋮ A view of computability on term algebras

Uses Software

• ALGOL 68
• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Report on the algorithmic language ALGOL 68
• The programming language Pascal
• Proof of correctness of data representations
• A generalized technique for symbol manipulation and numerical calculation
• Recursive functions of symbolic expressions and their computation by machine, Part I
• A contribution to the development of ALGOL
• Proving Properties of Programs by Structural Induction

This page was built for publication: Recursive data structures