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

A. Bertoni; G. Mauri; P. Miglioli

DOI:10.1007/3-540-09981-6_4
Corpus ID: 26320534

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}
}

A. Bertoni, G. Mauri, P. Miglioli
Published in Symposium on Programming 22 April 1980
Computer Science

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.

View via Publisher

link.springer.com

6 Citations

Semantics of algorithmic languages

N. N. Nepeivoda
Computer Science, Linguistics
1984

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

Samuel N. Kamin
Computer Science, Mathematics
TOPL
1983

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

Francisco González, A. Cardona, Pierangelo Masarati, J. Pombo
Geology
Animal - science proceedings
2022

Preface. In Memoriam Pierangelo Miglioli (1946–1999)

M. Ornaghi
Computer Science
Stud Logica
2003

Abstract Data Types and Their Extensions within a Constructive Logic

A. Bertoni, G. Mauri, P. Miglioli, Mario Ornaghi
Computer Science
Semantics of Data Types
1984

References

SHOWING 1-10 OF 19 REFERENCES

SORT BY

Data types, abstract data types and their specification problem

M. Majster
Computer Science, Mathematics
1979

Existential Quantifiers in Abstract Data Types

M. Broy, W. Dosch, H. Partsch, P. Pepper, M. Wirsing
Mathematics
ICALP
1979

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

Jr. Hartley Rogers
Computer Science
1969

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

James H. Morris
Computer Science
POPL
1973

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.