On the public citation graph

Recursive data structures

https://doi.org/10.1007/bf00976239
0 signed · 162 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/978-3-642-59412-0_24openalex-snapshot
Proof of Correctness of Data Representations
inferredcites →https://doi.org/10.1007/bf00263742openalex-snapshot
A system which automatically improves programs
inferredcites →https://doi.org/10.1007/bf00264291openalex-snapshot
The programming language pascal
inferredcites →https://doi.org/10.1007/bf00289507openalex-snapshot
Proof of correctness of data representations
inferredcites →https://doi.org/10.1007/bf01386216openalex-snapshot
Report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1007/bf02163002openalex-snapshot
Report on the Algorithmic Language ALGOL 68
inferredcites →https://doi.org/10.1007/bfb0059703openalex-snapshot
The lattice of flow diagrams
inferredcites →https://doi.org/10.1016/b978-1-4831-9779-1.50019-7openalex-snapshot
Report on the Algorithmic Language ALGOL 60
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.1038/213129a0openalex-snapshot
Programming Languages
inferredcites →https://doi.org/10.1093/comjnl/12.1.41openalex-snapshot
Proving Properties of Programs by Structural Induction
inferredcites →https://doi.org/10.1145/365696.365702openalex-snapshot
A contribution to the development of ALGOL
inferredcites →https://doi.org/10.1145/366199.366256openalex-snapshot
A generalized technique for symbol manipulation and numerical calculation
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/512927.512943openalex-snapshot
Reasoning about programs
inferredcites →https://doi.org/10.26153/tsw/53177openalex-snapshot
Notes on Structured Programming
inferredcites →https://doi.org/10.7551/mitpress/12274.003.0023openalex-snapshot
Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.4380080404openalex-snapshot
Unbounded computational structures
inferred← citeshttps://doi.org/10.1002/spe.4380111202openalex-snapshot
Dynamically structured data
inferred← citeshttps://doi.org/10.1007/0-387-28123-1openalex-snapshot
Developing Statistical Software in Fortran 95
inferred← citeshttps://doi.org/10.1007/11532231_8openalex-snapshot
Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures
inferred← citeshttps://doi.org/10.1007/11690634_7openalex-snapshot
A Logic of Reachable Patterns in Linked Data-Structures
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_74openalex-snapshot
Algebraic Semantics of Type Definitions and Structured Variables
inferred← citeshttps://doi.org/10.1007/3-540-08921-7_56openalex-snapshot
Data types as functions
inferred← citeshttps://doi.org/10.1007/3-540-10256-6_7openalex-snapshot
Conclusions and further research
inferred← citeshttps://doi.org/10.1007/3-540-15648-8_5openalex-snapshot
Recursive definitions in type theory
inferred← citeshttps://doi.org/10.1007/3-540-15975-4_26openalex-snapshot
Miranda: A non-strict functional language with polymorphic types
inferred← citeshttps://doi.org/10.1007/3-540-51171-7_26openalex-snapshot
Recursively defined complex objects
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_162openalex-snapshot
Uniform traversal combinators: Definition, use and properties
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_3openalex-snapshot
Explicit cyclic substitutions
inferred← citeshttps://doi.org/10.1007/3-540-57342-9_81openalex-snapshot
Managing change in persistent object systems
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_62openalex-snapshot
Induce-statements and induce-expressions: Constructs for inductive programming
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_114openalex-snapshot
Inductive definitions and type theory an introduction (preliminary version)
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_26openalex-snapshot
Some practical problems and their influence on semantics
inferred← citeshttps://doi.org/10.1007/3-540-62599-2_34openalex-snapshot
An abstract data type for freezable lists and DAGs
inferred← citeshttps://doi.org/10.1007/978-1-4419-8596-5openalex-snapshot
A Practical Theory of Programming
inferred← citeshttps://doi.org/10.1007/978-1-4419-8596-5_11openalex-snapshot
Reference
inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_4openalex-snapshot
The Essence of Algol
inferred← citeshttps://doi.org/10.1007/978-1-4613-1437-0_1openalex-snapshot
Non-Interference Properties of a Concurrent Object-Based Language: Proofs Based on an Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-1-4684-3384-5_10openalex-snapshot
An Axiomatic Data Base Theory
inferred← citeshttps://doi.org/10.1007/978-1-4684-5862-6_28openalex-snapshot
Implementing Recursive Data Structures in ADA
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_22openalex-snapshot
Verification via Structure Simulation
inferred← citeshttps://doi.org/10.1007/978-3-540-69149-5_11openalex-snapshot
Automatic Verification of Strongly Dynamic Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_4openalex-snapshot
The Location Linking Concept: A Basis for Verification of Code Using Pointers
inferred← citeshttps://doi.org/10.1007/978-3-642-59623-0_23openalex-snapshot
Persistent Foundations for Scalable Multi-Paradigmal Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-69032-7_2openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1007/978-3-642-69297-0_10openalex-snapshot
Rekursive Datenmodelle
inferred← citeshttps://doi.org/10.1007/978-3-642-69796-8_19openalex-snapshot
Specification and Prototyping of Data Model Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-70284-6_15openalex-snapshot
Modellierung Komplexer Objektstrukturen in Bürosystemen
inferred← citeshttps://doi.org/10.1007/978-3-642-70289-1_9openalex-snapshot
Literaturverzeichnis
inferred← citeshttps://doi.org/10.1007/978-3-642-70639-4_74openalex-snapshot
Datenbankunterstützung für Expertensysteme
inferred← citeshttps://doi.org/10.1007/978-3-642-79646-3_10openalex-snapshot
Attributierte Grammatiken als Werkzeug zur Datenmodellierung
inferred← citeshttps://doi.org/10.1007/978-3-642-82384-8_9openalex-snapshot
Programming Support for Data-Intensive Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-83397-7_8openalex-snapshot
Integrated Fact and Rule Management Based on Relational Technology
inferred← citeshttps://doi.org/10.1007/978-3-642-96729-0_1openalex-snapshot
The Evolution of Programming Languages
inferred← citeshttps://doi.org/10.1007/bf00122417openalex-snapshot
Accommodating interference in the formal design of concurrent object-based programs
inferred← citeshttps://doi.org/10.1007/bf00264318openalex-snapshot
On removing the machine from the language
inferred← citeshttps://doi.org/10.1007/bf00264494openalex-snapshot
Problematic features of programming languages: a situational-calculus approach
inferred← citeshttps://doi.org/10.1007/bf00266046openalex-snapshot
Generalized recursive data structures
inferred← citeshttps://doi.org/10.1007/bf00288728openalex-snapshot
More comments on the programming language Pascal
inferred← citeshttps://doi.org/10.1007/bf00289243openalex-snapshot
Language design methods based on semantic principles
inferred← citeshttps://doi.org/10.1007/bf01752392openalex-snapshot
Algebraic specification of data types: A synthetic approach
inferred← citeshttps://doi.org/10.1007/bf02237956openalex-snapshot
The implementation of insertion and deletion algorithms for 1–2 brother trees
inferred← citeshttps://doi.org/10.1007/bfb0014665openalex-snapshot
A case study in language design: Euclid
inferred← citeshttps://doi.org/10.1007/bfb0014676openalex-snapshot
Examples for change of types and object structures
inferred← citeshttps://doi.org/10.1007/bfb0014680openalex-snapshot
Programing languages for reliable computing systems
inferred← citeshttps://doi.org/10.1007/bfb0014682openalex-snapshot
Towards a wide spectrum language to support program specification and program development
inferred← citeshttps://doi.org/10.1007/bfb0018349openalex-snapshot
A set constructor for inductive sets in Martin-Löf's type theory
inferred← citeshttps://doi.org/10.1007/bfb0021420openalex-snapshot
A note on "pointers"
inferred← citeshttps://doi.org/10.1007/bfb0021421openalex-snapshot
Some issues in data types and type checking
inferred← citeshttps://doi.org/10.1007/bfb0021432openalex-snapshot
A reminder for language designers
inferred← citeshttps://doi.org/10.1007/bfb0025775openalex-snapshot
The type theory of PL/CV3
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90008-9openalex-snapshot
A view of computability on term algebras
inferred← citeshttps://doi.org/10.1016/0096-0551(77)90002-9openalex-snapshot
Pointers and data abstractions in high level languages—I: Language proposals
inferred← citeshttps://doi.org/10.1016/0096-0551(77)90003-0openalex-snapshot
Pointers and data abstractions in high level languages—II: Correctness proofs
inferred← citeshttps://doi.org/10.1016/0096-0551(78)90005-xopenalex-snapshot
Recent developments in the theory of data structures
inferred← citeshttps://doi.org/10.1016/0096-0551(85)90007-4openalex-snapshot
The design of Apple—A language for modular programs
inferred← citeshttps://doi.org/10.1016/0096-0551(87)90002-6openalex-snapshot
Structured program lookahead
inferred← citeshttps://doi.org/10.1016/0096-0551(92)90026-jopenalex-snapshot
Inheritance of theory in the ADABTPL language
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90013-nopenalex-snapshot
On the notion of object
inferred← citeshttps://doi.org/10.1016/0167-6423(81)90006-xopenalex-snapshot
Programming in a wide spectrum language: a collection of examples
inferred← citeshttps://doi.org/10.1016/0167-6423(89)90016-6openalex-snapshot
Elementary data structures in ALGOL-like languages
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90034-3openalex-snapshot
Mechanizing structural induction part I: Formal system
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90035-5openalex-snapshot
Mechanizing structural induction part II: Strategies
inferred← citeshttps://doi.org/10.1016/0306-4573(86)90118-4openalex-snapshot
A recursive approach to office object modelling
inferred← citeshttps://doi.org/10.1016/b978-0-12-374514-9.00002-1openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.12.001openalex-snapshot
A logic of reachable patterns in linked data-structures
inferred← citeshttps://doi.org/10.1016/j.langsci.2014.05.006openalex-snapshot
What linguists are talking about when talking about…
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80016-1openalex-snapshot
Inheritance hierarchies: Semantics and unification
inferred← citeshttps://doi.org/10.1049/ip-sen:20030130openalex-snapshot
The Honeysuckle programming language: an overview
inferred← citeshttps://doi.org/10.1093/logcom/exs071openalex-snapshot
From mathematical logic to programming-language semantics: a discussion with Tony Hoare
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/icde.1984.7271266openalex-snapshot
Recursive data models for non-conventional database applications
inferred← citeshttps://doi.org/10.1109/sfcs.1980.36openalex-snapshot
Programs and types
inferred← citeshttps://doi.org/10.1109/tools.1997.654735openalex-snapshot
T++: a test case generator using a debugging information based technique for source code manipulation
inferred← citeshttps://doi.org/10.1145/115372.115369openalex-snapshot
Automatic generation and use of abstract structure operators
inferred← citeshttps://doi.org/10.1145/130981.130993openalex-snapshot
Where is the evidence against arrays and pointers?
inferred← citeshttps://doi.org/10.1145/158511.158628openalex-snapshot
Graph types
inferred← citeshttps://doi.org/10.1145/2442087.2442090openalex-snapshot
Coverage-directed observability-based validation for embedded software
inferred← citeshttps://doi.org/10.1145/24562.24573openalex-snapshot
Status of DAPSE distributed Ada support
inferred← citeshttps://doi.org/10.1145/292540.292552openalex-snapshot
Parametric shape analysis via 3-valued logic
inferred← citeshttps://doi.org/10.1145/3158191.3158205openalex-snapshot
Compile-time dynamic and recursive data structures in Modelica
inferred← citeshttps://doi.org/10.1145/320576.320591openalex-snapshot
A facility for defining and manipulating generalized data structures
inferred← citeshttps://doi.org/10.1145/322203.322204openalex-snapshot
Reasoning About Recursively Defined Data Structures
inferred← citeshttps://doi.org/10.1145/347324.348031openalex-snapshot
Putting static analysis to work for verification
inferred← citeshttps://doi.org/10.1145/347636.348031openalex-snapshot
Putting static analysis to work for verification
inferred← citeshttps://doi.org/10.1145/3477355.3477367openalex-snapshot
Software Specification
inferred← citeshttps://doi.org/10.1145/3477355.3477375openalex-snapshot
List of Tony Hoare’s Publications
inferred← citeshttps://doi.org/10.1145/3549821openalex-snapshot
Generating circuits with generators
inferred← citeshttps://doi.org/10.1145/356715.356719openalex-snapshot
Programming in an Interactive Environment: the ``Lisp'' Experience
inferred← citeshttps://doi.org/10.1145/357139.357142openalex-snapshot
Associons: A Program Notation with Tuples Instead of Variables
inferred← citeshttps://doi.org/10.1145/357233.357238openalex-snapshot
The Type Theory of PL/CV3
inferred← citeshttps://doi.org/10.1145/358198.358211openalex-snapshot
Visibility aspects of programmed dynamic data structures
inferred← citeshttps://doi.org/10.1145/359060.359067openalex-snapshot
Recursive data structures in APL
inferred← citeshttps://doi.org/10.1145/359657.359666openalex-snapshot
Abstract data types and software validation
inferred← citeshttps://doi.org/10.1145/360204.360206openalex-snapshot
Verifying safety properties of concurrent Java programs using 3-valued logic
inferred← citeshttps://doi.org/10.1145/3729283openalex-snapshot
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
inferred← citeshttps://doi.org/10.1145/373243.360206openalex-snapshot
Verifying safety properties of concurrent Java programs using 3-valued logic
inferred← citeshttps://doi.org/10.1145/384283.801108openalex-snapshot
The impact of APL2 on teaching APL
inferred← citeshttps://doi.org/10.1145/390016.808420openalex-snapshot
The impact of language design on the production of reliable software
inferred← citeshttps://doi.org/10.1145/390016.808454openalex-snapshot
Constructing correct and efficient concurrent programs
inferred← citeshttps://doi.org/10.1145/5001.5004openalex-snapshot
Applicative caching
inferred← citeshttps://doi.org/10.1145/512760.512776openalex-snapshot
Reasoning about recursively defined data structures
inferred← citeshttps://doi.org/10.1145/514188.514190openalex-snapshot
Parametric shape analysis via 3-valued logic
inferred← citeshttps://doi.org/10.1145/567446.567469openalex-snapshot
"Type-completeness" as a language principle
inferred← citeshttps://doi.org/10.1145/567532.567534openalex-snapshot
Paths
inferred← citeshttps://doi.org/10.1145/567532.567546openalex-snapshot
Formal program testing
inferred← citeshttps://doi.org/10.1145/567752.567776openalex-snapshot
Flow analysis and optimization of LISP-like structures
inferred← citeshttps://doi.org/10.1145/59287.77345openalex-snapshot
Typed representation of objects by functions
inferred← citeshttps://doi.org/10.1145/62678.62688openalex-snapshot
Concrete syntax for data objects in functional languages
inferred← citeshttps://doi.org/10.1145/68012.68014openalex-snapshot
Automatic verification of database transaction safety
inferred← citeshttps://doi.org/10.1145/800027.808420openalex-snapshot
The impact of language design on the production of reliable software
inferred← citeshttps://doi.org/10.1145/800068.802135openalex-snapshot
A parallel Prolog
inferred← citeshttps://doi.org/10.1145/800076.802453openalex-snapshot
Classes of functions for computing on binary trees (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800114.803678openalex-snapshot
Recursive data structures and related control mechanisms in APL
inferred← citeshttps://doi.org/10.1145/800142.805347openalex-snapshot
Graphical data structures in APL
inferred← citeshttps://doi.org/10.1145/800205.806323openalex-snapshot
The definition and use of data structures in REDUCE
inferred← citeshttps://doi.org/10.1145/800205.806326openalex-snapshot
Recursive programming through table look-up
inferred← citeshttps://doi.org/10.1145/800223.806772openalex-snapshot
Applicative caching
inferred← citeshttps://doi.org/10.1145/800225.806838openalex-snapshot
Efficient abstractions for the implementation of structured editors
inferred← citeshttps://doi.org/10.1145/800228.806939openalex-snapshot
Prolog - the language and its implementation compared with Lisp
inferred← citeshttps://doi.org/10.1145/800237.807127openalex-snapshot
Programming without pointer variables
inferred← citeshttps://doi.org/10.1145/800237.807129openalex-snapshot
Correctness of data representations (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/942574.807127openalex-snapshot
Programming without pointer variables
inferred← citeshttps://doi.org/10.1145/953246.953247openalex-snapshot
On the development of data structures
inferred← citeshttps://doi.org/10.1145/953343.953345openalex-snapshot
Reply to a paper by A. N. Habermann on the programming language Pascal
inferred← citeshttps://doi.org/10.1145/954587.954588openalex-snapshot
Towards a wide spectrum language to support program specification and program development
inferred← citeshttps://doi.org/10.1145/954618.954623openalex-snapshot
A reminder for language designers
inferred← citeshttps://doi.org/10.1145/954639.954643openalex-snapshot
The taming of the pointer
inferred← citeshttps://doi.org/10.1145/984344.807127openalex-snapshot
Programming without pointer variables
inferred← citeshttps://doi.org/10.1145/988164.988172openalex-snapshot
Values and objects in programming languages
inferred← citeshttps://doi.org/10.1145/988193.988202openalex-snapshot
Abstraction in the Intel iAPX-432 prototype systems implementation language
inferred← citeshttps://doi.org/10.1147/rd.284.0412openalex-snapshot
Empty arrays in extended APL
inferred← citeshttps://doi.org/10.1201/9781315197814-18openalex-snapshot
The statistical method of effective data structures designing for particular software and hardware environments
inferred← citeshttps://doi.org/10.1609/aaai.v38i8.28649openalex-snapshot
An Eager Satisfiability Modulo Theories Solver for Algebraic Datatypes
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:12)2009openalex-snapshot
Simulating reachability using first-order logic with applications to verification of linked data structures
inferred← citeshttps://doi.org/10.25100/pfilosofica.v0i40.3016openalex-snapshot
Sobre el concepto de recursión y sus usos
inferred← citeshttps://doi.org/10.31274/rtd-180813-8924openalex-snapshot
Data structure implementation and correctness
inferred← citeshttps://doi.org/10.4230/oasics.wcet.2008.1668openalex-snapshot
A tool for average and worst-case execution time analysis
inferred← citeshttps://doi.org/10.7146/brics.v2i8.19511openalex-snapshot
Type Inference of Turbo Pascal
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.