On the public citation graph
Temporal Verification with Answer-Effect Modification: Dependent Temporal Type-and-Effect System with Delimited Continuations
0 signed · 61 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.1006/inco.1996.0061openalex-snapshot
From Operational Semantics to Domain Theory
inferredcites →https://doi.org/10.1006/inco.1996.2613openalex-snapshot
Region-Based Memory Management
inferredcites →https://doi.org/10.1007/11417170_16openalex-snapshot
On the Degeneracy of Σ-Types in Presence of Computational Classical Logic
inferredcites →https://doi.org/10.1007/978-3-030-32304-2_20openalex-snapshot
Temporal Verification of Programs via First-Order Fixpoint Logic
inferredcites →https://doi.org/10.1007/978-3-319-19195-9_1openalex-snapshot
Types for Deadlock-Free Higher-Order Programs
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_4openalex-snapshot
Fairness Modulo Theory: A New Approach to LTL Software Model Checking
inferredcites →https://doi.org/10.1007/978-3-319-99725-4_24openalex-snapshot
Abstract Interpretation of CTL Properties
inferredcites →https://doi.org/10.1007/978-3-540-30477-7_8openalex-snapshot
History Effects and Verification
inferredcites →https://doi.org/10.1007/978-3-540-78969-7_18openalex-snapshot
Typed Dynamic Control Operators for Delimited Continuations
inferredcites →https://doi.org/10.1007/978-3-642-00590-9_7openalex-snapshot
Handlers of Algebraic Effects
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_19openalex-snapshot
A Classical Realizability Model for a Semantical Value Restriction
inferredcites →https://doi.org/10.1007/978-3-662-54434-1_29openalex-snapshot
A Classical Sequent Calculus with Dependent Types
inferredcites →https://doi.org/10.1016/0022-0000(78)90014-4openalex-snapshot
A theory of type polymorphism in programming
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/j.ic.2009.06.007openalex-snapshot
Typing termination in a higher-order concurrent imperative language
inferredcites →https://doi.org/10.1016/s1571-0661(05)80685-1openalex-snapshot
Parametric Polymorphism and Operational Equivalence (Preliminary Version)
inferredcites →https://doi.org/10.1109/lics.2009.29openalex-snapshot
A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes
inferredcites →https://doi.org/10.1109/lics.2012.47openalex-snapshot
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
inferredcites →https://doi.org/10.1145/1111542.1111550openalex-snapshot
Resource usage analysis for a functional language with exceptions
inferredcites →https://doi.org/10.1145/1159803.1159812openalex-snapshot
Polymorphism and separation in hoare type theory
inferredcites →https://doi.org/10.1145/1481861.1481868openalex-snapshot
A generic type-and-effect system
inferredcites →https://doi.org/10.1145/1599410.1599445openalex-snapshot
Dependent type inference with interpolants
inferredcites →https://doi.org/10.1145/1639950.1640073openalex-snapshot
Typestate-oriented programming
inferredcites →https://doi.org/10.1145/1890028.1890031openalex-snapshot
Refinement types for secure implementations
inferredcites →https://doi.org/10.1145/2034773.2034786openalex-snapshot
Subtyping delimited continuations
inferredcites →https://doi.org/10.1145/224164.224173openalex-snapshot
A generalization of exceptions and control in ML-like languages
inferredcites →https://doi.org/10.1145/2603088.2603127openalex-snapshot
Abstract interpretation from Büchi automata
inferredcites →https://doi.org/10.1145/2837614.2837655openalex-snapshot
Dependent types and multi-monadic effects in F*
inferredcites →https://doi.org/10.1145/2837614.2837667openalex-snapshot
Temporal verification of higher-order functional programs
inferredcites →https://doi.org/10.1145/3060257openalex-snapshot
Verifying Increasingly Expressive Temporal Logics for Infinite-State Systems
inferredcites →https://doi.org/10.1145/3110257openalex-snapshot
On the expressive power of user-defined effects: effect handlers, monadic reflection, delimited control
inferredcites →https://doi.org/10.1145/3209108.3209204openalex-snapshot
A Fixpoint Logic and Dependent Effects for Temporal Property Verification
inferredcites →https://doi.org/10.1145/3236764openalex-snapshot
Handling delimited continuations with dependent types
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferredcites →https://doi.org/10.1145/3450272openalex-snapshot
Polymorphic Iterable Sequential Effect Systems
inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot
Automatic verification of finite state concurrent system using temporal logic specifications
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.13openalex-snapshot
A Generic Approach to Flow-Sensitive Polymorphic Effects
inferredcites →https://doi.org/10.4230/lipics.ecoop.2020.23openalex-snapshot
Lifting Sequential Effects to Control Operators
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-99536-1_11openalex-snapshot
Infinitary Refinement Types for Temporal Properties in Scott Domains
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_15openalex-snapshot
A Category-Theoretic Framework for Dependent Effect Systems
inferred← citeshttps://doi.org/10.1145/3632929openalex-snapshot
On Model-Checking Higher-Order Effectful Programs
inferred← citeshttps://doi.org/10.1145/3633280openalex-snapshot
Answer Refinement Modification: Refinement Type System for Algebraic Effects and Handlers
inferred← citeshttps://doi.org/10.1145/3656393openalex-snapshot
Associated Effects: Flexible Abstractions for Effectful Programming
inferred← citeshttps://doi.org/10.1145/3656433openalex-snapshot
A HAT Trick: Automatically Verifying Representation Invariants using Symbolic Finite Automata
inferred← citeshttps://doi.org/10.1145/3674641openalex-snapshot
Abstracting Effect Systems for Algebraic Effect Handlers
inferred← citeshttps://doi.org/10.1145/3674656openalex-snapshot
Specification and Verification for Unrestricted Algebraic Effects and Handling
inferred← citeshttps://doi.org/10.1145/3689805openalex-snapshot
Higher-Order Model Checking of Effect-Handling Programs with Answer-Type Modification
inferred← citeshttps://doi.org/10.1145/3704914openalex-snapshot
Algebraic Temporal Effects: Temporal Verification of Recursively Typed Higher-Order Programs
inferred← citeshttps://doi.org/10.1145/3729333openalex-snapshot
Thrust: A Prophecy-Based Refinement Type System for Rust
inferred← citeshttps://doi.org/10.1145/3763140openalex-snapshot
Abstract Interpretation of Temporal Safety Effects of Higher Order Programs
inferred← citeshttps://doi.org/10.1145/3763184openalex-snapshot
On Higher-Order Model Checking of Effectful Answer-Type-Polymorphic Programs
inferred← citeshttps://doi.org/10.1145/3808264openalex-snapshot
Trace-Guided Synthesis of Effectful Test Generators
inferred← citeshttps://doi.org/10.1145/3840563.3843706openalex-snapshot
Effect Systems as Abstract Interpretations
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.