An Interpretability Approach to the Theory of Abstract Data Types1
1983; IOS Press; Volume: 6; Issue: 3-4 Linguagem: Inglês
10.3233/fi-1983-63-407
ISSN1875-8681
Autores Tópico(s)Logic, programming, and type systems
ResumoIn this paper, similarly to [1,4,17,20,21,29,30], abstract data types are understood as formalized many-sorted theories based on algorithmic languages (e.g. a language of algorithmic logic [2,16] or a language of dynamic logic [11,29]). Operations on data types, leading from (more) primitive types to compound types, are defined in terms of the interpretability theory (cf. Szczerba [25]). The approach proposed here to defining new types accords with the methods of introducing new classes of objects in programming languages like Simula 67, Pascal, Loglan, Ada.
Referência(s)