On the public citation graph

Algebraic specification of data types: A synthetic approach

0 signed · 146 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.1002/zamm.19780580217openalex-snapshot

Revised Report on the Algorithmic Language ALGOL 68, Ed. by A. van Wijngaarden, B. J. Mailloux, J. E. L. Peck, C. H. A. Koster, M. Sintzoff, C. H. Lindsey, L. G. L. T. Meertens, R. G. Fisker, Berlin‐Heidelberg‐New York. Springer‐Verlag. 1976. 236 S., DM 24,—. US $ 9.90

inferredcites →https://doi.org/10.1007/3-540-07142-3_61openalex-snapshot

A Categorist's view of automata and systems

inferredcites →https://doi.org/10.1007/3-540-07142-3_85openalex-snapshot

On the recursive specification of data types

inferredcites →https://doi.org/10.1007/3-540-08442-8_88openalex-snapshot

Free Dynamics and Algebraic Semantics

inferredcites →https://doi.org/10.1007/3-540-08442-8_96openalex-snapshot

On Order-Complete Universal Algebra and Enriched Functorial Semantics

inferredcites →https://doi.org/10.1007/978-1-4612-4118-8_2openalex-snapshot

Revised Report on the Algorithmic Language Algol 60

inferredcites →https://doi.org/10.1007/978-1-4612-9839-7openalex-snapshot

Categories for the Working Mathematician

inferredcites →https://doi.org/10.1007/bf00260922openalex-snapshot

The algebraic specification of abstract data types

inferredcites →https://doi.org/10.1007/bf00265077openalex-snapshot

Revised report on the algorithmic language ALGOL 68

inferredcites →https://doi.org/10.1007/bf00976239openalex-snapshot

Recursive data structures

inferredcites →https://doi.org/10.1007/bf01111838openalex-snapshot

Coequalizers and free triples

inferredcites →https://doi.org/10.1007/bfb0059703openalex-snapshot

The lattice of flow diagrams

inferredcites →https://doi.org/10.1007/bfb0073967openalex-snapshot

Continuous lattices

inferredcites →https://doi.org/10.1007/bfb0079432openalex-snapshot

Data types as lattices

inferredcites →https://doi.org/10.1016/0022-0000(78)90048-xopenalex-snapshot

Power domains

inferredcites →https://doi.org/10.1016/0304-3975(77)90045-7openalex-snapshot

Effectively given domains

inferredcites →https://doi.org/10.1016/0304-3975(79)90053-7openalex-snapshot

Fixed-point constructions in order-enriched categories

inferredcites →https://doi.org/10.1016/s0021-9800(70)80014-xopenalex-snapshot

Heterogeneous algebras

inferredcites →https://doi.org/10.1016/s0049-237x(08)72018-4openalex-snapshot

A Basis for a Mathematical Theory of Computation )

inferredcites →https://doi.org/10.1016/s0049-237x(08)x7102-2openalex-snapshot

Computer Programming and Formal Systems

inferredcites →https://doi.org/10.1016/s0049-237x(09)70099-0openalex-snapshot

A Basis for a Mathematical Theory of Computation

inferredcites →https://doi.org/10.1073/pnas.52.6.1506openalex-snapshot

AN ELEMENTARY THEORY OF THE CATEGORY OF SETS

inferredcites →https://doi.org/10.1109/sfcs.1976.3openalex-snapshot

Algebraic families of interpretations

inferredcites →https://doi.org/10.1109/sfcs.1976.9openalex-snapshot

Categories for fixpoint-semantics

inferredcites →https://doi.org/10.1109/sfcs.1977.10openalex-snapshot

Data types

inferredcites →https://doi.org/10.1109/sfcs.1977.30openalex-snapshot

The category-theoretic solution of recursive domain equations

inferredcites →https://doi.org/10.1137/0205035openalex-snapshot

A Powerdomain Construction

inferredcites →https://doi.org/10.1137/0205037openalex-snapshot

Data Types as Lattices

inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot

Initial Algebra Semantics and Continuous Algebras

inferredcites →https://doi.org/10.1145/359605.359618openalex-snapshot

Abstract data types and the development of data structures

inferredcites →https://doi.org/10.1145/512760.512773openalex-snapshot

A Metalanguage for interactive proof in LCF

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.1006/inco.1998.2725openalex-snapshot

Structural Induction and Coinduction in a Fibrational Setting

inferred← citeshttps://doi.org/10.1007/3-540-10003-2_102openalex-snapshot

Computability in categories

inferred← citeshttps://doi.org/10.1007/3-540-12727-5_2openalex-snapshot

Applicative information systems

inferred← citeshttps://doi.org/10.1007/3-540-13345-3_13openalex-snapshot

Domain algebras

