On the public citation graph
A Temporal Logic Approach to Binding-Time Analysis
0 signed · 115 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/11561347openalex-snapshot
Generative Programming and Component Engineering
inferredcites →https://doi.org/10.1007/3-540-45413-6_15openalex-snapshot
Normalization by Evaluation for the Computational Lambda-Calculus
inferredcites →https://doi.org/10.1007/3-540-49099-x_13openalex-snapshot
An Idealized MetaML: Simpler, and More Expressive
inferredcites →https://doi.org/10.1007/3-540-58402-1_15openalex-snapshot
Hand-writing program generator generators
inferredcites →https://doi.org/10.1007/978-3-540-24725-8_16openalex-snapshot
Modal Proofs as Distributed Programs
inferredcites →https://doi.org/10.1007/978-3-540-30124-0_24openalex-snapshot
Intuitionistic LTL and a New Characterization of Safety and Liveness
inferredcites →https://doi.org/10.1007/978-3-540-39815-8_4openalex-snapshot
Implementing Multi-stage Languages Using ASTs, Gensym, and Reflection
inferredcites →https://doi.org/10.1007/978-3-540-78197-4_13openalex-snapshot
Inverse Scope as Metalinguistic Quotation in Operational Semantics
inferredcites →https://doi.org/10.1007/978-3-642-02273-9_25openalex-snapshot
A Logical Foundation for Environment Classifiers
inferredcites →https://doi.org/10.1007/978-94-017-2798-3_12openalex-snapshot
A Computational Interpretation of Modal Proofs
inferredcites →https://doi.org/10.1007/bf01201353openalex-snapshot
Untersuchungen �ber das logische Schlie�en. I
inferredcites →https://doi.org/10.1007/bfb0024171openalex-snapshot
Programming Language Implementation and Logic Programming
inferredcites →https://doi.org/10.1007/bfb0026825openalex-snapshot
Efficient multi-level generating extensions for program specialization
inferredcites →https://doi.org/10.1007/bfb0026826openalex-snapshot
Mechanically verifying the correctness of an offline partial evaluator
inferredcites →https://doi.org/10.1016/0167-6423(91)90002-fopenalex-snapshot
Automatic autoprojection of recursive equations with global variables and abstract data types
inferredcites →https://doi.org/10.1016/0168-0072(92)90029-yopenalex-snapshot
2-Sequent calculus: a proof theory of modalities
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1016/0890-5401(91)90055-7openalex-snapshot
Inheritance as implicit coercion
inferredcites →https://doi.org/10.1016/s1571-0661(04)00028-3openalex-snapshot
On a Modal λ-Calculus for S4
inferredcites →https://doi.org/10.1016/s1571-0661(05)80155-0openalex-snapshot
A categorical account of two-level languages
inferredcites →https://doi.org/10.1017/cbo9780511526572openalex-snapshot
Two-Level Functional Languages
inferredcites →https://doi.org/10.1017/cbo9780511569807.008openalex-snapshot
Logic programming in the LF logical framework
inferredcites →https://doi.org/10.1017/s0956796800000058openalex-snapshot
A partial evaluator for the untyped lambda-calculus
inferredcites →https://doi.org/10.1017/s0956796800000770openalex-snapshot
Correctness of binding-time analysis
inferredcites →https://doi.org/10.1017/s0956796800001301openalex-snapshot
The virtues of eta-expansion
inferredcites →https://doi.org/10.1017/s0956796802004598openalex-snapshot
Closed types for a safe imperative MetaML
inferredcites →https://doi.org/10.1017/s095679680500568xopenalex-snapshot
Staged computation with names and necessity
inferredcites →https://doi.org/10.1017/s0956796898002998openalex-snapshot
Computational types from a logical perspective
inferredcites →https://doi.org/10.1017/s0960129501003322openalex-snapshot
A judgmental reconstruction of modal logic
inferredcites →https://doi.org/10.1093/jigpal/8.3.339openalex-snapshot
Representation, reasoning, and relational structures: a hybrid logic manifesto
inferredcites →https://doi.org/10.1093/logcom/7.6.685openalex-snapshot
Labelled propositional modal logics: theory and practice
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0005openalex-snapshot
Modal and Temporal Logics
inferredcites →https://doi.org/10.1093/oso/9780198537809.001.0001openalex-snapshot
Handbook of Logic in Computer Science
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1109/lics.1996.561317openalex-snapshot
A temporal-logic approach to binding-time analysis
inferredcites →https://doi.org/10.1145/1111037.1111060openalex-snapshot
A polymorphic modal type system for lisp-like multi-staged languages
inferredcites →https://doi.org/10.1145/1140335.1140360openalex-snapshot
A modal type system for multi-level generating extensions with persistent code
inferredcites →https://doi.org/10.1145/237721.237784openalex-snapshot
Type-directed partial evaluation
inferredcites →https://doi.org/10.1145/237721.237788openalex-snapshot
A modal analysis of staged computation
inferredcites →https://doi.org/10.1145/258993.259019openalex-snapshot
Multi-stage programming with explicit annotations
inferredcites →https://doi.org/10.1145/319838.319847openalex-snapshot
A simple applicative language: mini-ML
inferredcites →https://doi.org/10.1145/382780.382785openalex-snapshot
A modal analysis of staged computation
inferredcites →https://doi.org/10.1145/581478.581498openalex-snapshot
Meta-programming with names and necessity
inferredcites →https://doi.org/10.2168/lmcs-6(4:8)2010openalex-snapshot
A Logical Foundation for Environment Classifiers
inferredcites →https://doi.org/10.2307/2275370openalex-snapshot
Extending the Curry-Howard interpretation to linear, relevant and other resource logics
inferredcites →https://doi.org/10.4204/eptcs.351.0openalex-snapshot
Proceedings 37th Conference on Mathematical Foundations of Programming Semantics
inferredcites →https://doi.org/10.7146/brics.v2i45.19946openalex-snapshot
Dynamic Maintenance of Majority Information in Constant Time per Update
inferredcites →https://doi.org/10.7146/brics.v6i17.20074openalex-snapshot
A Semantic Account of Type-Directed Partial Evaluation
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-44806-3_2openalex-snapshot
Accomplishments and Research Challenges in Meta-programming
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_4openalex-snapshot
Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming
inferred← citeshttps://doi.org/10.1007/3-540-45350-4_9openalex-snapshot
Multi-stage Imperative Languages: A Conservative Extension Result
inferred← citeshttps://doi.org/10.1007/3-540-49099-x_13openalex-snapshot
An Idealized MetaML: Simpler, and More Expressive
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_49openalex-snapshot
Axiomatic Systems and Topological Semantics for Intuitionistic Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-23679-3_19openalex-snapshot
Streaming Ranked-Tree-to-String Transducers
inferred← citeshttps://doi.org/10.1007/978-3-030-31304-3_5openalex-snapshot
On Chemical Reaction Network Design by a Nested Evolution Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-030-80627-9_7openalex-snapshot
Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-030-88885-5_3openalex-snapshot
Automatic Discovery of Fair Paths in Infinite-State Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-30044-8_11openalex-snapshot
Contextual Modal Type Theory with Polymorphic Contexts
inferred← citeshttps://doi.org/10.1007/978-3-032-22720-1_2openalex-snapshot
Contextual Metaprogramming for Session Types
inferred← citeshttps://doi.org/10.1007/978-3-319-93800-4_15openalex-snapshot
Binary Solutions to Some Systems of Linear Equations
inferred← citeshttps://doi.org/10.1007/978-3-540-24725-8_7openalex-snapshot
ML-Like Inference for Classifiers
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_21openalex-snapshot
Das Traveling-Salesman-Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_6openalex-snapshot
Sequential Importance Sampling for Estimating the Number of Perfect Matchings in Bipartite Graphs: An Ongoing Conversation with Laci
inferred← citeshttps://doi.org/10.1007/978-981-97-2300-3_13openalex-snapshot
An ML-Style Module System for Cross-Stage Type Abstraction in Multi-stage Programming
inferred← citeshttps://doi.org/10.1007/bfb0014551openalex-snapshot
Sound specialization in the presence of computational effects
inferred← citeshttps://doi.org/10.1007/bfb0055113openalex-snapshot
Multi-stage programming: axiomatization and type safety
inferred← citeshttps://doi.org/10.1007/s00446-021-00406-6openalex-snapshot
TuringMobile: a turing machine of oblivious mobile robots with limited visibility and its applications
inferred← citeshttps://doi.org/10.1007/s11128-019-2297-3openalex-snapshot
Evaluation of exact quantum query complexities by semidefinite programming
inferred← citeshttps://doi.org/10.1007/s11225-024-10110-8openalex-snapshot
On a Generalization of Heyting Algebras I
inferred← citeshttps://doi.org/10.1016/j.entcs.2018.11.015openalex-snapshot
Modality via Iterated Enrichment
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104589openalex-snapshot
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS
inferred← citeshttps://doi.org/10.1016/j.jksuci.2018.08.008openalex-snapshot
Formal verification of a peer-to-peer streaming protocol
inferred← citeshttps://doi.org/10.1016/j.scico.2025.103379openalex-snapshot
An ML-style module system for cross-stage type abstraction in multi-stage programming
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.10.022openalex-snapshot
Sparsification lower bound for linear spanners in directed graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00053-0openalex-snapshot
MetaML and multi-stage programming with explicit annotations
inferred← citeshttps://doi.org/10.1017/s1471068421000089openalex-snapshot
Exploring the Jungle of Intuitionistic Temporal Logics
inferred← citeshttps://doi.org/10.1093/bioinformatics/bty389openalex-snapshot
RecPhyloXML: a format for reconciled gene trees
inferred← citeshttps://doi.org/10.1093/imaiai/iaaa032openalex-snapshot
High-temperature structure detection in ferromagnets
inferred← citeshttps://doi.org/10.1093/logcom/exab041openalex-snapshot
A strongly complete axiomatization of intuitionistic temporal logic
inferred← citeshttps://doi.org/10.1093/logcom/exab042openalex-snapshot
A recursion theoretic foundation of computation over real numbers
inferred← citeshttps://doi.org/10.1109/acdsa67686.2026.11468027openalex-snapshot
Foundational Design of Multi-Modal Typed Programming Language for Quantum-Classical Hybrid Computing System
inferred← citeshttps://doi.org/10.1109/lics.2017.8005089openalex-snapshot
Dual-Context Calculi for Modal Logic
inferred← citeshttps://doi.org/10.1145/3365833openalex-snapshot
Intuitionistic Linear Temporal Logics
inferred← citeshttps://doi.org/10.1145/3486609.3487203openalex-snapshot
Multi-stage programming with generative and analytical macros
inferred← citeshttps://doi.org/10.1145/3563335openalex-snapshot
Monadic and comonadic aspects of dependency analysis
inferred← citeshttps://doi.org/10.1145/3610612.3610621openalex-snapshot
Intuitionistic Metric Temporal Logic
inferred← citeshttps://doi.org/10.1145/3747518openalex-snapshot
Multi-stage Programming with Splice Variables
inferred← citeshttps://doi.org/10.1145/3759537.3762695openalex-snapshot
Hygienic Macros via Staged Environment Machines (Position Paper)
inferred← citeshttps://doi.org/10.1145/3798263openalex-snapshot
Fail Faster: Staging and Fast Randomness for High-Performance PBT
inferred← citeshttps://doi.org/10.21146/2074-1472-2021-27-2-93-120openalex-snapshot
Undecidability of QLTL and QCTL with two variables and one monadic predicate letter
inferred← citeshttps://doi.org/10.23638/lmcs-14(3:3)2018openalex-snapshot
The intuitionistic temporal logic of dynamical systems
inferred← citeshttps://doi.org/10.24963/kr.2022openalex-snapshot
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.24963/kr.2022/1openalex-snapshot
A Gödel Calculus for Linear Temporal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1803.05078openalex-snapshot
Bisimulations for intuitionistic temporal logics
inferred← citeshttps://doi.org/10.48550/arxiv.1804.03217openalex-snapshot
An intuitionistic axiomatization of `eventually'
inferred← citeshttps://doi.org/10.48550/arxiv.1912.12893openalex-snapshot
Intuitionistic Linear Temporal Logics
inferred← citeshttps://doi.org/10.6083/m4n877qfopenalex-snapshot
The role of type equality in meta-programming
inferred← citeshttps://doi.org/10.7146/aul.214.152openalex-snapshot
An Analytical Approach to Programs as Data Objects
inferred← citeshttps://doi.org/10.7146/brics.v2i53.19954openalex-snapshot
Automated Logical Verification based on Trace Abstractions
inferred← citeshttps://doi.org/10.7146/brics.v2i55.19956openalex-snapshot
Behavioural Equivalence for Infinite Systems—Partially Decidable!
inferred← citeshttps://doi.org/10.7146/brics.v3i1.19502openalex-snapshot
A Communication Complexity Proof that Symmetric Functions have Logarithmic Depth
inferred← citeshttps://doi.org/10.7146/brics.v7i46.20213openalex-snapshot
Reasoning About Code-Generation in Two-Level Languages
inferred← citeshttps://doi.org/10.7146/brics.v9i52.21767openalex-snapshot
A New One-Pass Transformation into Monadic Normal Form
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.