scientific article

zbMath0634.68001MaRDI QIDQ3773301

Horst Reichel

Publication date: 1987

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algebraic specificationspartial algebrassemanticstructural inductionhep-quasi-varietiesparameterized abstract data typesbehavioural canonsequational partialityhep-varietiesinitial computability

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Partial algebras (08A55) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to general algebraic systems (08-01)

Related Items (28)

Conditional rewriting logic: Deduction, models and concurrency ⋮ Observational logic, constructor-based logic, and their duality. ⋮ Specifications in an arbitrary institution ⋮ Partial arithmetical data types of rational numbers and their equational specification ⋮ Proving the correctness of behavioural implementations ⋮ Proof systems for structured specifications with observability operators ⋮ Foundations for structuring behavioural specifications ⋮ Preservation in many-valued truth institutions ⋮ Coinduction for preordered algebra ⋮ A generalization of the concept of sketch ⋮ Universal algebras ⋮ Specification styles in distributed systems design and verification ⋮ Behavioural theories and the proof of behavioural properties ⋮ Conditional rewriting logic as a unified model of concurrency ⋮ Proving semantical equivalence of data specifications ⋮ Quasi-varieties: A special access ⋮ On an essentially algebraic theory for locally presentable categories ⋮ An encoding of partial algebras as total algebras ⋮ ESSENTIALLY ALGEBRAIC CATEGORIES OF PARTIAL ALGEBRAS ⋮ Integrating Maude into Hets ⋮ Equational type logic ⋮ On the algebraic structure of declarative programming languages ⋮ Van Kampen Colimits and Path Uniqueness ⋮ Relating CASL with other specification languages: the institution level. ⋮ Relaxed models for rewriting logic ⋮ CSP, partial automata, and coalgebras. ⋮ On institutions for modular coalgebraic specifications. ⋮ Fibred amalgamation, descent data, and Van Kampen squares in topoi

This page was built for publication: