Partial abstract types

DOI10.1007/BF00625280zbMath0494.68020MaRDI QIDQ1169290

Manfred Broy, Martin Wirsing

Publication date: 1982

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

programming languagesalgebraic specificationfully abstract semanticsconditional equational formulashierarchical abstract types

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (38)

Structured algebraic specifications: A kernel language ⋮ On the existence of free models in abstract algebraic institutions ⋮ A technique for specifying and refining TCSP processes by using guards and liveness conditions ⋮ Exception handling and term labelling ⋮ Minimal coverings for incompletely specified sequential machines ⋮ Specification and top-down design of distributed systems ⋮ On observational equivalence and algebraic specification ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ Semantics of finite and infinite networks of concurrent communicating agents ⋮ Quasi-varieties in abstract algebraic institutions ⋮ Algebraic specifications of computable and semicomputable data types ⋮ On flowchart theories. II: The nondeterministic case ⋮ Equational specification of partial higher-order algebras ⋮ Specification and verification challenges for sequential object-oriented programs ⋮ Specifications in an arbitrary institution ⋮ Partial arithmetical data types of rational numbers and their equational specification ⋮ A new approach to abstract data types, I Informal development ⋮ A decade of TAPSOFT ⋮ Testing can be formal, too ⋮ Specification of abstract dynamic-data types: A temporal logic approach ⋮ Equivalence and difference between institutions: simulating Horn Clause Logic with based algebras ⋮ A first order logic for partial functions ⋮ Non-strict don't care algebras and specifications ⋮ Unnamed Item ⋮ Data types with errors and exceptions ⋮ A theory for program and data type specification ⋮ A first order logic for partial functions ⋮ Equational type logic ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Swinging types=functions+relations+transition systems ⋮ A logic covering undefinedness in program proofs ⋮ A set-theoretic semantics for Clear ⋮ A Homage to Martin Wirsing ⋮ Non-deterministic data types: Models and implementations ⋮ On the Herbrand-Kleene universe for nondeterministic computations ⋮ Acceptable functional programming systems ⋮ A systematic study of models of abstract data types

Cites Work

• A systematic study of models of abstract data types
• On hierarchies of abstract data types
• Final algebra semantics and data type extensions
• Transformational semantics for concurrent programs
• Fully abstract models of typed \(\lambda\)-calculi
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Partial abstract types