Semantics of name and value passing

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Proceedings 16th Annual IEEE Symposium on Logic in Computer Science

• Publication date

  2001-06-16

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/LICS.2001.932486
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A fully abstract denotational semantics for the pi-calculus

  2002cited by this paper
• Bialgebraic Semantics and Recursion (Extended Abstract)

  2001cited by this paper
• pi-Calculus, Structured Coalgebras, and Minimal HD-Automata

  2000cited by this paper
• Models for name-passing processes: interleaving and causal

  2000cited by this paper
• π-Calculus, structured coalgebras, and minimal HD-automata

  2000cited by this paper
• Abstract syntax and variable binding

  1999influential reference
• Theories of Programming Languages: Communicating Sequential Processes

  1998cited by this paper
• Axiomatic domain theory in categories of partial maps

  1998cited by this paper
• A Conservative Look at Operational Semantics with Variable Binding

  1998cited by this paper
• A congruence theorem for structured operational semantics of higher-order languages

  1998cited by this paper
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces

  1998cited by this paper
• On the Foundations of Final Coalgebra Semantics: Non-Well-Founded Sets, Partial Orders, Metric Spaces

  1998cited by this paper
• Presheaf Models for the pi-Calculus

  1997cited by this paper
• Categorical Modelling of Structural Operational Rules: Case Studies

  1997cited by this paper
• Towards a mathematical operational semantics

  1997cited by this paper
• A fully abstract domain model for the /spl pi/-calculus

  1996influential reference
• Ntyft/Ntyxt Rules Reduce to Ntree Rules

  1996cited by this paper
• Axiomatic domain theory in categories of partial maps

  1996cited by this paper
• Bisimulation can't be traced

  1995influential reference
• A Semantic Theory for Value–Passing Processes Late Approach Part I: A Denotational Model and Its Complete Axiomatization

  1995cited by this paper
