Another look at parameterization for oder-sorted algebraic specifications
From MaRDI portal
Publication:1342863
DOI10.1016/S0022-0000(05)80074-1zbMATH Open0938.68721MaRDI QIDQ1342863FDOQ1342863
Publication date: 21 June 2000
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
- Title not available (Why is that?)
- Computational aspects of an order-sorted logic with term declarations
- Title not available (Why is that?)
- Data Type Specification: Parameterization and the Power of Specification Techniques
- Algebraic specification of modules and their basic interconnections
- Pushout-Properties: An analysis of gluing constructions for graphs
- On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
- Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
- Title not available (Why is that?)
- Parametrization for order-sorted algebraic specification
- Parameterized Programming
- The equational theory of parameterized specifications
Cited In (1)
This page was built for publication: Another look at parameterization for oder-sorted algebraic specifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342863)