Structured algebraic specifications: A kernel language
From MaRDI portal
Publication:1080652
DOI10.1016/0304-3975(86)90051-4zbMath0599.68021OpenAlexW2030096232MaRDI QIDQ1080652
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90051-4
implementationdenotational semanticsASLcomputability questionsdeclarative higher-order languagemodel class semanticspresentation semantics
Related Items
Structured theory presentations and logic representations ⋮ An algebraic semantic framework for object oriented languages with concurrency. (Extended abstract) ⋮ A Proof Theoretic Interpretation of Model Theoretic Hiding ⋮ Compositionality results for different types of parameterization and parameter passing in specification languages ⋮ A general framework for modular implementations of modular system specifications ⋮ On observational equivalence and algebraic specification ⋮ Toward formal development of programs from algebraic specifications: Implementations revisited ⋮ Functorial theory of parameterized specifications in a general specification framework ⋮ Program specification and data refinement in type theory ⋮ Specifications in an arbitrary institution ⋮ Essential concepts of algebraic specification and program development ⋮ Detecting isomorphisms of modular specifications with diagrams ⋮ Proof systems for structured specifications with observability operators ⋮ The Distributed Ontology, Modeling and Specification Language – DOL ⋮ Observational implementation of algebraic specifications ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Modular structuring of VDM specifications in VVSL ⋮ Unnamed Item ⋮ Amalgamation in the semantics of CASL ⋮ Toward formal development of programs from algebraic specifications: Model-theoretic foundations ⋮ Unnamed Item ⋮ A Homage to Martin Wirsing ⋮ Localized Operational Termination in General Logics ⋮ The Foundational Legacy of ASL ⋮ Rule-Based Modeling and Static Analysis of Self-adaptive Systems by Graph Transformation ⋮ OBSCURE, a specification language for abstract data types ⋮ Toward formal development of programs from algebraic specifications: Parameterisation revisited
Uses Software
Cites Work
- 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
- 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
- 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
- Algebraic and operational semantics of specifications allowing exceptions and errors
- On hierarchies of abstract data types
- Algebraic implementations preserve program correctness
- Ein Wohlordnungsbeweis für das Ordinalzahlensystem T(J). (A proof of the wellordering of the ordinal number system T(J))
- Final algebra semantics and data type extensions
- The lambda calculus, its syntax and semantics
- Programming in a wide spectrum language: A collection of examples
- Algebraic implementation of abstract data types
- Partial abstract types
- LCF considered as a programming language
- Fully abstract models of typed \(\lambda\)-calculi
- Power domains
- Edinburgh LCF. A mechanized logic of computation
- Completeness of Proof Systems for Equational Specifications
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
- Data Type Specification: Parameterization and the Power of Specification Techniques
- Final Data Types and Their Specification
- A Powerdomain Construction
- Initial Algebra Semantics and Continuous Algebras
- Can programming be liberated from the von Neumann style?
- Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
- Heterogeneous algebras
- A complete first-order logic with infinitary predicates
This page was built for publication: Structured algebraic specifications: A kernel language