On the public citation graph

Higher-order concurrent linear logic programming

0 signed · 51 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1994.1036openalex-snapshot

Logic Programming in a Fragment of Intuitionistic Linear Logic

inferredcites →https://doi.org/10.1007/3-540-57208-2_35openalex-snapshot

Types for dyadic interaction

inferredcites →https://doi.org/10.1007/3-540-57208-2_36openalex-snapshot

Principal typing schemes in a polyadic π-calculus

inferredcites →https://doi.org/10.1007/3-540-57342-9_89openalex-snapshot

A typing system for a calculus of objects

inferredcites →https://doi.org/10.1007/3-540-60360-3_42openalex-snapshot

Static analysis of communication for asynchronous concurrent programming languages

inferredcites →https://doi.org/10.1007/978-3-642-58041-3_6openalex-snapshot

The Polyadic π-Calculus: a Tutorial

inferredcites →https://doi.org/10.1007/bf01211602openalex-snapshot

Asynchronous communication model based on linear logic

inferredcites →https://doi.org/10.1007/bf03037173openalex-snapshot

Linear objects: Logical processes with built-in inheritance

inferredcites →https://doi.org/10.1007/bfb0018661openalex-snapshot

Asynchronous communication model based on linear logic

inferredcites →https://doi.org/10.1016/0304-3975(87)90045-4openalex-snapshot

Linear logic

inferredcites →https://doi.org/10.1016/0304-3975(88)90001-1openalex-snapshot

Fiftieth volume of theoretical computer science

inferredcites →https://doi.org/10.1109/lics.1991.151628openalex-snapshot

Logic programming in a fragment of intuitionistic linear logic

inferredcites →https://doi.org/10.1109/lics.1993.287570openalex-snapshot

Typing and subtyping for mobile processes

inferredcites →https://doi.org/10.1145/113446.113470openalex-snapshot

CML

inferredcites →https://doi.org/10.1145/117954.117971openalex-snapshot

Communication as fair distribution of knowledge

inferredcites →https://doi.org/10.1145/143165.143200openalex-snapshot

A compilation method for ML-style polymorphic record calculi

inferredcites →https://doi.org/10.1145/158511.158701openalex-snapshot

A sort inference algorithm for the polyadic π-calculus

inferredcites →https://doi.org/10.1145/174675.174538openalex-snapshot

Higher-order concurrent programs with finite communication topology (extended abstract)

inferredcites →https://doi.org/10.1145/191080.191088openalex-snapshot

Type-theoretic foundations for concurrent object-oriented programing

inferredcites →https://doi.org/10.1145/28697.28722openalex-snapshot

Object-oriented concurrent programming ABCL/1

inferredcites →https://doi.org/10.1145/582153.582176openalex-snapshot

Principal type-schemes for functional programs

inferredcites →https://doi.org/10.1145/72551.72555openalex-snapshot

The family of concurrent logic programming languages

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.1002/j.1096-9942.1995.tb00020.xopenalex-snapshot

Toward Foundations of Concurrent Object‐Oriented Programming‐Types and Language Design

inferred← citeshttps://doi.org/10.1006/inco.2000.2872openalex-snapshot

Type Reconstruction for Linear π-Calculus with I/O Subtyping

inferred← citeshttps://doi.org/10.1007/10720076_58openalex-snapshot

MultiAgent Planning: A Resource Based Approach

inferred← citeshttps://doi.org/10.1007/3-540-46016-0_27openalex-snapshot

Flexible Agent Programming in Linear Logic

inferred← citeshttps://doi.org/10.1007/3-540-60360-3_42openalex-snapshot

Static analysis of communication for asynchronous concurrent programming languages

inferred← citeshttps://doi.org/10.1007/3-540-61487-7_22openalex-snapshot

Schematic: A concurrent object-oriented extension to Scheme

inferred← citeshttps://doi.org/10.1007/3-540-61487-7_26openalex-snapshot

Proofs, concurrent objects and computations in a FILL framework

inferred← citeshttps://doi.org/10.1007/3-540-61626-8_83openalex-snapshot

Partial evaluation scheme for concurrent languages and its correctness

inferred← citeshttps://doi.org/10.1007/3-540-62688-3_43openalex-snapshot

Pomset logic: A non-commutative extension of classical linear logic

inferred← citeshttps://doi.org/10.1007/978-0-387-35562-7_31openalex-snapshot

Distributed and Concurrent Objects Based on Linear Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_4openalex-snapshot

An Algebraic Theory of Actors and Its Application to a Simple Object-Based Language

inferred← citeshttps://doi.org/10.1007/978-3-540-40007-3_26openalex-snapshot

Type Systems for Concurrent Programs

inferred← citeshttps://doi.org/10.1007/978-981-92-0184-6_10openalex-snapshot

Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations

inferred← citeshttps://doi.org/10.1007/bfb0002781openalex-snapshot

An efficient compilation framework for languages based on a concurrent process calculus

inferred← citeshttps://doi.org/10.1007/bfb0032742openalex-snapshot

Type-based analysis of communication for concurrent programming languages

inferred← citeshttps://doi.org/10.1007/s12204-014-1554-yopenalex-snapshot

A logical characterization for linear higher-order processes

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00144-6openalex-snapshot

A Generalized Deadlock-Free Process Calculus

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80591-2openalex-snapshot

Specifying Real-Time Finite-State Systems in Linear Logic (Extended Abstract)

inferred← citeshttps://doi.org/10.1017/s095679681400001xopenalex-snapshot

Propositions as sessions

inferred← citeshttps://doi.org/10.1093/logcom/exy019openalex-snapshot

Hyper Natural Deduction for Gödel Logic—A natural deduction system for parallel reasoning

inferred← citeshttps://doi.org/10.1109/lics.1997.614941openalex-snapshot

A partially deadlock-free typed process calculus

inferred← citeshttps://doi.org/10.1109/lics.2015.57openalex-snapshot

Hyper Natural Deduction

inferred← citeshttps://doi.org/10.1145/2364527.2364568openalex-snapshot

Propositions as sessions

inferred← citeshttps://doi.org/10.1145/2398856.2364568openalex-snapshot

Propositions as sessions

inferred← citeshttps://doi.org/10.1145/276393.278524openalex-snapshot

A partially deadlock-free typed process calculus

inferred← citeshttps://doi.org/10.1145/330249.330251openalex-snapshot

Linearity and the pi-calculus

inferred← citeshttps://doi.org/10.2969/msjmemoirs/00201c070openalex-snapshot

An Introduction to Linear Logic: Expressiveness and Phase Semantics

inferred← citeshttps://doi.org/10.4204/eptcs.137.4openalex-snapshot

Session Types in Abelian Logic

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.