A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
This paper aims to show that, in order to capture a quite relevant feature such as the recursiveness of abstract data types, Model Theory works better than Category Theory. First, various eategorial notions such as "initiality", "finality", "monoinitiality", "epifinality", "weak monoinitiality" and "weak epifinality' are analyzed, from a model theoretic point of view, as regards the "abstractness" and the "cardinality" of the models they determine. In parti-cular~ countability is seen as adoi:10.1007/3-540-09981-6_4 fatcat:vqke4bgb7bbkhltzioe4utian4