Publication:1169290

DOI10.1007/BF00625280zbMATH Open0494.68020MaRDI QIDQ1169290FDOQ1169290

Manfred Broy, Martin Wirsing

Publication date: 1982

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

zbMATH Keywords

programming languagesfully abstract semanticsalgebraic specificationconditional equational formulashierarchical abstract types

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Fully abstract models of typed \(\lambda\)-calculi
• Final algebra semantics and data type extensions
• On hierarchies of abstract data types
• A systematic study of models of abstract data types
• Transformational semantics for concurrent programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (38)

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

This page was built for publication: Partial abstract types

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