Initial computability, algebraic specifications, and partial algebras
著者
書誌事項
Initial computability, algebraic specifications, and partial algebras
（The International series of monographs on computer science, 2）
Clarendon Press, 1987
大学図書館所蔵 件 / 全19件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. [214]-217
Includes index
内容説明・目次
内容説明
The aim of this book is to increase the use of partial algebras, especially in computer science. It sets out to achieve this by presenting examples of increasing complexity of algebraic specifications using essentially partial operations, and by proving that structural induction alone yields on equationally partial algebras a complete calculus of abstract programs on parametrized abstract data types. It develops a special kind of partiality - the equational partiality - both as a sound formal basis for algebraic specifications with partial operations, and as a proper generalization of universal algebra from total algebras to partial ones. The book extends the modeltheoretic initial semantics of abstract data types with partial operations to behavioural semantics. Postgraduate and third year mathematicians (algebraists particularly) and computer scientists (courses on 'Formal Models in Programming').
目次
- Introduction
- Specification of abstract data types with partial operations
- Equational partiality
- Partial algebras defined by generators and relations
- Canons - initially restricting algebraic theories
- Canons of behaviour
- References
- Index.
「Nielsen BookData」 より
