no. 5
On algebraic specifications of computable algebras with the discriminator technique
RAIRO. Informatique théorique et applications, Tome 24 (1990) no. 5, pp. 429-440 
@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. Informatique th\'eorique et applications},
     pages = {429--440},
     year = {1990},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {5},
     mrnumber = {1080499},
     zbl = {0732.68073},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1990__24_5_429_0/}
}
TY  - JOUR
AU  - Gagliardi, G.
AU  - Tulipani, S.
TI  - On algebraic specifications of computable algebras with the discriminator technique
JO  - RAIRO. Informatique théorique et applications
PY  - 1990
SP  - 429
EP  - 440
VL  - 24
IS  - 5
PB  - EDP-Sciences
UR  - https://www.numdam.org/item/ITA_1990__24_5_429_0/
LA  - en
ID  - ITA_1990__24_5_429_0
ER  - 
%0 Journal Article
%A Gagliardi, G.
%A Tulipani, S.
%T On algebraic specifications of computable algebras with the discriminator technique
%J RAIRO. Informatique théorique et applications
%D 1990
%P 429-440
%V 24
%N 5
%I EDP-Sciences
%U https://www.numdam.org/item/ITA_1990__24_5_429_0/
%G en
%F ITA_1990__24_5_429_0
Gagliardi, G.; Tulipani, S. On algebraic specifications of computable algebras with the discriminator technique. RAIRO. Informatique théorique et applications, Tome 24 (1990) no. 5, pp. 429-440. https://www.numdam.org/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. | Zbl | MR

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

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

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. | Zbl | MR

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. | Zbl | MR

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

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

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

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. | Zbl | MR

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

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

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

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

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

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. | Zbl | MR

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