Elsevier

Theoretical Computer Science

Volume 67, Issue 1, 5 September 1989, Pages 87-97
Theoretical Computer Science

On a conjecture of Bergstra and Tucker

https://doi.org/10.1016/0304-3975(89)90024-8Get rights and content
Under an Elsevier user license
open archive

Abstract

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 case in which the conjecture has a positive answer.

Cited by (0)

Work performed under the auspices of the Italian MPI and CNR.