Computable algebras, word problems and canonical term algebras

1. J.A. Bergstra, J.V. Tucker Algebraic specifications of computable and semicomputable data structures Math. Centrum Report IW 115/1979

   Google Scholar 

2. J.A. Bergstra, J.V. Tucker On the adequacy of finite equational methods for data type specification SIGPLAN Notices 14 (1979), No. 11, 13–18

   Google Scholar 

3. J.A. Bergstra, J.V. Tucker Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds Math. Centrum Report IW 128/80, 1980

   Google Scholar 

4. J.A. Goguen, J.W. Thatcher, J.B. Wright An initial algebra approach to the specification, correctness, and implementation of abstract data types Current Trends in Programming Methodology IV: Data Structuring, R. Yeh (ed.), Prentice Hall 1978, 80–144

   Google Scholar 

5. G. Huet, D.C. Oppen Equations and rewrite rules: a survey Formal languages: Perspectives and Open Problems, R. Book (ed), Academic Press, 1980

   Google Scholar 

6. M. Schulz Berechenbare Algebren, Wortprobleme und kanonische Term-Algebren Diplomarbeit, Aachen 1981

   Google Scholar 

7. J.W. Thatcher, E.G. Wagner, J.B. Wright Data type specification: parameterization and the power of specification techniques Proc. 10th Symposium Theory of Computing (1978), 119–132

   Google Scholar 

Download references