On the public citation graph
Testing Concurrent Systems: An Interpretation of Intuitionistic Logic
0 signed · 58 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.1002/(sici)1096-9942(199901/03)5:1<35::aid-tapo4>3.0.co;2-4openalex-snapshot
Type inference with constrained types
inferredcites →https://doi.org/10.1006/inco.2000.3002openalex-snapshot
Linear Concurrent Constraint Programming: Operational and Phase Semantics
inferredcites →https://doi.org/10.1007/3-540-16492-8_94openalex-snapshot
Higher-order logic programming
inferredcites →https://doi.org/10.1007/3-540-36579-6_11openalex-snapshot
Polyglot: An Extensible Compiler Framework for Java
inferredcites →https://doi.org/10.1007/3-540-48109-5openalex-snapshot
Interactive Distributed Multimedia Systems and Telecommunication Services
inferredcites →https://doi.org/10.1007/3-540-48660-7_25openalex-snapshot
System Description: Teyjus—A Compiler and Abstract Machine Based Implementation of λProlog
inferredcites →https://doi.org/10.1007/3-540-55602-8_189openalex-snapshot
Proof search in the intuitionistic sequent calculus
inferredcites →https://doi.org/10.1007/3-540-56596-5openalex-snapshot
Semantics: Foundations and Applications
inferredcites →https://doi.org/10.1007/3-540-56596-5_44openalex-snapshot
A hyperdoctrinal view of concurrent constraint programming
inferredcites →https://doi.org/10.1007/978-3-540-24580-3_23openalex-snapshot
jcc: Integrating Timed Default Concurrent Constraint Programming into Java
inferredcites →https://doi.org/10.1016/0168-0072(91)90068-wopenalex-snapshot
Uniform proofs as a foundation for logic programming
inferredcites →https://doi.org/10.1016/s0167-6423(99)00007-6openalex-snapshot
Introduction to set constraint-based program analysis
inferredcites →https://doi.org/10.1016/s0304-3975(01)00308-5openalex-snapshot
A new framework for declarative programming
inferredcites →https://doi.org/10.1017/s1471068401001041openalex-snapshot
Constraint Logic Programming with Hereditary Harrop formulas
inferredcites →https://doi.org/10.1093/comjnl/38.1.79-aopenalex-snapshot
Object-Oriented Type Systems
inferredcites →https://doi.org/10.1093/oso/9780198537458.001.0001openalex-snapshot
Handbook of Logic in Artificial Intelligence and Logic Programming
inferredcites →https://doi.org/10.1109/lics.1992.185546openalex-snapshot
The category of constraint systems is Cartesian-closed
inferredcites →https://doi.org/10.1109/lics.2004.6openalex-snapshot
A sequent calculus for nominal logic
inferredcites →https://doi.org/10.1145/1013963.1013973openalex-snapshot
Providing declarative semantics for HH extended constraint logic programs
inferredcites →https://doi.org/10.1145/1028664.1028669openalex-snapshot
Advanced refactorings in eclipse
inferredcites →https://doi.org/10.1145/1040305.1040335openalex-snapshot
Automated soundness proofs for dataflow analyses and transformations via local rules
inferredcites →https://doi.org/10.1145/1069774.1069778openalex-snapshot
Monadic concurrent linear logic programming
inferredcites →https://doi.org/10.1145/200994.201001openalex-snapshot
Closure analysis in constraint form
inferredcites →https://doi.org/10.1145/291889.291900openalex-snapshot
Constraint-based array dependence analysis
inferredcites →https://doi.org/10.1145/504282.504286openalex-snapshot
Points-to analysis for Java using annotated constraints
inferredcites →https://doi.org/10.1145/53990openalex-snapshot
Proceedings of the ACM SIGPLAN 1988 conference on Programming language design and implementation
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2275431openalex-snapshot
Contraction-free sequent calculi for intuitionistic logic
inferredcites →https://doi.org/10.7551/mitpress/2086.001.0001openalex-snapshot
Concurrent Constraint Programming
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-319-10428-7_4openalex-snapshot
Concurrent Constraint Programming Research Programmes – Redux
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_20openalex-snapshot
Higher-Order Logic Programming Languages with Constraints: A Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_31openalex-snapshot
From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_34openalex-snapshot
Focusing and Polarization in Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/s10817-007-9091-0openalex-snapshot
A Logical Characterization of Forward and Backward Chaining in the Inverse Method
inferred← citeshttps://doi.org/10.1007/s10990-011-9071-2openalex-snapshot
Logical approximation for program analysis
inferred← citeshttps://doi.org/10.1016/j.apal.2011.01.012openalex-snapshot
A focused approach to combining logics
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.04.011openalex-snapshot
Proving Concurrent Constraint Programming Correct, Revisited
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.041openalex-snapshot
Focusing and polarization in linear, intuitionistic, and classical logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.08.026openalex-snapshot
On concurrent behaviors and focusing in linear logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.005openalex-snapshot
Kripke semantics for higher-order type theory applied to constraint logic programming languages
inferred← citeshttps://doi.org/10.1017/s0960129518000403openalex-snapshot
On the unification of classical, intuitionistic and affine logics
inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot
A Survey of the Proof-Theoretic Foundations of Logic Programming
inferred← citeshttps://doi.org/10.1109/lics.2009.47openalex-snapshot
A Unified Sequent Calculus for Focused Proofs
inferred← citeshttps://doi.org/10.1145/1449764.1449800openalex-snapshot
Constrained types for object-oriented languages
inferred← citeshttps://doi.org/10.1145/1449955.1449800openalex-snapshot
Constrained types for object-oriented languages
inferred← citeshttps://doi.org/10.1145/1480945.1480949openalex-snapshot
Linear logical approximations
inferred← citeshttps://doi.org/10.1145/1599410.1599427openalex-snapshot
Algorithmic specifications in linear logic with subexponentials
inferred← citeshttps://doi.org/10.1145/2851141.2851153openalex-snapshot
Declarative coordination of graph-based parallel programs
inferred← citeshttps://doi.org/10.1145/3016078.2851153openalex-snapshot
Declarative coordination of graph-based parallel programs
inferred← citeshttps://doi.org/10.17485/ijst/2016/v9i6/82655openalex-snapshot
Concurrency in Intuitionistic Linear-Time μ-Calculus: A Case study of Manufacturing System
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.