On the public citation graph

Relational interpretations of recursive types in an operational setting (Summary)

https://doi.org/10.1007/bfb0014563
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.
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.1006/inco.1996.0052openalex-snapshot
Relational Properties of Domains
inferredcites →https://doi.org/10.1006/inco.1996.0061openalex-snapshot
From Operational Semantics to Domain Theory
inferredcites →https://doi.org/10.1006/inco.1999.2828openalex-snapshot
Relational Interpretations of Recursive Types in an Operational Setting
inferredcites →https://doi.org/10.1007/3-540-06841-4_57openalex-snapshot
On the relation between direct and continuation semantics
inferredcites →https://doi.org/10.1007/3-540-15648-8_17openalex-snapshot
Continuation semantics in typed lambda-calculi
inferredcites →https://doi.org/10.1007/bf01019461openalex-snapshot
Lambda-calculus schemata
inferredcites →https://doi.org/10.1007/bfb0084215openalex-snapshot
Algebraically complete categories
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0950-5849(89)90041-4openalex-snapshot
Foundations of programming languages
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50013-5openalex-snapshot
Type Systems for Programming Languages
inferredcites →https://doi.org/10.1017/cbo9780511525902.006openalex-snapshot
Remarks on algebraically compact categories
inferredcites →https://doi.org/10.1017/cbo9780511526619.007openalex-snapshot
Operationally-Based Theories of Program Equivalence
inferredcites →https://doi.org/10.1017/s095679680000085xopenalex-snapshot
Typing first-class continuations in ML
inferredcites →https://doi.org/10.1109/lics.1989.39174openalex-snapshot
Equality in lazy computation systems
inferredcites →https://doi.org/10.1109/lics.1990.113772openalex-snapshot
Recursive types reduced to inductive types
inferredcites →https://doi.org/10.1145/103135.103138openalex-snapshot
Dynamic typing in a statically typed language
inferredcites →https://doi.org/10.1145/382130.382133openalex-snapshot
Revised 4 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/99583.99608openalex-snapshot
Typing first-class continuations in ML
inferredcites →https://doi.org/10.5860/choice.30-5049openalex-snapshot
Semantics of programming languages: structures and techniques
inferredcites →https://doi.org/10.7146/brics.v4i24.18950openalex-snapshot
Relational Reasoning about Contexts
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11693024_6openalex-snapshot
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_8openalex-snapshot
Operational Semantics and Program Equivalence
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_11openalex-snapshot
Programming Language Semantics in Foundational Type Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_23openalex-snapshot
Typed Normal Form Bisimulation
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.043openalex-snapshot
Free Theorems and Runtime Type Representations
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80685-1openalex-snapshot
Parametric Polymorphism and Operational Equivalence (Preliminary Version)
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80702-9openalex-snapshot
Typed Closure Conversion for Recursively-Defined Functions
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80704-2openalex-snapshot
Similarity and Bisimilarity for Countable Non-Determinism and Higher-Order Functions (Extended Abstract)
inferred← citeshttps://doi.org/10.1017/s0960129500003054openalex-snapshot
[top ][top ]-closed relations and admissibility
inferred← citeshttps://doi.org/10.1017/s0960129500003066openalex-snapshot
Parametric polymorphism and operational equivalence
inferred← citeshttps://doi.org/10.1145/1040305.1040311openalex-snapshot
A bisimulation for type abstraction and recursion
inferred← citeshttps://doi.org/10.1145/1284320.1284325openalex-snapshot
A bisimulation for type abstraction and recursion
inferred← citeshttps://doi.org/10.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferred← citeshttps://doi.org/10.1145/504709.504712openalex-snapshot
An indexed model of recursive types for foundational proof-carrying code
inferred← citeshttps://doi.org/10.1201/b16812-79openalex-snapshot
Type Systems
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.