inferred← citeshttps://doi.org/10.1007/3-540-13346-1_7openalex-snapshot

Polymorphism is not set-theoretic

inferred← citeshttps://doi.org/10.1007/3-540-16042-6_13openalex-snapshot

Recursively defined domains and their induction principles

inferred← citeshttps://doi.org/10.1007/3-540-16816-8_27openalex-snapshot

Comparing categories of domains

inferred← citeshttps://doi.org/10.1007/3-540-16816-8_32openalex-snapshot

Additive domains

inferred← citeshttps://doi.org/10.1007/3-540-17162-2_121openalex-snapshot

Category theory and programming language semantics: An overview

inferred← citeshttps://doi.org/10.1007/3-540-18508-9_24openalex-snapshot

A typed lambda calculus with categorical type constructors

inferred← citeshttps://doi.org/10.1007/3-540-19020-1_9openalex-snapshot

The metric closure powerspace construction

inferred← citeshttps://doi.org/10.1007/3-540-49253-4_29openalex-snapshot

Categorical Programming with Abstract Data Types

inferred← citeshttps://doi.org/10.1007/3-540-50728-0_35openalex-snapshot

On systems of equations defining infinite graphs

inferred← citeshttps://doi.org/10.1007/3-540-51498-8_5openalex-snapshot

The equational logic of iterative processes

inferred← citeshttps://doi.org/10.1007/3-540-56596-5_45openalex-snapshot

On the foundations of final semantics: Non-standard sets, metric spaces, partial orders

inferred← citeshttps://doi.org/10.1007/3-540-57264-3_42openalex-snapshot

Strictness properties of lazy algebraic datatypes

inferred← citeshttps://doi.org/10.1007/3-540-58027-1_4openalex-snapshot

A structural co-induction theorem

inferred← citeshttps://doi.org/10.1007/3-540-60164-3_25openalex-snapshot

Categorical fixed point calculus

inferred← citeshttps://doi.org/10.1007/3-540-61550-4_160openalex-snapshot

Equational properties of iteration in algebraically complete categories

inferred← citeshttps://doi.org/10.1007/3-540-61628-4_3openalex-snapshot

Polytypic programming

inferred← citeshttps://doi.org/10.1007/3-540-61629-2_56openalex-snapshot

Swinging data types

inferred← citeshttps://doi.org/10.1007/3540543961_7openalex-snapshot

Functional programming with bananas, lenses, envelopes and barbed wire

inferred← citeshttps://doi.org/10.1007/978-0-387-35672-3_3openalex-snapshot

Generic Accumulations

inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_8openalex-snapshot

Self-duality, Minimal Invariant Objects and Karoubi Invariance in Information Categories

inferred← citeshttps://doi.org/10.1007/978-1-4612-4962-7_10openalex-snapshot

Functors

inferred← citeshttps://doi.org/10.1007/978-3-030-57201-3_10openalex-snapshot

Semantics for First-Order Affine Inductive Data Types via Slice Categories

inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_26openalex-snapshot

Semantics for a Lambda Calculus for String Diagrams

inferred← citeshttps://doi.org/10.1007/978-3-031-64626-3_2openalex-snapshot

Composition Machines: Programming Self-organising Software Models for the Emergence of Sequential Program Spaces

inferred← citeshttps://doi.org/10.1007/978-3-540-24647-3_3openalex-snapshot

Context Modeling for Software Design

inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_15openalex-snapshot

Relationships Between Equational and Inductive Data Types

inferred← citeshttps://doi.org/10.1007/978-3-642-21493-6_2openalex-snapshot

From Grammars and Automata to Algebras and Coalgebras

inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_3openalex-snapshot

Fibrational Induction Meets Effects

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/978-3-662-09691-8_14openalex-snapshot

On the Algebraic Specification of Domains

inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_2openalex-snapshot

Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview

inferred← citeshttps://doi.org/10.1007/bfb0000477openalex-snapshot

Invariants, bisimulations and the correctness of coalgebraic refinements

inferred← citeshttps://doi.org/10.1007/bfb0014059openalex-snapshot

Basic properties of data types with inequational refinements

inferred← citeshttps://doi.org/10.1007/bfb0022272openalex-snapshot

An algebraic view of structural induction

inferred← citeshttps://doi.org/10.1007/bfb0023999openalex-snapshot

Using domain algebras to prove the correctness of a compiler

inferred← citeshttps://doi.org/10.1007/bfb0036893openalex-snapshot

On semantic foundations for applicative multiprogramming

inferred← citeshttps://doi.org/10.1007/s00165-002-0232-2openalex-snapshot

Abstract Data Types Can HaveInequations 1

inferred← citeshttps://doi.org/10.1016/0022-0000(80)90038-0openalex-snapshot

On the algebra of order

