Small specifications for large finite data structures

References

• Bergstra , J.A. and Ch Meyer , J.J. 1980 . On bounds for the specification of finite minimal monoids by means of equations using only unary hidden functions , Leiden : University of Leiden . Institute of Applied Mathematics and Computer Science, Report 80-11
   Google Scholar
• Bergstra , J.A. and Tucker , J.V. 1980 . Equational specifications for computable data types: six hidden functions suffice and other sufficiency bounds , Amsterdam : Mathematical Centre . Department of Computer Science Research Report IW 128
   Google Scholar
• Bergstra , J.A. and Tucker , J.V. 1980 . On bounds for the specification of finite data types by means of equations and conditional equations, Mathematical Centre Amsterdam Department of Computer Science Research Report IW 131
   Google Scholar
• Goguen , J.A. , Thatcher , J.W. and Wagner , E.G. 1978 . “ An initial algebra approach to the specification, correctness and implementation of abstract data types ” . In Current trends in programming methodology IV, Data structuring , Edited by: Yeh , R.T. 80 – 149 . Englewood Cliffs, New Jersey : Prentice-Hall .
   Google Scholar
• Manin , Y. 1977 . A course in mathematical logic , New York : Springer-Verlag .
   Google Scholar
• Thatcher , J.W. , Wagner , E.W. and Wright , J.B. 1976 . Specification of abstract data types using conditional axioms , Yorktown Heights : IBM—T . J. Watson Research Center Report R06214
   Google Scholar
• Thatcher , J.W. , Wagner , E.G. and Wright , J.B. 1978 . Data type specification; parameterization and the power of specification techniques . J. Watson Research Center Report RC-7757 Yorktown Heights (1979). (Revision of paper with same title in Proceedings, SIGACT 10th Annual Symposium on Theory of Computing, ACM . 1978 . pp. 119 – 132 . IBM—T .
   Google Scholar