On the public citation graph

On the algebraic specification of infinite objects — ordered and continuous models of algebraic types

https://doi.org/10.1007/bf00267044
0 signed · 66 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-15187-7openalex-snapshot
The Munich Project CIP
inferredcites →https://doi.org/10.1007/978-3-642-61807-9openalex-snapshot
Algorithmic Language and Program Development
inferredcites →https://doi.org/10.1007/978-3-642-68064-9_2openalex-snapshot
Developing Algebraic Specifications of Threaded Data Structure Implementations
inferredcites →https://doi.org/10.1007/978-3-642-69298-7_7openalex-snapshot
An Algebraic Semantics for Backus’ Functional Programming Language with Infinite Objects
inferredcites →https://doi.org/10.1007/978-3-662-09691-8_14openalex-snapshot
On the Algebraic Specification of Domains
inferredcites →https://doi.org/10.1007/978-3-662-21545-6openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/978-94-009-8881-1_5openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1007/bf00264293openalex-snapshot
On hierarchies of abstract data types
inferredcites →https://doi.org/10.1007/bf01894874openalex-snapshot
Completions of partially ordered sets and universal algebras
inferredcites →https://doi.org/10.1007/bfb0014675openalex-snapshot
Detailization and lazy evaluation, infinite objects and pointer representation
inferredcites →https://doi.org/10.1007/bfb0028827openalex-snapshot
Continuous abstract data types: Basic machinery and results
inferredcites →https://doi.org/10.1007/bfb0030301openalex-snapshot
On the Herbrand Kleene universe for nondeterministic computations
inferredcites →https://doi.org/10.1007/bfb0036933openalex-snapshot
An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language
inferredcites →https://doi.org/10.1007/bfb0059703openalex-snapshot
The lattice of flow diagrams
inferredcites →https://doi.org/10.1016/0022-0000(79)90011-4openalex-snapshot
Final algebra semantics and data type extensions
inferredcites →https://doi.org/10.1016/0304-3975(78)90040-3openalex-snapshot
A uniform approach to inductive posets and inductive closure
inferredcites →https://doi.org/10.1016/0304-3975(83)90098-1openalex-snapshot
Algebraic domain equations
inferredcites →https://doi.org/10.1016/s0021-9800(70)80014-xopenalex-snapshot
Heterogeneous algebras
inferredcites →https://doi.org/10.1016/s0022-0000(74)80048-6openalex-snapshot
Correct and optimal implementations of recursion in a simple programming language
inferredcites →https://doi.org/10.1109/sfcs.1975.7openalex-snapshot
Bases for chain-complete posets
inferredcites →https://doi.org/10.1109/sfcs.1976.3openalex-snapshot
Algebraic families of interpretations
inferredcites →https://doi.org/10.1137/0205035openalex-snapshot
A Powerdomain Construction
inferredcites →https://doi.org/10.1137/0211016openalex-snapshot
Continuous Data Types
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/359576.359579openalex-snapshot
Can programming be liberated from the von Neumann style?
inferredcites →https://doi.org/10.1145/367177.367199openalex-snapshot
Recursive functions of symbolic expressions and their computation by machine, Part I
inferredcites →https://doi.org/10.1145/800055.802045openalex-snapshot
Busy and lazy FP with infinite objects
inferredcites →https://doi.org/10.1145/800168.811543openalex-snapshot
A lazy evaluator

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10704567_9openalex-snapshot
Functional Plus Logic Programming with Built-In and Symbolic Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_5openalex-snapshot
Functional and Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_2openalex-snapshot
Algebraic data type and process specifications based on projection spaces
inferred← citeshttps://doi.org/10.1007/3-540-56379-2_35openalex-snapshot
The use of sorts in algebraic specifications
inferred← citeshttps://doi.org/10.1007/3-540-56733-x_168openalex-snapshot
Annotated bibliography of the PROSPECTRA project
inferred← citeshttps://doi.org/10.1007/3-540-57867-6_8openalex-snapshot
Semantic constructions in the specification language Glider
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_11openalex-snapshot
Ordered and continuous models of higher-order specifications
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_35openalex-snapshot
A rewriting logic for declarative programming
inferred← citeshttps://doi.org/10.1007/3-540-61629-2_56openalex-snapshot
Swinging data types
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_20openalex-snapshot
Algebraic semantics for functional logic programming with polymorphic order-sorted types
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_3openalex-snapshot
Abstract Interpretation Based Semantics of Sequent Calculi
inferred← citeshttps://doi.org/10.1007/978-3-662-09691-8_14openalex-snapshot
On the Algebraic Specification of Domains
inferred← citeshttps://doi.org/10.1007/bfb0028827openalex-snapshot
Continuous abstract data types: Basic machinery and results
inferred← citeshttps://doi.org/10.1007/bfb0028999openalex-snapshot
Algebraic specifications for domain theory
inferred← citeshttps://doi.org/10.1007/bfb0030618openalex-snapshot
A semantic framework for functional logic programming with algebraic polymorphic types
inferred← citeshttps://doi.org/10.1007/bfb0035765openalex-snapshot
Infinite normal forms
inferred← citeshttps://doi.org/10.1007/bfb0035766openalex-snapshot
On recent trends in algebraic specification
inferred← citeshttps://doi.org/10.1007/s10990-007-9002-4openalex-snapshot
A new generic scheme for functional logic programming with constraints
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90049-nopenalex-snapshot
Combining data type and recursive process specifications using projection algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90040-9openalex-snapshot
Rewrite, rewrite, rewrite, rewrite, rewrite, …
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90051-3openalex-snapshot
Non-well-founded sets modeled as ideal fixed points
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50018-4openalex-snapshot
Algebraic Specification
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.030openalex-snapshot
Constraint Functional Logic Programming Revisited
inferred← citeshttps://doi.org/10.1016/j.jlap.2003.10.001openalex-snapshot
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10029-8openalex-snapshot
An approach to declarative programming based on a rewriting logic
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80349-9openalex-snapshot
A Declarative Debugging System for Lazy Functional Logic Programs
inferred← citeshttps://doi.org/10.1017/s0960129500001432openalex-snapshot
A new approach to abstract data types, I Informal development
inferred← citeshttps://doi.org/10.1017/s1471068402001527openalex-snapshot
Composing programs in a rewriting logic for declarative programming
inferred← citeshttps://doi.org/10.1080/00207169308804171openalex-snapshot
A second order theory of infinite trees
inferred← citeshttps://doi.org/10.1109/32.21743openalex-snapshot
Formal program construction by transformations-computer-aided, intuition-guided programming
inferred← citeshttps://doi.org/10.1109/lics.1989.39181openalex-snapshot
Non-well-founded sets obtained from ideal fixed points
inferred← citeshttps://doi.org/10.1145/1599410.1599418openalex-snapshot
A higher-order logical framework for the algorithmic debugging and verification of declarative programs
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.1145/75277.75299openalex-snapshot
Rewrite, rewrite, rewrite, rewrite, rewrite...
inferred← citeshttps://doi.org/10.1145/9758.10501openalex-snapshot
On the algebraic definition of programming languages
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0404050openalex-snapshot
A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types
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.