On the public citation graph
Declarative continuations: An investigation of duality in programming language semantics
0 signed · 67 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.1007/3-540-18508-9_24openalex-snapshot
A typed lambda calculus with categorical type constructors
inferredcites →https://doi.org/10.1007/978-1-4612-0317-9openalex-snapshot
Categorical Combinators, Sequential Algorithms, and Functional Programming
inferredcites →https://doi.org/10.1016/0004-3702(77)90033-9openalex-snapshot
Viewing control structures as patterns of passing messages
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot
Fiftieth volume of theoretical computer science
inferredcites →https://doi.org/10.1016/0304-3975(88)90074-6openalex-snapshot
The linear abstract machine
inferredcites →https://doi.org/10.1016/0304-3975(88)90100-4openalex-snapshot
The linear abstract machine
inferredcites →https://doi.org/10.1016/0304-3975(90)90165-eopenalex-snapshot
A note on inconsistencies caused by fixpoints in a cartesian closed category
inferredcites →https://doi.org/10.1037/023077openalex-snapshot
Artificial Intelligence: An MIT Perspective.
inferredcites →https://doi.org/10.1112/blms/19.2.190openalex-snapshot
INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7)
inferredcites →https://doi.org/10.1145/15042.15043openalex-snapshot
Revised 3 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/290229.290234openalex-snapshot
Revised 5 report on the algorithmic language scheme
inferredcites →https://doi.org/10.2307/2274784openalex-snapshot
Introduction to Higher Order Categorical Logic.
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-45315-6_16openalex-snapshot
Axioms for Recursion in Call-by-Value
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_34openalex-snapshot
Duality between Call-by-Name Recursion and Call-by-Value Iteration
inferred← citeshttps://doi.org/10.1007/3540543961_24openalex-snapshot
For a better support of static data flow
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_1openalex-snapshot
The Vanilla Sequent Calculus is Call-by-Value
inferred← citeshttps://doi.org/10.1007/978-3-540-24725-8_20openalex-snapshot
Answer Type Polymorphism in Call-by-Name Continuation Passing
inferred← citeshttps://doi.org/10.1007/978-3-540-24754-8_17openalex-snapshot
Semantics of Linear Continuation-Passing in Call-by-Name
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_17openalex-snapshot
A Substructural Type System for Delimited Continuations
inferred← citeshttps://doi.org/10.1007/978-3-642-02716-1_22openalex-snapshot
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
inferred← citeshttps://doi.org/10.1007/bfb0014560openalex-snapshot
Environments, continuation semantics and indexed categories
inferred← citeshttps://doi.org/10.1007/s10990-007-9006-0openalex-snapshot
A type-theoretic foundation of delimited continuations
inferred← citeshttps://doi.org/10.1016/j.ic.2003.08.001openalex-snapshot
On the call-by-value CPS transform and its semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.04.009openalex-snapshot
Investigations on the Dual Calculus
inferred← citeshttps://doi.org/10.1016/s0049-237x(06)80007-8openalex-snapshot
Classical logic and control operators
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80149-5openalex-snapshot
Continuation Semantics and Self-adjointness
inferred← citeshttps://doi.org/10.1017/s095679680000085xopenalex-snapshot
Typing first-class continuations in ML
inferred← citeshttps://doi.org/10.1023/a:1010068800499openalex-snapshot
Using a Continuation Twice and Its Implications for the Expressive Power of call/cc
inferred← citeshttps://doi.org/10.1023/a:1020895213317openalex-snapshot
Axioms for Recursion in Call-by-Value
inferred← citeshttps://doi.org/10.1093/logcom/14.4.529openalex-snapshot
A Formulae-as-Types Interpretation of Subtractive Logic
inferred← citeshttps://doi.org/10.1093/oso/9780199204373.003.0004openalex-snapshot
Linguistic Side Effects
inferred← citeshttps://doi.org/10.1109/iscit.2010.5664903openalex-snapshot
A simple abstract machine for functional first-class continuations
inferred← citeshttps://doi.org/10.1109/lics.2005.44openalex-snapshot
Relational Parametricity and Control
inferred← citeshttps://doi.org/10.1145/1291151.1291166openalex-snapshot
Relating complexity and precision in control flow analysis
inferred← citeshttps://doi.org/10.1145/1291220.1291166openalex-snapshot
Relating complexity and precision in control flow analysis
inferred← citeshttps://doi.org/10.1145/158511.158613openalex-snapshot
Separating stages in the continuation-passing style transformation
inferred← citeshttps://doi.org/10.1145/263699.263708openalex-snapshot
Rolling your own mutable ADT---a connection between linear types and monads
inferred← citeshttps://doi.org/10.1145/3434290openalex-snapshot
A computational interpretation of compact closed categories: reversible programming with negative and fractional types
inferred← citeshttps://doi.org/10.1145/3661814.3662091openalex-snapshot
The Relational Machine Calculus
inferred← citeshttps://doi.org/10.1145/96709.96714openalex-snapshot
A formulae-as-type notion of control
inferred← citeshttps://doi.org/10.1145/99583.99608openalex-snapshot
Typing first-class continuations in ML
inferred← citeshttps://doi.org/10.17077/etd.vibd09toopenalex-snapshot
The semantic analysis of advanced programming languages
inferred← citeshttps://doi.org/10.17706//jsw.10.10.1148-1159openalex-snapshot
Simplification of Abstract Machine for Functional Language and Its Theoretical Investigation
inferred← citeshttps://doi.org/10.2168/lmcs-2(3:3)2006openalex-snapshot
Relational Parametricity and Control
inferred← citeshttps://doi.org/10.23638/lmcs-13(3:27)2017openalex-snapshot
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation
inferred← citeshttps://doi.org/10.25911/5d5fcc3a4db33openalex-snapshot
Proof theory and proof search of bi-intuitionistic and tense logic
inferred← citeshttps://doi.org/10.4171/prims/185openalex-snapshot
Dialogue Categories and Chiralities
inferred← citeshttps://doi.org/10.48550/arxiv.2001.06138openalex-snapshot
Sequent calculi for a unity of logic
inferred← citeshttps://doi.org/10.48550/arxiv.2012.14474openalex-snapshot
Paraconsistent Foundations for Probabilistic Reasoning, Programming and Concept Formation
inferred← citeshttps://doi.org/10.48550/arxiv.2101.12607openalex-snapshot
A Symmetric Lambda-Calculus Corresponding to the Negation-Free Bilateral Natural Deduction
inferred← citeshttps://doi.org/10.70675/2c642f3ez5d8ez478dzad2fz8edf887cbc10openalex-snapshot
The monitoring power of forcing transformations
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.