On algebraic specifications of computable algebras with the discriminator technique
Gagliardi, G. ; Tulipani, S.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990), p. 429-440 / Harvested from Numdam
Publié le : 1990-01-01
@article{ITA_1990__24_5_429_0,
     author = {Gagliardi, G. and Tulipani, S.},
     title = {On algebraic specifications of computable algebras with the discriminator technique},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {24},
     year = {1990},
     pages = {429-440},
     mrnumber = {1080499},
     zbl = {0732.68073},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1990__24_5_429_0}
}
Gagliardi, G.; Tulipani, S. On algebraic specifications of computable algebras with the discriminator technique. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) pp. 429-440. http://gdmltest.u-ga.fr/item/ITA_1990__24_5_429_0/

1. K. A. Baker, Finite equational bases for finite, algebras in a congruence-distributive equational class, Adv. in Math., 1977, 24, p. p 207-243. | MR 447074 | Zbl 0356.08006

2. J. A. Bergstra and J. V. Tucker, Algebraic specification of computable and semicomputable data structures, Dept. of Computer Science Research Report IW 115, Amsterdam, 1979. | Zbl 0419.68029

3. J. A. Bergstra and J. V. Tucker, On bounds for tbe specification of finite data types by means of equations and conditional equations, Centre for Math. and Computer Science Report IW 131, Amsterdam, 1980. | Zbl 0421.68020

4. J. A. Bergstra and J. V. Tucker, The completeness of algebraic specification methods for computable data types, Information and Control, 1982, 54, pp. 186-200. | MR 719442 | Zbl 0513.68017

5. J. A. Bergstra and J. V. Tucker, Initial and final algebra semantics for data type specifications; two characterization theorems, SIAM J. on Computing, 1983, 12, pp. 366-387. | MR 697167 | Zbl 0515.68016

6. J. A. Bergstra and J. V. Tucker, Algebraic specifications of computable and semicomputable data types, Theoretical Computer Science, 1987, 50, pp. 137-181. | MR 907280 | Zbl 0637.68013

7. S. Bloom and R. Tindel, Varieties of "if-then-else", SIAM J. on Computing, 1983, 12, pp. 677-707. | MR 721007 | Zbl 0518.68010

8. S. Burris and H. F. Sankappanavar, A course in Universal Algebra, Springer-Verlag, 1981. | MR 648287 | Zbl 0478.08001

9. M. Davis, Y. Matijasevic and J. Robinson, Hilbert's tenth Problem. Diophantine equations: positive aspect of a negative solution, Proceed. of Symposia in Pure Math., 1976, 28, pp. 323-378. | MR 432534 | Zbl 0346.02026

10. H. Ehrig and B. Mahr, Fundamentals of Algebraic Specification 1, Monograph EATCS, Springer-Verlag, 1985. | MR 788495 | Zbl 0557.68013

11. I. Guessarian and J. Meseguer, On the axiomatization of "if-then-else", SIAM J. on Computing, 1987, 16, pp. 332-357. | MR 882535 | Zbl 0628.68032

12. J. Heering, Partial evaluation and ω-completeness of algebraic specifications, Theoretical Computer Science, 1986, 43, pp 149-167. | MR 855969 | Zbl 0606.68017

13. R. Lyndon, Identities in finite algebras, Proc. Amer. Math. Soc, 1954, 5. pp..8-9. | MR 60482 | Zbl 0055.02705

14. A. I. Mal'Cev, Constructive algebras I, Russian Mathematicaï Surveys, 1961, 16, pp. 77-129. | MR 151377

15. R. Mckenzie, On spectra and the negative solution of the decision problem for identites having a finite non-trivial model, J. Symb. Logic, 1975, 40, pp. 186-196. | MR 376323 | Zbl 0316.02052

16. A. H. Mekler and E. M. Nelson, Equational Bases for "if then-else", SIAM J. on Computing, 1987, 16, pp. 465-485. | MR 889403 | Zbl 0654.68029