A systematic study of models of abstract data types (Q801667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallel realization of systems, using factorizations and quotients in categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4176939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3322163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3662598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial abstract types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming in a wide spectrum language: A collection of examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction mechanisms in CLU / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebraic specification of abstract data types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sentences which are true of direct unions of algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract models of typed \(\lambda\)-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5637893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract data types and algebraic semantics of programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order identities as a defining language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Final algebra semantics and data type extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hierarchies of abstract data types / rank
 
Normal rank

Latest revision as of 16:11, 14 June 2024

scientific article
Language Label Description Also known as
English
A systematic study of models of abstract data types
scientific article

    Statements

    A systematic study of models of abstract data types (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    The term-generated models of an abstract data type can be represented by congruence relations on the term algebra. Total and partial heterogeneous algebras are considered as models of hierarchical abstract data types. Particular classes of models are studied and it is investigated under which conditions they form a complete lattice. This theory allows also to describe programming languages (and their semantic models) by abstract types. As example we present a simple deterministic stream processing language.
    0 references
    0 references
    abstract data type
    0 references
    Total and partial heterogeneous algebras
    0 references
    0 references
    0 references