Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools

@inproceedings{Bertoni1980TowardsAT,
  title={Towards a Theory of Abstract Data Types: A Discussion on Problems and Tools},
  author={Alberto Bertoni and Giancarlo Mauri and Pierangelo Miglioli},
  booktitle={Symposium on Programming},
  year={1980}
}
This paper aims to show that, in order to capture a quite relevant feature such as the recursiveness of abstract data types, Model Theory works better than Category Theory. 
6 Citations
Semantics of algorithmic languages
This is a survey of methods of formalizing semantics of programming languages (algorithmic languages and specification languages). Principal attention is devoted to the logical approach.
Final Data Types and Their Specification
TLDR
A final data type is the smallest structure having a given behavior; every other structure having that behavior maps onto it homomorphically, which makes the final datatype specification a particularly good source of information about the abstraction it realizes, and eliminates "implementation bias" from the method.
A Contructive Method for Abstract Algebraic Software Specification
  • H. Klaeren
  • Computer Science, Mathematics
    Theor. Comput. Sci.
  • 1984
Preface

References

SHOWING 1-10 OF 19 REFERENCES
Existential Quantifiers in Abstract Data Types
TLDR
Hierarchies of abstract data types are specified by axioms which are positive formulas consisting of universally and existentially quantified disjunctions and conjunctions of equations to investigate the existence of terminal algebras.
Final Algebra Semantics and Data Type Extensions
  • M. Wand
  • Computer Science, Mathematics
    J. Comput. Syst. Sci.
  • 1979
Theory of Recursive Functions and Effective Computability
TLDR
Central concerns of the book are related theories of recursively enumerable sets, of degree of un-solvability and turing degrees in particular and generalizations of recursion theory.
Types are not sets
TLDR
The title is not a statement of fact, of course, but an opinion about how language designers should think about types, which focuses on the role of type checking.
Handbook of mathematical logic
TLDR
Model Theory (Contributors: J.J. Jech, I.C. Juhasz, K. Kunen, M.E. Rudin, J.R. Smorynski, R.S. Statman, A.A. Shore, S.G. Troelstra).
...
...