Titlebook: CAAP ‘81; Trees in Algebra and Egidio Astesiano,Corrado B?hm Conference proceedings 1981 Springer-Verlag Berlin Heidelberg 1981 Algebra.Bau

得罪人

Cpap155

A class of tree-like UNION-FIND data structures and the nonlinearity,This paper defines a class of tree-like data structures for the UNION-FIND problem. A structure from this class is injectable in another if each tree in the latter one can be obtained as a result of some program in the former as well. By means of injection of structures the nonlinearity in this class is proved.

anthesis

使入迷

Algebraic theory of parameterized specifications with requirements,eloped for the basic algebraic approach can be fully extended to the case with requirements. The basic result is an extension lemma which allows to show correctness of parameter passing and associativity of nested parameterized specifications like . (. (.)). Correctness of such composite specificati

動脈

Trees as data and file structures,us refinements and generalizations of the old programming trick called hashing have caused an unexpected extension of the domain of applicability of address computation techniques to dynamic files and multi-key access..This paper surveys the history of data structures used for tables, files or recor

木訥

沐浴

竊喜

A modal characterisation of observable machine-behaviour,

拾落穗

配偶

How to compute generators for the intersection of subgroups in free groups,