scientific article

zbMath0462.68001MaRDI QIDQ3912001

Jan A. Bergstra, Manfred Broy, J. V. Tucker, Martin Wirsing

Publication date: 1981

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

zbMATH Keywords

computable partial algebrahierarchical partial algebrasnondeterministic programming languagepartial abstract types

Mathematics Subject Classification ID

Data structures (68P05) General topics in the theory of software (68N01)

Related Items (16)

Refutational theorem proving for hierarchic first-order theories ⋮ Structured algebraic specifications: A kernel language ⋮ Crypt-equivalent algebraic specifications ⋮ Algebraic specifications of computable and semicomputable data types ⋮ Simplifying conditional term rewriting systems: Unification, termination and confluence ⋮ Specifications in an arbitrary institution ⋮ Partial arithmetical data types of rational numbers and their equational specification ⋮ Proving correctness w.r.t. specifications with hidden parts ⋮ Partial abstract types ⋮ A functorial framework for constraint normal logic programming ⋮ Interface theories for concurrency and data ⋮ Complexity analysis of term-rewriting systems ⋮ Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras ⋮ Division by Zero in Common Meadows ⋮ A constructive method for abstract algebraic software specification ⋮ A systematic study of models of abstract data types

This page was built for publication: