CAAP '81: Trees in Algebra and Programming /6th Colloquium, Genoa, March 5-7, 19
67,36 €
A modal characterisation of observable machine-behaviour. - Trees as data and file structures. - Infinitary relations. - Full approximability of a class of problems over power sets. - Abstract data types and rewriting systems : Application to the programming of Algebraic Abstract Data Types in PROLOG.
Jetzt bei Ebay:
