On a Conjecture of Bergstra and Tucker


Bergstra and Tucker (1983) conjectured that a semicomputable (abstract) data type has a finite hidden enrichment specification under its initial algebra semantics. In a previous paper (1987) we tried to solve the entire conjecture and we found a weak solution. Here, following the line and the proof techniques of the previous paper, we examine a nontrivial… (More)
DOI: 10.1016/0304-3975(89)90024-8


Cite this paper

@article{Marongiu1989OnAC, title={On a Conjecture of Bergstra and Tucker}, author={Gabriele Marongiu and Sauro Tulipani}, journal={Theor. Comput. Sci.}, year={1989}, volume={67}, pages={87-97} }