scientific article
From MaRDI portal
Publication:3666260
zbMath0517.68043MaRDI QIDQ3666260
Donald Sannella, Martin Wirsing
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
semanticsimplementationparameterisationabstract data typekernel specification languagespecification of data types and programs
Related Items
Structured theory presentations and logic representations, Lax Theory Morphisms, Structured algebraic specifications: A kernel language, Building a Modal Interface Theory for Concurrency and Data, A Proof Theoretic Interpretation of Model Theoretic Hiding, Compositionality results for different types of parameterization and parameter passing in specification languages, Structured theories and institutions, On the implementation of abstract data types by programming language constructs, On observational equivalence and algebraic specification, Toward formal development of programs from algebraic specifications: Implementations revisited, A characterization of passing compatibility for parameterized specifications, Proof systems for structured algebraic specifications: An overview, Specifications in an arbitrary institution, Morphism axioms, Correctness proofs for abstract implementations, Essential concepts of algebraic specification and program development, Proving correctness w.r.t. specifications with hidden parts, A scalable module system, Relations as abstract datatypes: An institution to specify relations between algebras, Structuring and modularizing algebraic specifications: the PLUSS specification language, evolutions and perspectives, Proof systems for structured specifications with observability operators, Structuring theories with implicit morphisms, Morphism equality in theory graphs, Representing model theory in a type-theoretical logical framework, Unnamed Item, Unnamed Item, Observational interpretations of hybrid dynamic logic with binders and silent transitions, Behavioural theories and the proof of behavioural properties, On behavioural abstraction and behavioural satisfaction in higher-order logic, Structure-preserving diagram operators, Observational specifications and the indistinguishability assumption, Parchments for CafeOBJ Logics, Unnamed Item, Representing Model Theory in a Type-Theoretical Logical Framework, Behavioural and abstractor specifications revisited, CoFI with Don Sannella, Toward formal development of programs from algebraic specifications: Model-theoretic foundations, Modular specification of process algebras, On behavioural abstraction and behavioural satisfaction in higher-order logic, Unnamed Item, A set-theoretic semantics for Clear, A Homage to Martin Wirsing, The Foundational Legacy of ASL, Non-deterministic data types: Models and implementations, CASL: the Common Algebraic Specification Language., Contextual rewriting as a sound and complete proof method for conditional LOG-specifications, Toward formal development of programs from algebraic specifications: Parameterisation revisited
