On the public citation graph
Reasoning about programs in continuation-passing style
0 signed · 294 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-15648-8_17openalex-snapshot
Continuation semantics in typed lambda-calculi
inferredcites →https://doi.org/10.1007/3-540-54317-1_103openalex-snapshot
A simplifier for untyped lambda expressions
inferredcites →https://doi.org/10.1007/3-540-55511-0_15openalex-snapshot
Correctness of procedure representations in higher-order assembly language
inferredcites →https://doi.org/10.1007/978-3-642-46490-4_23openalex-snapshot
Programming with Continuations
inferredcites →https://doi.org/10.1007/bf00263194openalex-snapshot
A denotational framework for data flow analysis
inferredcites →https://doi.org/10.1016/0096-0551(86)90007-xopenalex-snapshot
Obtaining coroutines with continuations
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(87)90109-5openalex-snapshot
A syntactic theory of sequential control
inferredcites →https://doi.org/10.1016/0304-3975(89)90069-8openalex-snapshot
A syntactic theory of sequential state
inferredcites →https://doi.org/10.1016/0304-3975(92)90014-7openalex-snapshot
The revised report on the syntactic theories of sequential control and state
inferredcites →https://doi.org/10.1016/0304-3975(92)90169-gopenalex-snapshot
A theory for program and data type specification
inferredcites →https://doi.org/10.1016/s0019-9958(71)90355-xopenalex-snapshot
Proving algorithms by tail functions
inferredcites →https://doi.org/10.1017/cbo9780511609619openalex-snapshot
Compiling with Continuations
inferredcites →https://doi.org/10.1017/cbo9781139171892openalex-snapshot
A Practical Introduction to Denotational Semantics
inferredcites →https://doi.org/10.1017/s0956796800000125openalex-snapshot
Equivalence in functional languages with effects
inferredcites →https://doi.org/10.1017/s0960129500001535openalex-snapshot
Representing Control: a Study of the CPS Transformation
inferredcites →https://doi.org/10.1093/comjnl/6.4.308openalex-snapshot
The Mechanical Evaluation of Expressions
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1145/141471.141483openalex-snapshot
Improving binding times without explicit CPS-conversion
inferredcites →https://doi.org/10.1145/141471.141563openalex-snapshot
Reasoning about programs in continuation-passing style.
inferredcites →https://doi.org/10.1145/141478.141483openalex-snapshot
Improving binding times without explicit CPS-conversion
inferredcites →https://doi.org/10.1145/141478.141563openalex-snapshot
Reasoning about programs in continuation-passing style.
inferredcites →https://doi.org/10.1145/15022.15026openalex-snapshot
On some extensions of syntactic error recovery technique based on phrase markers
inferredcites →https://doi.org/10.1145/15042.15043openalex-snapshot
Revised 3 report on the algorithmic language scheme
inferredcites →https://doi.org/10.1145/155090.155113openalex-snapshot
The essence of compiling with continuations
inferredcites →https://doi.org/10.1145/319838.319852openalex-snapshot
The implementation of PC Scheme
inferredcites →https://doi.org/10.1145/62678.62684openalex-snapshot
Abstract continuations: a mathematical semantics for handling full jumps
inferredcites →https://doi.org/10.1145/73560.73576openalex-snapshot
The theory and practice of first-class prompts
inferredcites →https://doi.org/10.1145/75277.75302openalex-snapshot
Realistic compilation by program transformation (detailed summary)
inferredcites →https://doi.org/10.1145/75277.75303openalex-snapshot
Continuation-passing, closure-passing style
inferredcites →https://doi.org/10.1145/800194.805852openalex-snapshot
Definitional interpreters for higher-order programming languages
inferredcites →https://doi.org/10.1145/91556.91626openalex-snapshot
Reasoning with continuations II: full abstraction for models of control
inferredcites →https://doi.org/10.1145/93542.93554openalex-snapshot
Representing control in the presence of first-class continuations
inferredcites →https://doi.org/10.1145/96709.96714openalex-snapshot
A formulae-as-type notion of control
inferredcites →https://doi.org/10.1145/99583.99616openalex-snapshot
Parameter-passing and the lambda calculus
inferredcites →https://doi.org/10.21236/ada326084openalex-snapshot
A Simplifier for Untyped Lambda Expressions,
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.1996.0041openalex-snapshot
The Barendregt Cube with Definitions and Generalised Reduction
inferred← citeshttps://doi.org/10.1006/inco.1996.2622openalex-snapshot
Strong Normalization from Weak Normalization in Typedλ-Calculi
inferred← citeshttps://doi.org/10.1006/inco.2001.2947openalex-snapshot
Completeness of Continuation Models for λμ-Calculus
inferred← citeshttps://doi.org/10.1007/11417170_15openalex-snapshot
Galois Embedding from Polymorphic Types into Existential Types
inferred← citeshttps://doi.org/10.1007/11737414_16openalex-snapshot
Contracts as Pairs of Projections
inferred← citeshttps://doi.org/10.1007/11780342_19openalex-snapshot
LJQ: A Strongly Focused Calculus for Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/3-540-45587-6_5openalex-snapshot
Compiler Construction in Higher Order Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-45789-5_20openalex-snapshot
Guaranteed Optimization: Proving Nullspace Properties of Compilers
inferred← citeshttps://doi.org/10.1007/3-540-45927-8_10openalex-snapshot
Exceptions, Continuations and Macro-expressiveness
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_8openalex-snapshot
A First-Order One-Pass CPS Transformation
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_16openalex-snapshot
Sharing Continuations: Proofnets for Languages with Explicit Control
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_20openalex-snapshot
A Curry-Howard Isomorphism for Compilation and Program Execution
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_31openalex-snapshot
On the transformation between direct and continuation semantics
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_231openalex-snapshot
Non-speculative and upward invocation of continuations in a parallel language
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_46openalex-snapshot
Call-by-name CPS-translation as a binding-time improvement
inferred← citeshttps://doi.org/10.1007/3-540-62688-3_45openalex-snapshot
Names, equations, relations: Practical ways to reason about new
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_4openalex-snapshot
Roles, Stacks, Histories: A Triple for Hoare
inferred← citeshttps://doi.org/10.1007/978-3-030-02928-9_2openalex-snapshot
An Illustrated Guide to the Model Theory of Supertype Abstraction and Behavioral Subtyping
inferred← citeshttps://doi.org/10.1007/978-3-030-03427-6_25openalex-snapshot
Temporal Properties of Smart Contracts
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_20openalex-snapshot
Incremental $$\lambda $$ -Calculus in Cache-Transfer Style
inferred← citeshttps://doi.org/10.1007/978-3-030-78142-2_4openalex-snapshot
Relating Functional and Imperative Session Types
inferred← citeshttps://doi.org/10.1007/978-3-319-22102-1_23openalex-snapshot
A Linear First-Order Functional Intermediate Language for Verified Compilers
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_15openalex-snapshot
Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less)
inferred← citeshttps://doi.org/10.1007/978-3-319-47958-3_10openalex-snapshot
A Sound and Complete Bisimulation for Contextual Equivalence in $$\lambda $$ -Calculus with Call/cc
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_34openalex-snapshot
Axioms for Delimited Continuations in the CPS Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_15openalex-snapshot
Call-by-Value Is Dual to Call-by-Name – Reloaded
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_28openalex-snapshot
Call-by-Value Is Dual to Call-by-Name, Extended
inferred← citeshttps://doi.org/10.1007/978-3-642-00722-4_19openalex-snapshot
How to CPS Transform a Monad
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_12openalex-snapshot
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_24openalex-snapshot
Towards a Canonical Classical Natural Deduction System
inferred← citeshttps://doi.org/10.1007/978-3-642-19718-5_14openalex-snapshot
Typing Local Control and State Using Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-21691-6_6openalex-snapshot
Classical Call-by-Need and Duality
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_21openalex-snapshot
A Call-by-Name CPS Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_4openalex-snapshot
Call-by-Value Solvability, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-40355-2_19openalex-snapshot
Beautiful Imperative Code
inferred← citeshttps://doi.org/10.1007/978-3-642-59048-1_9openalex-snapshot
Proofs, Lambda Terms and Control Operators
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_17openalex-snapshot
Needle & Knot: Binder Boilerplate Tied Up
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_15openalex-snapshot
Probabilistic Termination by Monadic Affine Sized Typing
inferred← citeshttps://doi.org/10.1007/bfb0014551openalex-snapshot
Sound specialization in the presence of computational effects
inferred← citeshttps://doi.org/10.1007/bfb0023055openalex-snapshot
The semantics of pcall and fork in the presence of first-class continuations and side-effects
inferred← citeshttps://doi.org/10.1007/bfb0030637openalex-snapshot
A syntactic theory of dynamic binding
inferred← citeshttps://doi.org/10.1007/bfb0052377openalex-snapshot
Higher-order rewriting and partial evaluation
inferred← citeshttps://doi.org/10.1007/s00236-009-0112-9openalex-snapshot
On the observational theory of the CPS-calculus
inferred← citeshttps://doi.org/10.1007/s10990-007-9006-0openalex-snapshot
A type-theoretic foundation of delimited continuations
inferred← citeshttps://doi.org/10.1007/s10990-007-9007-zopenalex-snapshot
A proof-theoretic foundation of abortive continuations
inferred← citeshttps://doi.org/10.1007/s10990-007-9009-xopenalex-snapshot
Axioms for control operators in the CPS hierarchy
inferred← citeshttps://doi.org/10.1007/s10990-007-9010-4openalex-snapshot
A static simulation of dynamic delimited control
inferred← citeshttps://doi.org/10.1016/0304-3975(96)80134-4openalex-snapshot
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
inferred← citeshttps://doi.org/10.1016/j.apal.2012.05.008openalex-snapshot
Towards a canonical classical natural deduction system
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.011openalex-snapshot
Combining control effects and their models: Game semantics for a hierarchy of static, dynamic and delimited control effects
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.016openalex-snapshot
On the Observational Theory of the CPS-calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.02.018openalex-snapshot
Idioms are Oblivious, Arrows are Meticulous, Monads are Promiscuous
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.10.004openalex-snapshot
Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-Calculus
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.ic.2008.03.026openalex-snapshot
A rewriting logic approach to operational semantics
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.02.002openalex-snapshot
CPS transformation of beta-redexes
inferred← citeshttps://doi.org/10.1016/j.scico.2023.103015openalex-snapshot
Generating C: Heterogeneous metaprogramming system description
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.049openalex-snapshot
A note on preservation of strong normalisation in the λ -calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.009openalex-snapshot
Refactoring and representation independence for class hierarchies
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00733-8openalex-snapshot
A first-order one-pass CPS transformation
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00358-2openalex-snapshot
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00022-2openalex-snapshot
Call-by-name, Call-by-value, Call-by-need, and the Linear Lambda Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00272-5openalex-snapshot
The Simple Type Theory of Normalisation by Evaluation
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00297-xopenalex-snapshot
Syntactic Theories in Practice
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80568-1openalex-snapshot
Adjunction Models For Call-By-Push-Value With Stacks
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80243-9openalex-snapshot
Reasoning about Programs With Effects
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80281-6openalex-snapshot
On proving syntactic properties of CPS programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82538-1openalex-snapshot
Plan in Maude Specifying an Active Network Programming Language
inferred← citeshttps://doi.org/10.1017/s0956796800001581openalex-snapshot
Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis †
inferred← citeshttps://doi.org/10.1017/s0956796801004221openalex-snapshot
CPS in little pieces: composing partial continuations
inferred← citeshttps://doi.org/10.1017/s0956796807006387openalex-snapshot
On one-pass CPS transformations
inferred← citeshttps://doi.org/10.1017/s0956796807006399openalex-snapshot
A type system with usage aspects
inferred← citeshttps://doi.org/10.1017/s0956796810000134openalex-snapshot
Roles, stacks, histories: A triple for Hoare
inferred← citeshttps://doi.org/10.1017/s095679681700003xopenalex-snapshot
Call-by-name extensionality and confluence
inferred← citeshttps://doi.org/10.1017/s0956796822000168openalex-snapshot
Classical (co)recursion: Mechanics
inferred← citeshttps://doi.org/10.1017/s0956796899003469openalex-snapshot
Combinators for program generation
inferred← citeshttps://doi.org/10.1017/s0960129500001195openalex-snapshot
Sound and complete axiomatisations of call-by-value control operators
inferred← citeshttps://doi.org/10.1017/s0960129521000487openalex-snapshot
Two decades of automatic amortized resource analysis
inferred← citeshttps://doi.org/10.1017/s0960129597002405openalex-snapshot
A computational formalization for partial evaluation
inferred← citeshttps://doi.org/10.1017/s0960129599002881openalex-snapshot
From λ to π; or, Rediscovering continuations
inferred← citeshttps://doi.org/10.1023/a:1010000206149openalex-snapshot
CPS Translations and Applications: The Cube and Beyond
inferred← citeshttps://doi.org/10.1023/a:1010012532463openalex-snapshot
Retraction Approach to CPS Transform
inferred← citeshttps://doi.org/10.1023/a:1010087314987openalex-snapshot
A Syntactic Theory of Dynamic Binding
inferred← citeshttps://doi.org/10.1023/a:1020843229247openalex-snapshot
Secure Information Flow via Linear Continuations
inferred← citeshttps://doi.org/10.1023/b:ause.0000038936.09009.69openalex-snapshot
Automatically Restructuring Programs for the Web
inferred← citeshttps://doi.org/10.1093/logcom/exm037openalex-snapshot
Call-by-Value -calculus and LJQ
inferred← citeshttps://doi.org/10.1093/oso/9780199204373.003.0004openalex-snapshot
Linguistic Side Effects
inferred← citeshttps://doi.org/10.1109/ase.2001.989807openalex-snapshot
Automatically restructuring programs for the Web
inferred← citeshttps://doi.org/10.1109/ase.2015.59openalex-snapshot
Region and Effect Inference for Safe Parallelism (T)
inferred← citeshttps://doi.org/10.1109/codesisss.2015.7331371openalex-snapshot
Hardware synthesis from a recursive functional language
inferred← citeshttps://doi.org/10.1109/csf.2008.27openalex-snapshot
Refinement Types for Secure Implementations
inferred← citeshttps://doi.org/10.1109/csf.2009.24openalex-snapshot
Achieving Security Despite Compromise Using Zero-knowledge
inferred← citeshttps://doi.org/10.1109/lics.1997.614964openalex-snapshot
Continuation models are universal for λ/sub μ/-calculus
inferred← citeshttps://doi.org/10.1109/lics.2012.47openalex-snapshot
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
inferred← citeshttps://doi.org/10.1109/lics.2019.8785725openalex-snapshot
Type-Based Complexity Analysis of Probabilistic Functional Programs
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470630openalex-snapshot
Strong Call-by-Value is Reasonable, Implosively
inferred← citeshttps://doi.org/10.1145/1016848.1016860openalex-snapshot
A type-theoretic foundation of continuations and prompts
inferred← citeshttps://doi.org/10.1145/1016850.1016860openalex-snapshot
A type-theoretic foundation of continuations and prompts
inferred← citeshttps://doi.org/10.1145/1190215.1190220openalex-snapshot
Operational semantics for multi-language programs
inferred← citeshttps://doi.org/10.1145/1328438.1328484openalex-snapshot
An approach to call-by-name delimited continuations
inferred← citeshttps://doi.org/10.1145/1328438.1328486openalex-snapshot
The design and implementation of typed scheme
inferred← citeshttps://doi.org/10.1145/1328897.1328484openalex-snapshot
An approach to call-by-name delimited continuations
inferred← citeshttps://doi.org/10.1145/1330017.1330018openalex-snapshot
Reverse-mode AD in a functional framework
inferred← citeshttps://doi.org/10.1145/1462179.1462184openalex-snapshot
Proofs, tests and continuation passing style
inferred← citeshttps://doi.org/10.1145/1481861.1481866openalex-snapshot
Secure compilation of a multi-tier web language
inferred← citeshttps://doi.org/10.1145/1498926.1498930openalex-snapshot
Operational semantics for multi-language programs
inferred← citeshttps://doi.org/10.1145/165180.165197openalex-snapshot
Sound rules for parallel evaluation of a functional language callcc
inferred← citeshttps://doi.org/10.1145/1706299.1706350openalex-snapshot
Modular verification of security protocol code by typing
inferred← citeshttps://doi.org/10.1145/174675.176926openalex-snapshot
Manifest types, modules, and separate compilation
inferred← citeshttps://doi.org/10.1145/182409.182483openalex-snapshot
Continuation-based partial evaluation
inferred← citeshttps://doi.org/10.1145/1836089.1836100openalex-snapshot
Equational axiomatization of call-by-name delimited control
inferred← citeshttps://doi.org/10.1145/1890028.1890031openalex-snapshot
Refinement types for secure implementations
inferred← citeshttps://doi.org/10.1145/2039346.2039348openalex-snapshot
On contract satisfaction in a higher-order world
inferred← citeshttps://doi.org/10.1145/224164.224175openalex-snapshot
Unboxed values and polymorphic typing revisited
inferred← citeshttps://doi.org/10.1145/232627.232644openalex-snapshot
The semantics of Scheme with future
inferred← citeshttps://doi.org/10.1145/232629.232644openalex-snapshot
The semantics of Scheme with future
inferred← citeshttps://doi.org/10.1145/2628136.2628147openalex-snapshot
Compositional semantics for composable continuations
inferred← citeshttps://doi.org/10.1145/2629609openalex-snapshot
Foundations of Typestate-Oriented Programming
inferred← citeshttps://doi.org/10.1145/2692915.2628147openalex-snapshot
Compositional semantics for composable continuations
inferred← citeshttps://doi.org/10.1145/2766446openalex-snapshot
Behavioral Subtyping, Specification Inheritance, and Modular Reasoning
inferred← citeshttps://doi.org/10.1145/292540.292560openalex-snapshot
Dependent types in practical programming
inferred← citeshttps://doi.org/10.1145/292540.292564openalex-snapshot
Typed memory management in a calculus of capabilities
inferred← citeshttps://doi.org/10.1145/2935323.2935326openalex-snapshot
Design and GPGPU performance of Futhark's redomap construct
inferred← citeshttps://doi.org/10.1145/2951913.2951918openalex-snapshot
Compact bit encoding schemes for simply-typed lambda-terms
inferred← citeshttps://doi.org/10.1145/3022670.2951918openalex-snapshot
Compact bit encoding schemes for simply-typed lambda-terms
inferred← citeshttps://doi.org/10.1145/3110267openalex-snapshot
No-brainer CPS conversion (functional pearl)
inferred← citeshttps://doi.org/10.1145/3192366.3192375openalex-snapshot
MixT: a language for mixing consistency in geodistributed transactions
inferred← citeshttps://doi.org/10.1145/3209108.3209132openalex-snapshot
Around Classical and Intuitionistic Linear Logics
inferred← citeshttps://doi.org/10.1145/3236782openalex-snapshot
Contextual equivalence for a probabilistic language with continuous random variables and recursion
inferred← citeshttps://doi.org/10.1145/3236950.3236969openalex-snapshot
Lazy Abstraction for Higher-Order Program Verification
inferred← citeshttps://doi.org/10.1145/3290381openalex-snapshot
On library correctness under weak memory consistency: specifying and verifying concurrent libraries under declarative consistency models
inferred← citeshttps://doi.org/10.1145/3293605openalex-snapshot
Probabilistic Termination by Monadic Affine Sized Typing
inferred← citeshttps://doi.org/10.1145/3294032.3294084openalex-snapshot
Extracting a call-by-name partial evaluator from a proof of termination
inferred← citeshttps://doi.org/10.1145/3296979.3192375openalex-snapshot
MixT: a language for mixing consistency in geodistributed transactions
inferred← citeshttps://doi.org/10.1145/3302516.3307345openalex-snapshot
A static slicing method for functional programs and its incremental version
inferred← citeshttps://doi.org/10.1145/3341704openalex-snapshot
Dependently typed Haskell in industry (experience report)
inferred← citeshttps://doi.org/10.1145/3373718.3394778openalex-snapshot
Reconciling noninterference and gradual typing
inferred← citeshttps://doi.org/10.1145/3381898.3397208openalex-snapshot
Garbage collection using a finite liveness domain
inferred← citeshttps://doi.org/10.1145/3428224openalex-snapshot
The anchor verifier for blocking and non-blocking concurrent software
inferred← citeshttps://doi.org/10.1145/3448016.3457272openalex-snapshot
One WITH RECURSIVE is Worth Many GOTOs
inferred← citeshttps://doi.org/10.1145/3460944.3464310openalex-snapshot
Towards size-dependent types for array programming
inferred← citeshttps://doi.org/10.1145/3479394.3479399openalex-snapshot
Reflecting Stacked Continuations in a Fine-Grained Direct-Style Reduction Theory
inferred← citeshttps://doi.org/10.1145/3547652openalex-snapshot
The theory of call-by-value solvability
inferred← citeshttps://doi.org/10.1145/3563342openalex-snapshot
A case for DOT: theoretical foundations for objects with pattern matching and GADT-style reasoning
inferred← citeshttps://doi.org/10.1145/3586056openalex-snapshot
Back to Direct Style: Typed and Tight
inferred← citeshttps://doi.org/10.1145/3607858openalex-snapshot
Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data Types
inferred← citeshttps://doi.org/10.1145/363911.363923openalex-snapshot
Typed memory management via static capabilities
inferred← citeshttps://doi.org/10.1145/3678232.3678241openalex-snapshot
The logical essence of call-by-name CPS translations
inferred← citeshttps://doi.org/10.1145/3832783.3837549openalex-snapshot
MiniPoly: Automatic Extraction of Efficient JavaScript Polyfill from Language Specification
inferred← citeshttps://doi.org/10.1145/581339.581375openalex-snapshot
Advanced control flows for flexible graphical user interfaces
inferred← citeshttps://doi.org/10.1145/888251.888254openalex-snapshot
A functional correspondence between evaluators and abstract machines
inferred← citeshttps://doi.org/10.1145/944705.944722openalex-snapshot
A sound and complete axiomatization of delimited continuations
inferred← citeshttps://doi.org/10.1145/944705.944723openalex-snapshot
Call-by-value is dual to call-by-name
inferred← citeshttps://doi.org/10.1145/944746.944722openalex-snapshot
A sound and complete axiomatization of delimited continuations
inferred← citeshttps://doi.org/10.1145/944746.944723openalex-snapshot
Call-by-value is dual to call-by-name
inferred← citeshttps://doi.org/10.1145/989393.989443openalex-snapshot
The essence of compiling with continuations
inferred← citeshttps://doi.org/10.1184/r1/6622238openalex-snapshot
Featherweight Typestate (CMU-ISR-10-115)
inferred← citeshttps://doi.org/10.1184/r1/6622391openalex-snapshot
Gradual Featherweight Typestate (CMU-ISR-10-116R)
inferred← citeshttps://doi.org/10.14288/1.0401431openalex-snapshot
ANF preserves dependent types up to extensional equality
inferred← citeshttps://doi.org/10.17760/d20398327openalex-snapshot
A semantic foundation for sound gradual typing
inferred← citeshttps://doi.org/10.20868/upm.thesis.47796openalex-snapshot
Hoare-style Reasoning with Higher-order Control : Continuations and Concurrency
inferred← citeshttps://doi.org/10.21236/ada250954openalex-snapshot
Polymorphic Type Assignment and CPS Conversion
inferred← citeshttps://doi.org/10.21236/ada292952openalex-snapshot
The Occurrence of Continuation Parameters in CPS Terms.
inferred← citeshttps://doi.org/10.21236/ada484494openalex-snapshot
Practical Techniques for Language Design and Prototyping
inferred← citeshttps://doi.org/10.2168/lmcs-7(2:3)2011openalex-snapshot
CFA2: a Context-Free Approach to Control-Flow Analysis
inferred← citeshttps://doi.org/10.2197/ipsjdc.3.207openalex-snapshot
Duality between Call-by-value Reductions and Call-by-name Reductions
inferred← citeshttps://doi.org/10.23638/lmcs-16(3:13)2020openalex-snapshot
Compiling With Classical Connectives
inferred← citeshttps://doi.org/10.26686/wgtn.17148098openalex-snapshot
Decidable Subtyping for Path Dependent Types
inferred← citeshttps://doi.org/10.26686/wgtn.17148098.v1openalex-snapshot
Decidable Subtyping for Path Dependent Types
inferred← citeshttps://doi.org/10.3233/978-1-60750-100-8-73openalex-snapshot
Principles and Applications of Refinement Types
showing the first 200 of 251 · page through all 251
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.