• A Semantic Theory for Value { Passing

  1995cited by this paper
• A Semantic Theory for Value–Passing Processes Late Approach Part II: A Behavioural Semantics and Full Abstractness

  1995cited by this paper
• Locally Presentable and Accessible Categories: Bibliography

  1994cited by this paper
• Universal algebra

  1993cited by this paper
• Sheaves in geometry and logic: a first introduction to topos theory

  1992cited by this paper
• Structured Operational Semantics and Bisimulation as a Congruence

  1992cited by this paper
• A Calculus of Mobile Processes, II

  1992influential reference
• Sheaves In Geometry And Logic

  1992cited by this paper
• NON‐WELL‐FOUNDED SETS (CSLI Lecture Notes 14)

  1991cited by this paper
• Accessible categories : the foundations of categorical model theory

  1989cited by this paper
• Communication and concurrency

  1989cited by this paper
• A Final Coalgebra Theorem

  1989cited by this paper
• Non-well-founded sets

  1988cited by this paper
• Higher-Level Synchronising Devices in Meije-SCCS

  1985cited by this paper
• Process Algebra for Synchronous Communication

  1984influential reference
• A Calculus of Communicating Systems

  1980cited by this paper
• Universal Algebra

  1979cited by this paper
• Categories for the Working Mathematician

  1971cited by this paper
• Outline of a Mathematical Theory of Computation

  1970cited by this paper
• and as an in

  year unknowninfluential reference
• A Fully-Abstract Model for the (cid:25) -calculus

  year unknowninfluential reference

• Modular abstract syntax trees (MAST): substitution tensors with second-class sorts

  2025cites this paper
• Higher-Order Bialgebraic Semantics

  2024cites this paper
• A Type Theory with a Tiny Object

  2024cites this paper
• A more general categorical framework for congruence of applicative bisimilarity

  2023cites this paper
• A formal analysis of blockchain consensus

  2023cites this paper
• Towards a Higher-Order Mathematical Operational Semantics

  2022cites this paper
• Structured Handling of Scoped Effects: Extended Version

  2022cites this paper
• Modules over Monads and Operational Semantics

  2020cites this paper
• Abstract Congruence Criteria for Weak Bisimilarity

  2020cites this paper
• University of Birmingham Reduction Monads and Their Signatures

  2019cites this paper
• Reduction monads and their signatures

  2019cites this paper
• Reduction Monads and Their Signatures

  2019cites this paper
• Cellular Monads from Positive GSOS Specifications

  2019cites this paper
• Nominal Techniques and Black Box Testing for Automata Learning

  2019influential citation
• Separation and Renaming in Nominal Sets

  2019cites this paper
• Familial monads and structural operational semantics

  2019cites this paper
• Rule Formats for Nominal Process Calculi

  2018cites this paper
• Building on the Diamonds between Theories: Theory Presentation Combinators

  2018cites this paper
• An intensionally fully-abstract sheaf model for π (expanded version)

  2017cites this paper
• Endofunctors modelling higher-order behaviours

  2016influential citation
• Quelques ponts entre sémantique opérationnelle et modèles dénotationnels des langages de programmation

  2016cites this paper
• Network-Conscious π-calculus - A Model of Pastry

  2015cites this paper
• Causal Trees, Finally

  2015cites this paper
• Bialgebraic Semantics for Logic Programming

  2015cites this paper
• An Intensionally Fully-abstract Sheaf Model for pi

  2015cites this paper
• Structural operational semantics for continuous state stochastic transition systems

  2015cites this paper
• Reconfigurable and Software-Defined Networks of Connectors and Components

  2015cites this paper
• A coalgebraic semantics for causality in Petri nets

  2015influential citation
• A network-conscious π-calculus and its coalgebraic semantics

  2014influential citation
• Revisiting causality, coalgebraically

  2014cites this paper
• T. C. C.

  2014cites this paper
• Initial Algebras of Terms with Binding and Algebraic Structure

  2014cites this paper
• Lifting Adjunctions to Coalgebras to (Re)Discover Automata Constructions

  2014cites this paper
• Behavioural equivalences for coalgebras with unobservable moves

  2014influential citation
• Nominal deterministic omega automata ?

  2014cites this paper
• A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours

  2014cites this paper
• Abstract GSOS Rules and a Modular Treatment of Recursive Definitions

  2013influential citation
• Coinductive predicates and final sequences in a fibration

  2013influential citation
• ASCENS Autonomic Service-Component Ensembles D 2 . 3 : Third Report on WP 2 Models for Collaborative and Competitive SCEs , and Distributed Implementation of Connectors

  2013cites this paper
• Fully-abstract concurrent games for pi

  2013cites this paper
• Bigraphs reloaded : a presheaf presentation

  2013cites this paper
• Instances of Computational Effects: An Algebraic Perspective

  2013cites this paper
• Stochastic Pi-calculus Revisited

  2013cites this paper
• Compositional and effectful recursive specification formats: distributive laws and the semantics of recursion

  2013cites this paper
• Saturated Semantics for Coalgebraic Logic Programming

  2013cites this paper
• A Network-Aware Process Calculus for Global Computing and its Categorical Framework

  2013cites this paper
• The Concurrency Column

  2013cites this paper
• Modalities in the Stone age: A comparison of coalgebraic logics

  2012cites this paper
• Type-Based Termination, Inflationary Fixed-Points, and Mixed Inductive-Coinductive Types

  2012cites this paper
• Interaction and Observation: Categorical Semantics of Reactive Systems Trough Dialgebras

  2012cites this paper
• Nominal SOS

  2012cites this paper
• Initial Semantics for Strengthened Signatures

  2012cites this paper
• Network Conscious π-calculus: A Concurrent Semantics

  2012cites this paper
• Contributions to the meta-theory of structural operational semantics

  2012cites this paper
• Foundations of Nominal Techniques: Logic and Semantics of Variables in Abstract Syntax

  2011cites this paper
• Freshness and Name-Restriction in Sets of Traces with Names

  2011cites this paper
• Modalities through the looking glass: a study on coalgebraic modal logics and their applications

  2011cites this paper
• A Presheaf Environment for the Explicit Fusion Calculus

  2011influential citation
• Modularity and Implementation of Mathematical Operational Semantics

  2011cites this paper
• Symbolic and Asynchronous Semantics via Normalized Coalgebras

  2011cites this paper
• Interaction and observation, categorically

  2011cites this paper
• Bialgebras for structural operational semantics: An introduction

  2011cites this paper
• Modalities through the looking glass: a study on coalgebraic modal logics and their applications

  2011cites this paper
• Symmetries, local names and dynamic (de)-allocation of names

  2010influential citation
• Families of Symmetries as Efficient Models of Resource Binding

  2010cites this paper
• Modules over monads and initial semantics

  2010cites this paper
• Relating coalgebraic notions of bisimulation: with applications to name-passing process calculi

  2009cites this paper
• Lifting of operations in modular monadic semantics

  2009cites this paper
• Relating Coalgebraic Notions of Bisimulation

  2009cites this paper
• A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets

  2009cites this paper
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves

  2009cites this paper
• Equational Coalgebraic Logic

  2009cites this paper
• Bialgebraic methods and modal logic in structural operational semantics

  2009cites this paper
• A Category of Explicit Fusions

  2008cites this paper
• Free-algebra models for the pi -calculus

  2008cites this paper
• Nominal Renaming Sets

  2008cites this paper
• Abstract Semantics by Observable Contexts

  2008cites this paper
• Symbolic Semantics Revisited

  2008cites this paper
• Accessible functors and final coalgebras for named sets

  2008cites this paper
• A Categorical Model of the Fusion Calculus

  2008influential citation
• a Mathematical Theory of Substitution

  2007cites this paper
• Bialgebraic Operational Semantics and Modal Logic (extended abstract)

  2007cites this paper
• A Well-behaved LTS for the Pi-calculus: (Abstract)

  2007cites this paper
• Higher-order theories

  2007cites this paper
• Bialgebraic Operational Semantics and Modal Logic

  2007cites this paper
• The algebraicity of the lambda-calculus

  2007cites this paper
• A compositional coalgebraic model of fusion calculus

  2007influential citation
• Nominal renaming sets ( technical report )

  2007cites this paper
• Recursively defined metric spaces without contraction

  2007cites this paper
• Name-passing process calculi : operational models and structural operational semantics

  2007influential citation
• Bialgebraic Methods in Structural Operational Semantics: Invited Talk

  2007cites this paper
• A modular approach to the behavioural theory of mobility ∗

  2007cites this paper
• Structural Operational Semantics

  2007cites this paper
• Coalgebraic Modal Logic Beyond Sets

  2007cites this paper
• Pi-Calculus in Logical Form

  2007cites this paper
• Modules over Monads and Linearity

  2006cites this paper
• About permutation algebras, (pre)sheaves and named sets

  2006cites this paper
• T C C

  2006cites this paper
• T C C

  2006cites this paper
• Explicit substitutions and higher-order syntax

  2006cites this paper