Axiomatic data type specifications: A first order theory of linear lists

DOI10.1007/BF00289260zbMath0463.68025OpenAlexW1986396304MaRDI QIDQ1153682

Daniel J. Moore, Bruce Russell

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

data type specificationslinear listsformal first order theory

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Data structures (68P05)

Related Items (1)

On decidability of list structures

Cites Work

• On the completeness of the inductive assertion method
• Model theory
• Subgoal induction
• Abstract data types and the development of data structures
• An axiomatic basis for computer programming
• Proof of a structured program: 'The sieve of Eratosthenes'
• Contributions to the Theory of Optimal Control. A General Procedure for the Computation of Switching Manifolds
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Axiomatic data type specifications: A first order theory of linear lists