On the public citation graph

Parameter passing commutes with implementation of parameterized data types

https://doi.org/10.1007/bfb0012770
0 signed · 46 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-08860-1_16openalex-snapshot
Stepwise specification and implementation of abstract data types
inferredcites →https://doi.org/10.1007/3-540-09510-1_7openalex-snapshot
Existential quantifiers in abstract data types
inferredcites →https://doi.org/10.1007/3-540-10003-2_67openalex-snapshot
Algebraic implementation of abstract data types: concept, syntax, semantics and correctness
inferredcites →https://doi.org/10.1007/3-540-10003-2_68openalex-snapshot
Parameterized data types in algebraic specification languages
inferredcites →https://doi.org/10.1007/3-540-10828-9_51openalex-snapshot
Algebraic theory of parameterized specifications with requirements
inferredcites →https://doi.org/10.1007/3-540-11490-4_21openalex-snapshot
Parameter passing in algebraic specification languages
inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot
Categories for the Working Mathematician
inferredcites →https://doi.org/10.1007/978-3-662-01089-1_24openalex-snapshot
Methodology for the Specification of Software Systems: From Formal Requirements to Algebraic Design Specifications
inferredcites →https://doi.org/10.1007/bfb0012793openalex-snapshot
Implementation of parameterised specifications
inferredcites →https://doi.org/10.1007/bfb0022528openalex-snapshot
Initially — Restricting algebraic theories
inferredcites →https://doi.org/10.1016/0304-3975(83)90065-8openalex-snapshot
Parameter passing in algebraic specification languages
inferredcites →https://doi.org/10.1016/s0304-3975(82)80001-7openalex-snapshot
Algebraic implementation of abstract data types
inferredcites →https://doi.org/10.1145/322290.322303openalex-snapshot
On the Theory of Specification, Implementation, and Parametrization of Abstract Data Types
inferredcites →https://doi.org/10.1145/359605.359618openalex-snapshot
Abstract data types and the development of data structures
inferredcites →https://doi.org/10.1145/800133.804340openalex-snapshot
Data type specification
inferredcites →https://doi.org/10.1145/800237.807124openalex-snapshot
Abstract data types and the development of data structures

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-12689-9_116openalex-snapshot
Characterizing composability of abstract implementations
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_122openalex-snapshot
A kernel language for algebraic specification and implementation extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_39openalex-snapshot
Un systeme d'aide a la preuve de compilateurs
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_18openalex-snapshot
A proof system for verifying composability of abstract implementations
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_62openalex-snapshot
Logical specification and implementation
inferred← citeshttps://doi.org/10.1007/3-540-15199-0_14openalex-snapshot
A theory of abstract data types for program development: Bridging the gap?
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_50openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/3-540-18508-9_27openalex-snapshot
Viewing implementations as an institution
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_11openalex-snapshot
Semantics of First Order Parametric Specifications
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_124openalex-snapshot
A modular framework for specification and implementation
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_139openalex-snapshot
Implementation of parameterized observational specifications
inferred← citeshttps://doi.org/10.1007/3-540-54496-8_8openalex-snapshot
A notion of implementation for the specification language OBSCURE
inferred← citeshttps://doi.org/10.1007/978-3-642-69009-9_15openalex-snapshot
Bibliographie
inferred← citeshttps://doi.org/10.1007/978-3-642-69032-7_2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/bf00263649openalex-snapshot
Non-deterministic data types: models and implementations
inferred← citeshttps://doi.org/10.1007/bf00283329openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/bf01178505openalex-snapshot
Observational implementation of algebraic specifications
inferred← citeshttps://doi.org/10.1007/bf02737104openalex-snapshot
Toward formal development of programs from algebraic specifications: Implementations revisited
inferred← citeshttps://doi.org/10.1007/bfb0012793openalex-snapshot
Implementation of parameterised specifications
inferred← citeshttps://doi.org/10.1007/bfb0030330openalex-snapshot
Another look at parameterization using algebras with subsorts
inferred← citeshttps://doi.org/10.1007/bfb0036909openalex-snapshot
Algebraic specifications with generating constraints
inferred← citeshttps://doi.org/10.1007/bfb0039611openalex-snapshot
Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types?
inferred← citeshttps://doi.org/10.1016/0167-6423(83)90021-7openalex-snapshot
Increasing modularity and language-independency in automatically generated compilers
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90021-3openalex-snapshot
Report on the larch shared language
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90121-9openalex-snapshot
Compatibility of parameter passing and implementation of parameterized data types
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90051-4openalex-snapshot
Structured algebraic specifications: A Kernel language
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferred← citeshttps://doi.org/10.1093/comjnl/35.5.451openalex-snapshot
The Role of Data Reification in Program Refinement: Origins, Synthesis and Appraisal
inferred← citeshttps://doi.org/10.1145/2166.357212openalex-snapshot
Parameterized Specifications: Parameter Passing and Implementation with Respect to Observability
inferred← citeshttps://doi.org/10.1145/988193.988197openalex-snapshot
An algebraic specification of a Pascal compiler
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.