Skip to main content
Conference Proceedings

What is computable for abstract data types ?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1981) 117 LNCS 173-181
DOI: 10.1007/3-540-10854-8_18
6Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Kaphengst, H. (1981). What is computable for abstract data types ? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 117 LNCS, pp. 173–181). Springer Verlag. https://doi.org/10.1007/3-540-10854-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free