kahn g b macqueen d b plotkin (5 Ergebnisse)

Paperback. Zustand: Very Good. Berling, Heidelberg, New York, Tokyo: Springer-Verlag, 1984. 391 pp. 24 x 16.5 cm. Silver and burgundy textured paper wraps. Light soiling and bumping to front cover; light wrinkling at head of spine. Sticker ghost to title page, light age toning to interior pages; interior otherwise clean and unmarked. Binding firm. Soft Cover. Very Good.

Taschenbuch. Zustand: Neu. Neuware -A kernel language for abstract data types and modules.- A semantics of multiple inheritance.- Understanding Russell a first attempt.- A basic Abstract Semantic Algebra.- Using information systems to solve reoursive domain equations effectively.- The semantics of second order polymorphic lambda calculus.- Polymorphism is not set-theoretic.- A theory of data type representation independence.- Abstract data types and their extensions within a constructive logic.- Deriving structural induction in LCF.- Executable specification of static semantics.- Cartesian closed categories of enumerations for effective type structures.- Type inference and type containment.- F-semantics for intersection type discipline.- The typechecking of programs with implicit type structure.- Partial implementations of abstract data types: A dissenting view on errors.- Building specifications in an arbitrary institution.- A proof system for verifying composability of abstract implementations.- Towards a proof theory of parameterized specifications.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 404 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - A kernel language for abstract data types and modules.- A semantics of multiple inheritance.- Understanding Russell a first attempt.- A basic Abstract Semantic Algebra.- Using information systems to solve reoursive domain equations effectively.- The semantics of second order polymorphic lambda calculus.- Polymorphism is not set-theoretic.- A theory of data type representation independence.- Abstract data types and their extensions within a constructive logic.- Deriving structural induction in LCF.- Executable specification of static semantics.- Cartesian closed categories of enumerations for effective type structures.- Type inference and type containment.- F-semantics for intersection type discipline.- The typechecking of programs with implicit type structure.- Partial implementations of abstract data types: A dissenting view on errors.- Building specifications in an arbitrary institution.- A proof system for verifying composability of abstract implementations.- Towards a proof theory of parameterized specifications.

Zustand: Good. Springer-Verlag, 1984. This Book is in Good Condition. Light wear to covers and edges, light erasures on Title page, text is clean with no marks, binding tight. Not Ex- Library or Remaindered. 100% Guaranteed. paperback. Good.

Zustand: New. In.