On the public citation graph

Operational and algebraic semantics for facile: A symmetric integration of concurrent and functional programming

https://doi.org/10.1007/bfb0032073

0 signed · 64 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.1007/3-540-10235-3openalex-snapshot

A Calculus of Communicating Systems

inferredcites →https://doi.org/10.1007/3-540-17184-3_38openalex-snapshot

Amber

inferredcites →https://doi.org/10.1007/3-540-17660-8_55openalex-snapshot

SMoLCS-driven concurrent calculi

inferredcites →https://doi.org/10.1007/3-540-17945-3_3openalex-snapshot

Functional programming and communicating processes

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

FACILE: A symmetric integration of concurrent and functional programming

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

Processes and functions

inferredcites →https://doi.org/10.1007/3-540-51285-3_52openalex-snapshot

The typed λ-calculus with first-class processes

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

Facile: A symmetric integration of concurrent and functional programming

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

Concurrency and automata on infinite sequences

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(83)90114-7openalex-snapshot

Calculi for synchrony and asynchrony

inferredcites →https://doi.org/10.1016/0304-3975(84)90102-6openalex-snapshot

Parametric channels via label expressions in CCS

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

Synchronous operations as first-class values

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

A calculus of higher order communicating systems

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

Synchronous operations as first-class values

inferredcites →https://doi.org/10.7146/dpb.v15i208.7559openalex-snapshot

A Calculus of Communicating Systems with Label Passing

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781119228974.ch8openalex-snapshot

Case for Support

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

A Fully Abstract Denotational Model for Higher-Order Processes

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

Assigning Types to Processes

inferred← citeshttps://doi.org/10.1007/11590156_11openalex-snapshot

Extending Howe’s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names

inferred← citeshttps://doi.org/10.1007/3-540-48320-9_38openalex-snapshot

Subtyping and Locality in Distributed Higher Order Processes

inferred← citeshttps://doi.org/10.1007/3-540-50940-2_36openalex-snapshot

FACILE: A symmetric integration of concurrent and functional programming

inferred← citeshttps://doi.org/10.1007/3-540-56596-5_47openalex-snapshot

Some issues in the semantics of facile distributed programming

inferred← citeshttps://doi.org/10.1007/3-540-56883-2_10openalex-snapshot

Concurrent ML: Design, application and semantics

inferred← citeshttps://doi.org/10.1007/3-540-56939-1_101openalex-snapshot

The fork calculus

inferred← citeshttps://doi.org/10.1007/3-540-57208-2_34openalex-snapshot

From CML to process algebras

inferred← citeshttps://doi.org/10.1007/3-540-57787-4_5openalex-snapshot

Graph-grammar semantics of a higher-order programming language for distributed systems

inferred← citeshttps://doi.org/10.1007/3-540-58201-0_76openalex-snapshot

Higher-order processes and their models

inferred← citeshttps://doi.org/10.1007/3-540-59293-8_222openalex-snapshot

Static and dynamic processor allocation for higher-order concurrent languages

inferred← citeshttps://doi.org/10.1007/3-540-60084-1_113openalex-snapshot

Causality for mobile processes

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

From a concurrent λ-calculus to the π-calculus

inferred← citeshttps://doi.org/10.1007/3-540-61052-9_49openalex-snapshot

Compiler correctness for concurrent languages

inferred← citeshttps://doi.org/10.1007/3-540-61440-0_153openalex-snapshot

Mobile processes with a distributed environment

inferred← citeshttps://doi.org/10.1007/3-540-61739-6_36openalex-snapshot

Understanding mobile agents via a non-interleaving semantics for facile

inferred← citeshttps://doi.org/10.1007/3-540-62503-8_16openalex-snapshot

Analysis of Facile programs: A case study

inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_1openalex-snapshot

A Refinement Logic for the Fork Calculus

inferred← citeshttps://doi.org/10.1007/978-1-4615-4123-3_11openalex-snapshot

A Formal Semantics and an Interactive Environment for Sisal

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

Plain CHOCS A second generation calculus for higher order processes

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

Some facile chemistry

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

Facile: A symmetric integration of concurrent and functional programming

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

Constraints for polymorphic behaviours of concurrent ML

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

Causality for debugging mobile agents

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00017-8openalex-snapshot

From CML to its process algebra

inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00093-1openalex-snapshot

Names of the π-calculus agents handled locally

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00049-8openalex-snapshot

A behavioural theory of first-order CML

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

Similarity and Bisimilarity for Countable Non-Determinism and Higher-Order Functions (Extended Abstract)

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

Parallel functional programming in Eden

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

A foundation for actor computation

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

Type and behaviour reconstruction for higher-order concurrent programs

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

A fully abstract denotational model for higher-order processes

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

Assigning types to processes

inferred← citeshttps://doi.org/10.1137/s0097539794275860openalex-snapshot

A Filter Model for Concurrent $\lambda$-Calculus

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

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

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

Compiler correctness for parallel languages

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

Enhanced operational semantics

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

Enhanced operational semantics

inferred← citeshttps://doi.org/10.3233/fi-1997-323401openalex-snapshot

A Convex Powerdomain over Lattices: its Logic and λ-Calculus

inferred← citeshttps://doi.org/10.48456/tr-492openalex-snapshot

Nomadic Pict: language and infrastructure design for mobile computation

inferred← citeshttps://doi.org/10.5075/epfl-thesis-4515openalex-snapshot

Programming language abstractions for mobile code

inferred← citeshttps://doi.org/10.7146/dpb.v22i433.6750openalex-snapshot

From CML to process Algebras

inferred← citeshttps://doi.org/10.7146/dpb.v23i483.6976openalex-snapshot

Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages

inferred← citeshttps://doi.org/10.7146/dpb.v24i496.7024openalex-snapshot

Constraints for Polymorphic Behaviours of Concurrent ML

inferred← citeshttps://doi.org/10.7146/dpb.v24i497.7025openalex-snapshot

Type and Behaviour Reconstruction for Higher-Order Concurrent Programs

inferred← citeshttps://doi.org/10.7146/dpb.v24i498.7026openalex-snapshot

Annotated Type Systems for Program Analysis

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.