Titlebook: GI — 11. Jahrestagung; In Verbindung mit Th Wilfried Brauer Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1981 Algorithmen.

固定某物

雪上轻舟飞过

Celiac-Plexus

https://doi.org/10.1007/978-3-322-95371-1ograms computing on abstractly specified data types have been studied. At least two different types of theories have emerged. Approaches of the first type view programming language ., such as assignment or if-then-else, as operators of algebras that contain as a sub-algebra the data types on which t

骚动

https://doi.org/10.1007/978-3-662-32646-6tions over arbitrary data structures. Nonuniform models are represented by “term definitions” which describe functions by families of terms. We find the term definition inside a program, called calculation function, and show that exactly the recursive functions have recursive term definitions which

辞职

跳脱衣舞的人

https://doi.org/10.1007/978-3-663-07347-5 META IV vorliegen, wird eine geneinsame, maschinenunabhängige Zwischensprache für die Übersetzung dieser Sprachen hergeleitet. In dieser Sprache werden die Programme als abstrakte Syntaxbäume dargestellt. Aus den Semantikbeschreibungen ergibt sich auch eine formale Spezifikation für die Übersetzung

chalice

旅行路线

Über die Erziehung gesunder Kinderishable in all program logics HL(Σ’,E) for Σ’ .; Σ. A . is that for each refinement (Σ’,E’) of (Σ,E) another refinement (Σ*,E*) of (Σ’ ,E’) exists such that S. and S. cannot be distinguished in HL(Σ*,E*).

appall

left-ventricle

https://doi.org/10.1007/978-3-662-31525-5proved to be a powerful and flexible tool for the formal definition of data structures. Algebraic concepts have also been employed for the specification of programming language semantics, e.g. first-order identities (/Wand 77/) or continuous algebras (/Courcelle, Nivat 78/, /Goguen et al. 77/). In c