On the public citation graph

Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs

https://doi.org/10.1007/bfb0016242
0 signed · 35 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-12328-8openalex-snapshot
The Programming Language Ada Reference Manual American National Standards Institute, Inc. ANSI/MIL-STD-1815A-1983
inferredcites →https://doi.org/10.1007/3-540-13331-3_50openalex-snapshot
Spektralproblem and completeness of logical decision problems
inferredcites →https://doi.org/10.1007/3-540-13346-1_1openalex-snapshot
A kernel language for abstract data types and modules
inferredcites →https://doi.org/10.1007/3-540-15648-8_29openalex-snapshot
A simple programming language with data types: semantics and verification
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/bf00264291openalex-snapshot
The programming language pascal
inferredcites →https://doi.org/10.1007/bf00265077openalex-snapshot
Revised report on the algorithmic language ALGOL 68
inferredcites →https://doi.org/10.1007/bfb0012756openalex-snapshot
On the power of nondeterminism in dynamic logic
inferredcites →https://doi.org/10.1007/bfb0030337openalex-snapshot
Remarks on comparing expressive power of logics of programs
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
inferredcites →https://doi.org/10.1016/0304-3975(88)90052-7openalex-snapshot
Some relationships between logics of programs and complexity theory
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/s0019-9958(83)80006-0openalex-snapshot
A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs
inferredcites →https://doi.org/10.1016/s0019-9958(83)80024-2openalex-snapshot
Deterministic dynamic logic is strictly weaker than dynamic logic
inferredcites →https://doi.org/10.1016/s0019-9958(84)80023-6openalex-snapshot
On static logics, dynamic logics, and complexity classes
inferredcites →https://doi.org/10.1017/s0022481200100076openalex-snapshot
Problems
inferredcites →https://doi.org/10.1109/sfcs.1983.71openalex-snapshot
Some relationships between logics of programs and complexity theory
inferredcites →https://doi.org/10.1145/322108.322121openalex-snapshot
Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1145/800061.808765openalex-snapshot
Languages which capture complexity classes
inferredcites →https://doi.org/10.1145/800061.808767openalex-snapshot
Iterated pushdown automata and complexity classes
inferredcites →https://doi.org/10.3233/fi-1989-12404openalex-snapshot
A Generalization of Cook’s Auxiliary-Pushdown-Automata Theorem

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-18740-5_53openalex-snapshot
Verification of programs with higher-order arrays
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_13openalex-snapshot
On Infinite Terms Having a Decidable Monadic Theory
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_15openalex-snapshot
Higher-Order Pushdown Trees Are Easy
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_37openalex-snapshot
Characterizing complexity classes by higher type
inferred← citeshttps://doi.org/10.1007/978-3-540-45220-1_28openalex-snapshot
The Surprising Power of Restricted Programs and Gödel’s Functionals
inferred← citeshttps://doi.org/10.1007/978-94-017-0456-4_2openalex-snapshot
Dynamic Logic
inferred← citeshttps://doi.org/10.1007/bfb0026297openalex-snapshot
Characterizing complexity classes by general recursive definitions in higher types
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90210-7openalex-snapshot
On the expressive power of finitely typed and universally polymorphic recursive procedures
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90363-kopenalex-snapshot
Characterizing complexity classes by higher type primitive recursive definitions
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90062-kopenalex-snapshot
Characterizing complexity classes by general recursive definitions in higher types
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/j.apal.2003.10.013openalex-snapshot
Computational inductive definability
inferred← citeshttps://doi.org/10.1109/lics.1989.39191openalex-snapshot
Characterizing complexity classes by higher type primitive recursive definitions
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.