On the public citation graph
On correct procedure parameter transmission in higher programming languages
0 signed · 61 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.1002/zamm.19700501120openalex-snapshot
A. van Wijngaarden (Ed.), B. J. Mailloux , J. E. L. Peck and C. H. A. Koster , Report on the Algorithmic Language ALGOL 68. Amsterdam 1969. Printing by the Mathematisch Centrum. Preis brosch. $ 4.50 .
inferredcites →https://doi.org/10.1007/978-3-642-86934-1openalex-snapshot
Handbook for Automatic Computation
inferredcites →https://doi.org/10.1007/bf01386340openalex-snapshot
Revised report on the algorithmic languageAlgol 60
inferredcites →https://doi.org/10.1007/bf02163002openalex-snapshot
Report on the Algorithmic Language ALGOL 68
inferredcites →https://doi.org/10.1016/0020-0190(71)90008-1openalex-snapshot
Representation and equality of modes
inferredcites →https://doi.org/10.1016/s0066-4138(63)80007-5openalex-snapshot
A multi-pass translation scheme for ALGOL 60
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08555-9openalex-snapshot
A variant of a recursively unsolvable problem
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60
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-06666-7_39openalex-snapshot
Zum Begriff Der Modularität Von Programmiersprachen
inferred← citeshttps://doi.org/10.1007/3-540-06666-7_40openalex-snapshot
Entscheidbarkeitsprobleme Bei Der Übrestezung Von Programmen Mit Einparametrigen Prozeduren
inferred← citeshttps://doi.org/10.1007/3-540-06841-4_54openalex-snapshot
On the Most Recent Property of ALGOL-Like Programs
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-09541-1_38openalex-snapshot
On a theory of decision problems in programming languages
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_17openalex-snapshot
Semantics for lisp without reference to an interpreter
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_375openalex-snapshot
Hoare's logic for programs with procedures — What has been achieved?
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_8openalex-snapshot
On the calling behaviour of procedures
inferred← citeshttps://doi.org/10.1007/3-540-16442-1_3openalex-snapshot
A general approach to the optimization of function calls
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_58openalex-snapshot
Polynomial recursion analysis in pascal like programs
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_59openalex-snapshot
Complexity of proving program correctness
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_43openalex-snapshot
The complexity of verifying functional programs
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-68355-8_13openalex-snapshot
Static Semantic Checks of Global Variables in a Procedural Language
inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_14openalex-snapshot
Ein Optimierter Static Scope Lisp-Interpretierer Auf Der Basis Algol-Artiger Laufzeitkeller
inferred← citeshttps://doi.org/10.1007/978-3-642-87956-2_10openalex-snapshot
Beschleunigung Von Laufzeitsystemen Durch Mikro-Programmierung
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/bf00261258openalex-snapshot
Sound and complete Hoare-like calculi based on copy rules
inferred← citeshttps://doi.org/10.1007/bf00263196openalex-snapshot
On the complexity of some problems concerning the use of procedures. I.
inferred← citeshttps://doi.org/10.1007/bf00288636openalex-snapshot
On procedures as open subroutines. 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/bf03037406openalex-snapshot
Low cost environment changing in a shallow binding system
inferred← citeshttps://doi.org/10.1007/s00287-010-0433-7openalex-snapshot
Dijkstras fruchtbarer, folgenreicher Irrtum
inferred← citeshttps://doi.org/10.1007/s00287-010-0446-2openalex-snapshot
Dijkstras fruchtbarer, folgenreicher Irrtum
inferred← citeshttps://doi.org/10.1007/s00287-010-0466-yopenalex-snapshot
Dijkstras fruchtbarer, folgenreicher Irrtum
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/0096-0551(95)00002-lopenalex-snapshot
A complete semantics for SMALLTALK-80
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(84)90066-5openalex-snapshot
Correctness of programs with Pascal-like procedures without global variables
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90003-4openalex-snapshot
A polynomial determination of the most-recent property in Pascal-like programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80399-2openalex-snapshot
Towards Acceptability of Optimizations
inferred← citeshttps://doi.org/10.1109/iccl.1998.674175openalex-snapshot
Formal callability and its relevance and application to interprocedural data-flow analysis
inferred← citeshttps://doi.org/10.1109/lics.1991.151636openalex-snapshot
Complexity bounds of Hoare-style proof systems
inferred← citeshttps://doi.org/10.1145/324634.325437openalex-snapshot
Dynamic optimization of covered tail recursive functions in applicative languages
inferred← citeshttps://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferred← citeshttps://doi.org/10.1145/567067.567092openalex-snapshot
Incremental polymorphic type checking in B
inferred← citeshttps://doi.org/10.1145/800061.808761openalex-snapshot
A characterization of Hoare's logic for programs with Pascal-like procedures
inferred← citeshttps://doi.org/10.3233/fi-2013-789openalex-snapshot
Some Methodological Remarks Inspired by the Paper “On inner classes” by A. Igarashi and B. Pierce
inferred← citeshttps://doi.org/10.4204/eptcs.129.16openalex-snapshot
Higher-Order Process Modeling: Product-Lining, Variability Modeling and Beyond
inferred← citeshttps://doi.org/10.5555/324493.324623openalex-snapshot
A polynomial determination of the most recent property in pascal-like program
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.