Equational specification of partial higher-order algebras

Equational classes, universal algebra in model theory (03C05) Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Review text

The theory of algebraic abstract types specified by positive conditional formulas formed of equations and a definedness predicate is outlined and extended to hierarchical types with ``nonstrict operations, partial and even infinite objects. Its model theory is based on the concept of partial interpretations. Deduction rules are given, too. Models of types are studied where all explicit equations have solutions. The inclusion of higher-order types, i.e., types comprising higher-order functions leads to an algebraic (``equational) specification of algebras including sorts with ``infinite objects and higher-order functions (``functionals).

Recommendations

Cites work

Cited in

(16)

This page was built for publication: Equational specification of partial higher-order algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102736)