Do people consider the implementability of a (abstract) datastructure or a data type, just like people do forimplementability/computability of an algorithm? By implementability, I mean if a (abstract) datastructure/type can be implemented on a real computer or abstract computer model.Does the implementability of a (abstract) data structure/type depend on and only on the computability of each of its operations implemented as algorithms, and whether the space it requires to store each value is limited?Does the implementability of a (abstract) data structure/type depend on in whichprogramming language it is implemented?Does it matter if a programming language in which it is planned tobe implemented is a imperative or functional language? In otherwords, are the (abstract) data structures/types that can be implemented byan imperative programming language and the (abstract) datastructures/types that can be implemented by a functional languagesthe same?why some data structures are called functional data structures, and even there are some books for it (e.g. https://www.cs.cmu.edu/~rwh/theses/okasaki.pdf). Are functional data structures not implemented or introduced in imperative languages? Why  need to distinguish between (imperative?) data structures and functional data structures?
Implementability of a (abstract) data structure/type?
algorithms;data structures;programming languages