Name
Abstract | ||
|---|---|---|
Although every computable data type has an initial algebra specification with hidden functions, it may happen that some of the homomorphic images of the data type are not models of the specification. The latter are reducts of algebras that would be models of the specification if all its functions were visible, whereas the homomorphic images of the data type are independent of the specification and need not be compatible with the hidden functions used in it. A hidden function specification that does not exclude any of the homomorphic images of its initial model from its model class will be called homomorphism preserving. It turns out that, unlike unrestricted initial homomorphism preserving. It turns out that, unlike unrestricted initial algebra specification, homomorphism preserving initial algebra specification of computable data types requires both hidden sorts and hidden functions. (C) 1995 Academic Press, Inc. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1006/inco.1995.1079 | Information and Computation/information and Control |
Keywords | Field | DocType |
algebraic specification,data type | Initial algebra,Homomorphic encryption,Discrete mathematics,Combinatorics,Algebraic number,Algebra,Data type,Homomorphism,Mathematics | Journal |
Volume | Issue | ISSN |
119 | 1 | 0890-5401 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jan A. Bergstra | 1 | 1445 | 140.42 |
| J. Heering | 2 | 441 | 36.70 |