On the public citation graph

Existential types: Logical relations and operational equivalence

https://doi.org/10.1007/bfb0055063
0 signed · 70 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.1999.2829openalex-snapshot
Comparing Object Encodings
inferredcites →https://doi.org/10.1007/3-540-06859-7_148openalex-snapshot
Towards a theory of type structure
inferredcites →https://doi.org/10.1007/3-540-57182-5_8openalex-snapshot
Observable properties of higher order functions that dynamically create local names, or: What's new?
inferredcites →https://doi.org/10.1007/978-3-642-93220-5_3openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1007/bf01018828openalex-snapshot
Simple imperative polymorphism
inferredcites →https://doi.org/10.1007/bfb0037118openalex-snapshot
A logic for parametric polymorphism
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-12-450010-5.50023-2openalex-snapshot
On the Equivalence of Data Representations
inferredcites →https://doi.org/10.1016/s0016-6995(88)80026-3openalex-snapshot
Thèse de doctorat d'Etat
inferredcites →https://doi.org/10.1016/s0019-9958(85)80001-2openalex-snapshot
Logical relations and the typed λ-calculus
inferredcites →https://doi.org/10.1016/s1571-0661(05)80685-1openalex-snapshot
Parametric Polymorphism and Operational Equivalence (Preliminary Version)
inferredcites →https://doi.org/10.1142/9789812812636_0008openalex-snapshot
INFORMATION PROCESSING
inferredcites →https://doi.org/10.1145/234313.234418openalex-snapshot
Type systems
inferredcites →https://doi.org/10.1145/44501.45065openalex-snapshot
Abstract types have existential type
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/11964681_3openalex-snapshot
Proof Tool Support for Explicit Strictness
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_7openalex-snapshot
Genericity and the π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44806-3_4openalex-snapshot
Short Cut Fusion: Proved and Improved
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_8openalex-snapshot
Operational Semantics and Program Equivalence
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_9openalex-snapshot
A Higher-Order Simulation Relation for System F
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_15openalex-snapshot
Mechanized Operational Semantics via (Co)Induction
inferred← citeshttps://doi.org/10.1007/978-3-031-16912-0_7openalex-snapshot
Semantic Preservation for a Type Directed Translation Scheme of Featherweight Go
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_20openalex-snapshot
A Design for a Security-Typed Language with Certificate-Based Declassification
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_10openalex-snapshot
Specification Refinement with System F – The Higher-Order Case
inferred← citeshttps://doi.org/10.1007/bfb0056620openalex-snapshot
Operational versus denotational methods in the semantics of higher order languages
inferred← citeshttps://doi.org/10.1007/s00236-005-0175-1openalex-snapshot
Genericity and the π-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.010openalex-snapshot
Syntactic Logical Relations for Polymorphic and Recursive Types
inferred← citeshttps://doi.org/10.1016/j.jlamp.2023.100894openalex-snapshot
Operationally-based program equivalence proofs using LCTRSs
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.032openalex-snapshot
A bisimulation for dynamic sealing
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80874-0openalex-snapshot
Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
inferred← citeshttps://doi.org/10.1017/cbo9781139342131openalex-snapshot
Practical Foundations for Programming Languages
inferred← citeshttps://doi.org/10.1017/s0956796802004409openalex-snapshot
Short cut fusion is correct
inferred← citeshttps://doi.org/10.1017/s0956796823000047openalex-snapshot
A type-directed, dictionary-passing translation of method overloading and structural subtyping in Featherweight Generic Go
inferred← citeshttps://doi.org/10.1017/s0960129500003066openalex-snapshot
Parametric polymorphism and operational equivalence
inferred← citeshttps://doi.org/10.1017/s0960129504004578openalex-snapshot
On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi
inferred← citeshttps://doi.org/10.1017/s0960129510000162openalex-snapshot
Realisability semantics of parametric polymorphism, general references and recursive types
inferred← citeshttps://doi.org/10.1023/a:1022982420888openalex-snapshot
inferred← citeshttps://doi.org/10.1109/csfw.2001.930151openalex-snapshot
Logical relations for encryption
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175778openalex-snapshot
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF
inferred← citeshttps://doi.org/10.1109/secpri.2004.1301323openalex-snapshot
Run-time principals in information-flow type systems
inferred← citeshttps://doi.org/10.1145/1013963.1013985openalex-snapshot
A compositional logic for polymorphic higher-order functions
inferred← citeshttps://doi.org/10.1145/1016848.1016874openalex-snapshot
From process logic to program logic
inferred← citeshttps://doi.org/10.1145/1040305.1040311openalex-snapshot
A bisimulation for type abstraction and recursion
inferred← citeshttps://doi.org/10.1145/1047659.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/1290520.1290526openalex-snapshot
Run-time principals in information-flow type systems
inferred← citeshttps://doi.org/10.1145/1411203.1411227openalex-snapshot
Typed closure conversion preserves observational equivalence
inferred← citeshttps://doi.org/10.1145/1709093.1709094openalex-snapshot
Semantic foundations for typed assembly languages
inferred← citeshttps://doi.org/10.1145/3110283openalex-snapshot
Theorems for free for free: parametricity, with and without types
inferred← citeshttps://doi.org/10.1145/337244.337261openalex-snapshot
Behavioral equivalence in the polymorphic pi-calculus
inferred← citeshttps://doi.org/10.1145/3408981openalex-snapshot
Effect handlers, evidently
inferred← citeshttps://doi.org/10.1145/3539657openalex-snapshot
Two Parametricities Versus Three Universal Types
inferred← citeshttps://doi.org/10.1145/3607832openalex-snapshot
Special Delivery: Programming with Mailbox Types
inferred← citeshttps://doi.org/10.1145/3661814.3662099openalex-snapshot
Bialgebraic Reasoning on Higher-order Program Equivalence
inferred← citeshttps://doi.org/10.1145/3765737openalex-snapshot
Fully Abstract Normal Form Bisimulation for Call-by-Value PCF
inferred← citeshttps://doi.org/10.1145/3828686openalex-snapshot
Bimodels and Biorthogonality for Abstract Machines
inferred← citeshttps://doi.org/10.1145/888251.888274openalex-snapshot
Generativity and dynamic opacity for abstract types
inferred← citeshttps://doi.org/10.1145/964001.964015openalex-snapshot
A bisimulation for dynamic sealing
inferred← citeshttps://doi.org/10.1145/982962.964015openalex-snapshot
A bisimulation for dynamic sealing
inferred← citeshttps://doi.org/10.14794/icai.10.2017.211openalex-snapshot
Performance Issues with Implicit Resolution in Scala
inferred← citeshttps://doi.org/10.17077/etd.vibd09toopenalex-snapshot
The semantic analysis of advanced programming languages
inferred← citeshttps://doi.org/10.17760/d20467221openalex-snapshot
Interoperability through realizability: expressing high-level abstractions using low-level code
inferred← citeshttps://doi.org/10.22028/d291-25766openalex-snapshot
Generativity and dynamic opacity for abstract types (extended version)
inferred← citeshttps://doi.org/10.22028/d291-25774openalex-snapshot
Dynamic opacity for abstract types
inferred← citeshttps://doi.org/10.3233/jcs-2003-11403openalex-snapshot
Logical relations for encryption1
inferred← citeshttps://doi.org/10.4204/eptcs.317.5openalex-snapshot
Efficient lambda encodings for Mendler-style coinductive types in Cedille
inferred← citeshttps://doi.org/10.7551/mitpress/1104.001.0001openalex-snapshot
Advanced Topics in Types and Programming Languages
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.