inferred← citeshttps://doi.org/10.1016/0022-0000(87)90020-1openalex-snapshot

Algebraic solutions to recursion schemes

inferred← citeshttps://doi.org/10.1016/0165-4896(92)90061-9openalex-snapshot

Some economic applications of Scott domains

inferred← citeshttps://doi.org/10.1016/0304-3975(82)90056-1openalex-snapshot

Graph grammars and operational semantics

inferred← citeshttps://doi.org/10.1016/0304-3975(87)90017-xopenalex-snapshot

Recursively defined domains and their induction principles

inferred← citeshttps://doi.org/10.1016/0304-3975(89)90012-1openalex-snapshot

Equational logic of circular data type specification

inferred← citeshttps://doi.org/10.1016/0304-3975(89)90091-1openalex-snapshot

Two-level semantics and abstract interpretation

inferred← citeshttps://doi.org/10.1016/0304-3975(91)90222-nopenalex-snapshot

Infinite hypergraphs I. Basic properties

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00010-0openalex-snapshot

Fixed-point operations on ccc's. Part I

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00245-3openalex-snapshot

The meaning of specifications I: Domains and initial models

inferred← citeshttps://doi.org/10.1016/0890-5401(92)90018-bopenalex-snapshot

New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic

inferred← citeshttps://doi.org/10.1016/b978-0-12-037104-4.50012-8openalex-snapshot

Categorical Functional Programming Language

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.008openalex-snapshot

The Bicategory-Theoretic Solution of Recursive Domain Equations

inferred← citeshttps://doi.org/10.1016/j.entcs.2020.09.008openalex-snapshot

Parametrized Fixed Points and Their Applications to Session Types

inferred← citeshttps://doi.org/10.1016/j.scico.2012.07.011openalex-snapshot

Adjoint folds and unfolds—An extended study

inferred← citeshttps://doi.org/10.1016/j.tpb.2025.03.003openalex-snapshot

Exact calculation of the expected SFS in structured populations

inferred← citeshttps://doi.org/10.1016/s0019-9958(82)80026-0openalex-snapshot

Parametrized data types do not need highly constrained parameters

inferred← citeshttps://doi.org/10.1016/s0167-6423(01)00020-xopenalex-snapshot

Polytypic data conversion programs

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00056-6openalex-snapshot

Universal coalgebra: a theory of systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00127-4openalex-snapshot

Fusion of recursive programs with computational effects

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00248-4openalex-snapshot

The equational logic of fixed points

inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00158-8openalex-snapshot

Equational properties of iteration in algebraically complete categories

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00099-1openalex-snapshot

Induction and recursion on the partial real line with applications to Real PCF

inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80065-3openalex-snapshot

Codatatypes in ML

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00055-6openalex-snapshot

Monadic Corecursion —Definition, Fusion Laws, and Applications—

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80370-0openalex-snapshot

From Parity Games to Circular Proofs

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80558-9openalex-snapshot

Unique, guarded fixed points in an additive setting

inferred← citeshttps://doi.org/10.1017/cbo9780511792588.003openalex-snapshot

An introduction to (co)algebra and (co)induction

inferred← citeshttps://doi.org/10.1017/cbo9781139032636openalex-snapshot

Lambda Calculus with Types

inferred← citeshttps://doi.org/10.1017/s0956796800001532openalex-snapshot

JFP volume 6 issue 1 Cover and Front matter

inferred← citeshttps://doi.org/10.1017/s0956796800001556openalex-snapshot

Generic functional programming with types and relations

inferred← citeshttps://doi.org/10.1017/s0956796815000209openalex-snapshot

Interleaving data and effects

inferred← citeshttps://doi.org/10.1017/s0960129500000360openalex-snapshot

Categories, relations and dynamic programming

inferred← citeshttps://doi.org/10.1017/s0960129500000372openalex-snapshot

Categorical data types in parametric polymorphism

inferred← citeshttps://doi.org/10.1017/s0960129500000852openalex-snapshot

Datatype laws without signatures

inferred← citeshttps://doi.org/10.1017/s0960129518000361openalex-snapshot

Equational properties of fixed-point operations in cartesian categories: An overview

inferred← citeshttps://doi.org/10.1017/s0960129522000263openalex-snapshot

Semantic analysis of normalisation by evaluation for typed lambda calculus

inferred← citeshttps://doi.org/10.1051/ita/1993270302211openalex-snapshot

CPO-models for second order lambda calculus with recursive types and subtyping

inferred← citeshttps://doi.org/10.1051/ita:2002010openalex-snapshot

μ-Bicomplete Categories and Parity Games

inferred← citeshttps://doi.org/10.1109/lics.1990.113771openalex-snapshot

New foundations for fixpoint computations

