On the public citation graph

Bimodels and Biorthogonality for Abstract Machines

https://doi.org/10.1145/3828686
0 signed · 55 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.1994.1093openalex-snapshot
A Syntactic Approach to Type Soundness
inferredcites →https://doi.org/10.1006/inco.1996.0061openalex-snapshot
From Operational Semantics to Domain Theory
inferredcites →https://doi.org/10.1007/11417170_20openalex-snapshot
Reducibility and ⊤ ⊤-Lifting for Computation Types
inferredcites →https://doi.org/10.1007/11431664_4openalex-snapshot
A Rational Deconstruction of Landin’s SECD Machine
inferredcites →https://doi.org/10.1007/11538363_8openalex-snapshot
A Semantic Formulation of ⊤ ⊤-Lifting and Logical Predicates for Computational Metalanguage
inferredcites →https://doi.org/10.1007/3-540-48959-2_17openalex-snapshot
Call-by-Push-Value: A Subsuming Paradigm
inferredcites →https://doi.org/10.1007/978-3-540-87531-4_21openalex-snapshot
A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators
inferredcites →https://doi.org/10.1007/978-3-642-04027-6_30openalex-snapshot
Focalisation and Classical Realisability
inferredcites →https://doi.org/10.1007/978-3-642-15240-5_13openalex-snapshot
The Duality of Computation under Focus
inferredcites →https://doi.org/10.1007/978-94-007-0954-6openalex-snapshot
Call-By-Push-Value
inferredcites →https://doi.org/10.1007/bfb0055063openalex-snapshot
Existential types: Logical relations and operational equivalence
inferredcites →https://doi.org/10.1007/s001530000057openalex-snapshot
Typed lambda-calculus in classical Zermelo-Frænkel set theory
inferredcites →https://doi.org/10.1007/s10990-006-0480-6openalex-snapshot
Call-by-push-value: Decomposing call-by-value and call-by-name
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(87)90045-4openalex-snapshot
Linear logic
inferredcites →https://doi.org/10.1016/0304-3975(91)90230-yopenalex-snapshot
An abstract framework for environment machines
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/j.entcs.2016.06.013openalex-snapshot
Proving Correctness of a Compiler Using Step-indexed Logical Relations
inferredcites →https://doi.org/10.1016/j.ic.2012.10.014openalex-snapshot
Relating computational effects by ⊤⊤-lifting
inferredcites →https://doi.org/10.1016/j.jlamp.2019.100512openalex-snapshot
Abstracting models of strong normalization for classical calculi
inferredcites →https://doi.org/10.1016/j.jlap.2004.03.009openalex-snapshot
The origins of structural operational semantics
inferredcites →https://doi.org/10.1016/j.jlap.2004.05.001openalex-snapshot
A structural approach to operational semantics
inferredcites →https://doi.org/10.1016/s0049-237x(08)71948-7openalex-snapshot
Processes: A Mathematical Model of Computing Agents
inferredcites →https://doi.org/10.1016/s0167-739x(99)00088-6openalex-snapshot
Abstract machines for programming language implementation
inferredcites →https://doi.org/10.1016/s1571-0661(04)80568-1openalex-snapshot
Adjunction Models For Call-By-Push-Value With Stacks
inferredcites →https://doi.org/10.1017/cbo9780511526619.007openalex-snapshot
Operationally-Based Theories of Program Equivalence
inferredcites →https://doi.org/10.1017/cbo9780511792588.006openalex-snapshot
Howe's method for higher-order languages
inferredcites →https://doi.org/10.1017/cbo9781316576892openalex-snapshot
Practical Foundations for Programming Languages
inferredcites →https://doi.org/10.1017/s0956796800000125openalex-snapshot
Equivalence in functional languages with effects
inferredcites →https://doi.org/10.1017/s0956796821000125openalex-snapshot
Gradual type theory
inferredcites →https://doi.org/10.1017/s0956796898003141openalex-snapshot
Classical logic, continuation semantics and abstract machines
inferredcites →https://doi.org/10.1017/s0960129500003054openalex-snapshot
[top ][top ]-closed relations and admissibility
inferredcites →https://doi.org/10.1017/s0960129500003066openalex-snapshot
Parametric polymorphism and operational equivalence
inferredcites →https://doi.org/10.1023/a:1010026413531openalex-snapshot
Continuations: A Mathematical Semantics for Handling Full Jumps
inferredcites →https://doi.org/10.1023/a:1010027404223openalex-snapshot
Definitional Interpreters for Higher-Order Programming Languages
inferredcites →https://doi.org/10.1093/comjnlopenalex-snapshot
Design And Evaluation Of A Distributed Clustering Algorithm For Mobile Ad Hoc Networks
inferredcites →https://doi.org/10.1109/lics.1996.561301openalex-snapshot
A fully abstract domain model for the π-calculus
inferredcites →https://doi.org/10.1109/lics.2005.42openalex-snapshot
Recursive Polymorphic Types and Parametricity in an Operational Framework
inferredcites →https://doi.org/10.1109/lics65433.2025.00061openalex-snapshot
Logical relations for call-by-push-value models, via internal fibrations in a 2-category
inferredcites →https://doi.org/10.1145/1481861.1481864openalex-snapshot
Compiling functional types to relational specifications for low level imperative code
inferredcites →https://doi.org/10.1145/1596550.1596567openalex-snapshot
Biorthogonality, step-indexing and compiler correctness
inferredcites →https://doi.org/10.1145/1863543.1863553openalex-snapshot
Abstracting abstract machines
inferredcites →https://doi.org/10.1145/1926385.1926402openalex-snapshot
A kripke logical relation between ML and assembly
inferredcites →https://doi.org/10.1145/2837614.2837638openalex-snapshot
Type theory in type theory using quotient inductive types
inferredcites →https://doi.org/10.1145/3290328openalex-snapshot
Gradual type theory
inferredcites →https://doi.org/10.1145/3704871openalex-snapshot
Abstract Operational Methods for Call-by-Push-Value
inferredcites →https://doi.org/10.1145/3720424openalex-snapshot
Denotational Foundations for Expected Cost Analysis
inferredcites →https://doi.org/10.1145/3720434openalex-snapshot
Notions of Stack-Manipulating Computation and Relative Monads
inferredcites →https://doi.org/10.1145/3720457openalex-snapshot
Adequacy for Algebraic Effects Revisited
inferredcites →https://doi.org/10.1145/888251.888254openalex-snapshot
A functional correspondence between evaluators and abstract machines
inferredcites →https://doi.org/10.1145/964001.964006openalex-snapshot
Semantic types
inferredcites →https://doi.org/10.48456/tr-948openalex-snapshot
Reasoning about effectful programs and evaluation order
inferredcites →https://doi.org/10.70930/tac/e17sf9pcopenalex-snapshot
Adjunction Models For Call-By-Push-Value With Stacks
inferredcites →https://doi.org/10.7551/mitpress/1104.003.0011openalex-snapshot
Typed Operational Reasoning

What points at this work

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

inferred← backgroundhttps://doi.org/10.5281/zenodo.21490016zenodo-depositor-declared
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.