Behavioural satisfaction and equivalence in concrete model categories

DOI10.1007/3-540-61064-2_41OpenAlexW1554424044MaRDI QIDQ5878913

Michel Bidoit, Andrzej Tarlecki

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_41

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Categories of algebras (08C05)

Related Items

Behavioural theories and the proof of behavioural properties, From static to dynamic abstract data-types: An institution transformation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On observational equivalence and algebraic specification
• Quasi-varieties in abstract algebraic institutions
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• Proof of correctness of data representations
• Proving the correctness of behavioural implementations
• On behavioural abstraction and behavioural satisfaction in higher-order logic
• Toward formal development of programs from algebraic specifications: Model-theoretic foundations