Computer Science Logic and 8th Kurt Gödel Colloquium
Bakhadyr Khoussainov: On Algebraic Specifications of Abstract Data Types
Welcome and News
Host Institutions
Calls and Deadlines
Social Program
Location and Venue
Colocated Events
Authors' instructions
Print current pagePrint this page
In this paper we address long standing open problems of Bergstra and Tucker about specifications of abstract data types (ADTs) by means of equations or conditional equations. By an ADT we mean the isomorphism type of an algebra. An ADT is algebraically specifaied if it can be defined uniquily, in a certain precise sense, in terms of a finite number of conditional equations by allowing functions that are not in the language of the algebra. We provide full solutions of the problems, explain basic ideas, and dependenicies between blocks of proofs used in our solution.
© 2002-2003 Kurt Gödel Society, Norbert Preining. 2003-06-04 Valid HTML 4.01! Valid CSS! Debian