On the public citation graph
Program Schemes with Pushdown Stores
0 signed · 37 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(72)90007-5openalex-snapshot
Programming by induction
inferredcites →https://doi.org/10.1016/s0022-0000(71)80036-3openalex-snapshot
Translating recursion equations into flow charts
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
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-06953-4_1openalex-snapshot
Simple program schemes and formal languages
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_128openalex-snapshot
Economy of description for program schemes extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_368openalex-snapshot
Necessary and sufficient conditions for the universality of programming formalisms
inferred← citeshttps://doi.org/10.1007/bf00288773openalex-snapshot
Necessary and sufficient conditions for the universality of programming formalisms
inferred← citeshttps://doi.org/10.1007/bf01069948openalex-snapshot
Allocation of segmented virtual memory
inferred← citeshttps://doi.org/10.1007/bf01536402openalex-snapshot
On the structural simplicity of machines and languages
inferred← citeshttps://doi.org/10.1007/bf02246433openalex-snapshot
Function iteration logics and flowchart schemata
inferred← citeshttps://doi.org/10.1007/bf02666995openalex-snapshot
Recursive information transducers: computation models
inferred← citeshttps://doi.org/10.1007/bfb0017486openalex-snapshot
On the first-order equivalence of call-by-name and call-by-value
inferred← citeshttps://doi.org/10.1007/bfb0025781openalex-snapshot
Some connections between iterative programs, recursive programs, and first-order logic
inferred← citeshttps://doi.org/10.1007/bfb0053540openalex-snapshot
The WHILE hierarchy of program schemes is infinite
inferred← citeshttps://doi.org/10.1016/0020-0190(80)90059-9openalex-snapshot
Another application of recursion introduction
inferred← citeshttps://doi.org/10.1016/0022-0000(80)90044-6openalex-snapshot
The equivalence of R.E. program schemes and data flow schemes
inferred← citeshttps://doi.org/10.1016/0096-0551(75)90032-6openalex-snapshot
On the power of programming features
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/0304-3975(83)90013-0openalex-snapshot
Definability by programs in first-order structures
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90052-7openalex-snapshot
Some relationships between logics of programs and complexity theory
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/b978-0-444-88074-1.50019-6openalex-snapshot
Logics of Programs
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80023-6openalex-snapshot
On static logics, dynamic logics, and complexity classes
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80030-9openalex-snapshot
Translatability of schemas over restricted interpretations
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80013-4openalex-snapshot
Effective proper procedures and universal classes of program schemata
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70163-6openalex-snapshot
Algorithmic Procedures, Generalized Turing Algorithms, and Elementary Recursion Theory
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73080-9openalex-snapshot
Descriptional Complexity for Classes of Ianov-Schemes
inferred← citeshttps://doi.org/10.1109/sfcs.1980.25openalex-snapshot
Loop elimination and loop reduction A model-theoretic analysis of programs
inferred← citeshttps://doi.org/10.1109/sfcs.1983.71openalex-snapshot
Some relationships between logics of programs and complexity theory
inferred← citeshttps://doi.org/10.1137/0204011openalex-snapshot
Translating Program Schemas to While-Schemas
inferred← citeshttps://doi.org/10.1145/359863.359889openalex-snapshot
Improving programs by the introduction of recursion
inferred← citeshttps://doi.org/10.1145/582153.582191openalex-snapshot
On the ability of structures to store and access information
inferred← citeshttps://doi.org/10.1145/800119.803879openalex-snapshot
Degrees of translatability and canonical forms in program schemas
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.