On the public citation graph

On procedures as open subroutines. I

https://doi.org/10.1007/bf00289503
0 signed · 36 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-07168-7_77openalex-snapshot
Modularity
inferredcites →https://doi.org/10.1007/bf01386340openalex-snapshot
Revised report on the algorithmic languageAlgol 60
inferredcites →https://doi.org/10.1007/bf01695769openalex-snapshot
Mappings and grammars on trees
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars

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-07407-4_29openalex-snapshot
Welcher Art Ergebnisse erwartet der Compilerbau von der Theoretischen Informatik?
inferred← citeshttps://doi.org/10.1007/3-540-08860-1_14openalex-snapshot
On the power of self-application and higher type recursion
inferred← citeshttps://doi.org/10.1007/3-540-09541-1_38openalex-snapshot
On a theory of decision problems in programming languages
inferred← citeshttps://doi.org/10.1007/3-540-10003-2_84openalex-snapshot
Present-day Hoare-like systems for programming languages with procedures: Power, limits and most likely extensions
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_360openalex-snapshot
Characterization of acceptable by algol-like programming languages
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_362openalex-snapshot
A sound and relatively complete axiomatization of clarke's language L4
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_375openalex-snapshot
Hoare's logic for programs with procedures — What has been achieved?
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_382openalex-snapshot
From denotational to operational and axiomatic semantics for ALGOL-like languages: An overview
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_7openalex-snapshot
On expressive interpretations of a Hoare-logic for Clarke's language L4
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_47openalex-snapshot
Optimal run time optimization proved by a new look at abstract interpretations
inferred← citeshttps://doi.org/10.1007/3-540-55984-1_13openalex-snapshot
The interprocedural coincidence theorem
inferred← citeshttps://doi.org/10.1007/978-3-540-24773-9_3openalex-snapshot
An ALGOL-View on Turbo ASM
inferred← citeshttps://doi.org/10.1007/978-3-540-75221-9_19openalex-snapshot
On Revival of Algol-Concepts in Modern Programming and Specification Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-66319-2_12openalex-snapshot
Über die Entscheidbarkeit der Formalen Erreichbarkeit von Prozeduren bei Monadischen Programmen
inferred← citeshttps://doi.org/10.1007/978-3-642-66319-2_20openalex-snapshot
Mathematical Theory of Serial Computers
inferred← citeshttps://doi.org/10.1007/978-3-642-67838-7_38openalex-snapshot
Ein Entwurf zur Maschinellen Unterstützung von Korrektheitsbeweisen bei Simulationen
inferred← citeshttps://doi.org/10.1007/978-3-662-01089-1_8openalex-snapshot
Hoare-Style Proof Systems and Formal Computations
inferred← citeshttps://doi.org/10.1007/bf00288636openalex-snapshot
On procedures as open subroutines. II
inferred← citeshttps://doi.org/10.1007/bf00289578openalex-snapshot
On the complexity of some problems concerning the use of procedures. II
inferred← citeshttps://doi.org/10.1007/bf00625282openalex-snapshot
On termination problems for finitely interpreted ALGOL-like programs
inferred← citeshttps://doi.org/10.1007/bf02252093openalex-snapshot
Zur Elimination von Prozedurschachtelungen
inferred← citeshttps://doi.org/10.1007/bfb0017155openalex-snapshot
On the expressive strength of the finitely typed lambda — terms
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.1016/0020-0190(79)90058-9openalex-snapshot
The formal termination problem for programs with finite ALGOL 68-modes
inferred← citeshttps://doi.org/10.1016/0167-6423(87)90009-8openalex-snapshot
A correctness proof of sorting by means of formal procedures
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90009-3openalex-snapshot
The IO- and OI-hierarchies
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90027-5openalex-snapshot
Some natural structures which fail to possess a sound and decidable hoare-like logic for their while-programs
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90088-4openalex-snapshot
Expressive power of typed and type-free programming languages
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.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73076-7openalex-snapshot
A New Transformational Approach to Partial Correctness Proof Calculi for Algol 6 8-Like Programs with Finite Modes and Simple Sideeffects
inferred← citeshttps://doi.org/10.1145/359361.383402openalex-snapshot
Technical correspondance
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.