inferred← citeshttps://doi.org/10.1109/lics.1990.113772openalex-snapshot

Recursive types reduced to inductive types

inferred← citeshttps://doi.org/10.1109/lics.1993.287597openalex-snapshot

Relational properties of recursively defined domains

inferred← citeshttps://doi.org/10.1109/lics.1997.614963openalex-snapshot

Induction and recursion on the partial real line via biquotients of bifree algebras

inferred← citeshttps://doi.org/10.1109/lics.1998.705658openalex-snapshot

A theory of recursive domains with applications to concurrency

inferred← citeshttps://doi.org/10.1109/lics.2008.38openalex-snapshot

Second-Order and Dependently-Sorted Abstract Syntax

inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175688openalex-snapshot

Fixpoint operators for 2-categorical structures

inferred← citeshttps://doi.org/10.1109/sfcs.1978.28openalex-snapshot

On the algebra of order extended abstract

inferred← citeshttps://doi.org/10.1109/tpds.2021.3138459openalex-snapshot

Deep Reinforcement Learning Enhanced Greedy Algorithm for Online Scheduling of Batched Tasks in Cloud in Cloud HPC Systems

inferred← citeshttps://doi.org/10.1137/0211062openalex-snapshot

The Category-Theoretic Solution of Recursive Domain Equations

inferred← citeshttps://doi.org/10.1145/1291151.1291168openalex-snapshot

Inductive reasoning about effectful data types

inferred← citeshttps://doi.org/10.1145/1291220.1291168openalex-snapshot

Inductive reasoning about effectful data types

inferred← citeshttps://doi.org/10.1145/152992.153008openalex-snapshot

On lazy natural numbers with applications to computability theory and functional programming

inferred← citeshttps://doi.org/10.1145/29873.30399openalex-snapshot

Algorithmic specifications: a constructive specification method for abstract data types

inferred← citeshttps://doi.org/10.1145/3377555.3377889openalex-snapshot

Compiling first-order functions to session-typed parallel code

inferred← citeshttps://doi.org/10.1145/571157.571161openalex-snapshot

Semantic analysis of normalisation by evaluation for typed lambda calculus

inferred← citeshttps://doi.org/10.1145/800017.800527openalex-snapshot

A types-as-sets semantics for milner-style polymorphism

inferred← citeshttps://doi.org/10.14232/actacyb.23.1.2017.12openalex-snapshot

Initial Algebra for a System of Right-Linear Functors

inferred← citeshttps://doi.org/10.2168/lmcs-9(4:20)2013openalex-snapshot

Nominal Coalgebraic Data Types with Applications to Lambda Calculus

inferred← citeshttps://doi.org/10.23638/lmcs-17(2:9)2021openalex-snapshot

LNL-FPC: The Linear/Non-linear Fixpoint Calculus

inferred← citeshttps://doi.org/10.25959/23231843openalex-snapshot

Algebraic reasoning in lambda calculi

inferred← citeshttps://doi.org/10.3233/fi-1995-2431openalex-snapshot

PARAMETERS AND PARAMETRIZATION IN SPECIFICATION, USING DISTRIBUTIVE CATEGORIES

inferred← citeshttps://doi.org/10.3990/1.9789090048161openalex-snapshot

Law and Order in Algorithmics

inferred← citeshttps://doi.org/10.4204/eptcs.323.2openalex-snapshot

Reflecting Algebraically Compact Functors

inferred← citeshttps://doi.org/10.4204/eptcs.340.9openalex-snapshot

Quantum CPOs

inferred← citeshttps://doi.org/10.4230/lipics.calco.2015.205openalex-snapshot

Approximation of Nested Fixpoints – A Coalgebraic View of Parametric Dataypes

inferred← citeshttps://doi.org/10.4304/jsw.8.12.3088-3095openalex-snapshot

Formalization of Distributed and Dynamic Resources Allocation Using Category Theory

inferred← citeshttps://doi.org/10.48550/arxiv.2010.05167openalex-snapshot

A Categorical Programming Language

inferred← citeshttps://doi.org/10.70675/67cde9d3z7e8fz447dz98f0zdeb415a1c275openalex-snapshot

Inference of demographic histories in structured populations with an application to human evolution.

inferred← citeshttps://doi.org/10.7146/brics.v4i35.18961openalex-snapshot

A Theory of Recursive Domains with Applications to Concurrency

inferred← citeshttps://doi.org/10.7146/brics.v9i19.21736openalex-snapshot

An Extension Theorem with an Application to Formal Tree Series

inferred← citeshttps://doi.org/10.7146/dpb.v22i462.6935openalex-snapshot

Fibrations, Logical Predicates and Indeterminates

inferred← citeshttps://doi.org/10.82444/warw.33749962openalex-snapshot

Effective solutions of recursive domain equations

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.