On the public citation graph

An axiomatic approach to binary logical relations with applications to data refinement

https://doi.org/10.1007/bfb0014552
0 signed · 51 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.1007/3-540-44622-2_34openalex-snapshot
Logical Relations and Data Abstraction
inferredcites →https://doi.org/10.1007/3-540-55511-0_1openalex-snapshot
Types, abstraction, and parametric polymorphism, part 2
inferredcites →https://doi.org/10.1007/3-540-56992-8_21openalex-snapshot
Notes on sconing and relators
inferredcites →https://doi.org/10.1007/3-540-58027-1_24openalex-snapshot
A syntax for linear logic
inferredcites →https://doi.org/10.1007/978-1-4612-6315-9_22openalex-snapshot
User-Defined Types and Procedural Data Structures as Complementary Approaches to Data Abstraction
inferredcites →https://doi.org/10.1007/978-1-4757-3851-3openalex-snapshot
Algol-like Languages
inferredcites →https://doi.org/10.1007/978-1-4899-0021-0openalex-snapshot
Toposes, Triples and Theories
inferredcites →https://doi.org/10.1007/978-3-642-93220-5_3openalex-snapshot
Information Processing
inferredcites →https://doi.org/10.1007/bfb0037118openalex-snapshot
A logic for parametric polymorphism
inferredcites →https://doi.org/10.1007/s002360050171openalex-snapshot
Data refinement and algebraic structure
inferredcites →https://doi.org/10.1016/0022-4049(93)90092-8openalex-snapshot
Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads
inferredcites →https://doi.org/10.1016/0022-4049(95)00136-0openalex-snapshot
Lax naturality through enrichment
inferredcites →https://doi.org/10.1016/0304-3975(77)90044-5openalex-snapshot
LCF considered as a programming language
inferredcites →https://doi.org/10.1016/0304-3975(93)90095-bopenalex-snapshot
A type-theoretical alternative to ISWIM, CUCH, OWHY
inferredcites →https://doi.org/10.1016/s0304-3975(00)00340-6openalex-snapshot
Premonoidal categories as categories with algebraic structure
inferredcites →https://doi.org/10.1016/s1571-0661(05)80149-5openalex-snapshot
Continuation Semantics and Self-adjointness
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1993.287606openalex-snapshot
Proceedings of 8th Annual IEEE Symposium on Logic in Computer Science
inferredcites →https://doi.org/10.1109/lics.1994.316053openalex-snapshot
Reflexive graphs and parametric polymorphism
inferredcites →https://doi.org/10.1145/210346.210425openalex-snapshot
Parametricity and local variables
inferredcites →https://doi.org/10.1145/512644.512669openalex-snapshot
Representation independence and data abstraction
inferredcites →https://doi.org/10.7146/dpb.v22i462.6935openalex-snapshot
Fibrations, Logical Predicates and Indeterminates

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2001.2927openalex-snapshot
Objects and Classes in Algol-Like Languages
inferred← citeshttps://doi.org/10.1006/inco.2002.3115openalex-snapshot
Prelogical Relations
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_41openalex-snapshot
A Unifying Approach to Data-Independence
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_34openalex-snapshot
Logical Relations and Data Abstraction
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_10openalex-snapshot
Abstraction Barrier-Observing Relational Parametricity
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_9openalex-snapshot
Lax Logical Relations
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_70openalex-snapshot
Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_11openalex-snapshot
Constructive Data Refinement in Typed Lambda Calculus
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-46674-6_14openalex-snapshot
Logical Relations in Circuit Verification
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_37openalex-snapshot
Specification Refinement with System F
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_38openalex-snapshot
Pre-logical Relations
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_39openalex-snapshot
Data-Refinement for Call-By-Value Programming Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_70openalex-snapshot
A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems
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/978-3-662-49630-5_1openalex-snapshot
Comprehensive Parametric Polymorphism: Categorical Models and Type Theory
inferred← citeshttps://doi.org/10.1007/bfb0028027openalex-snapshot
Categories with algebraic structure
inferred← citeshttps://doi.org/10.1007/s002360050171openalex-snapshot
Data refinement and algebraic structure
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.064openalex-snapshot
Category Theoretic Models of Data Refinement
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.12.081openalex-snapshot
Axiomatics for Data Refinement in Call by Value Programming Languages
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.02.008openalex-snapshot
Logical Relations and Parametricity – A Reynolds Programme for Category Theory and Programming Languages
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)93115-9openalex-snapshot
Prelogical Relations
inferred← citeshttps://doi.org/10.1016/s1570-7954(00)80027-3openalex-snapshot
Some aspects of categories in computer science
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80158-6openalex-snapshot
Sketches Dedicated to Michael Barr on the occasion of his 60th birthday
inferred← citeshttps://doi.org/10.1109/ismvl.2009.57openalex-snapshot
Multi-valued Modal Fixed Point Logics for Model Checking
inferred← citeshttps://doi.org/10.1109/lics.2004.1319618openalex-snapshot
Parametric limits
inferred← citeshttps://doi.org/10.1145/351268.351271openalex-snapshot
Logical relations, data abstraction, and structured fibrations
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.2036openalex-snapshot
Multi-Valued Modal Fixed Point Logics for Model Checking
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.