On the behavioral equivalence between k-data structures
Throughout this paper we consider data structures as sorted algebras endowed with a designated subset of their visible part, which represents the set of truth values. The originality of our approach is the application of the standard abstract algebraic logic theory of deductive systems to the hidden...
| Autor principal: | |
|---|---|
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
1000
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10773/6931 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/6931 |