A thesis for interaction
type: Item
instance of: scholarly article
title: A thesis for interaction
author: Yuxi Fu
published in: Theoretical Computer Science
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 7437215
zbMATH Keywords: process calculus
zbMATH Keywords: theory of interaction
zbMATH Keywords: bisimulation
zbMATH Keywords: expressiveness
MaRDI profile type: Publication
full work available at URL: j.tcs.2021.10.001
OpenAlex ID: W3207567396
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Reactive Turing machines
cites work: Mobile ambients
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Divide and congruence. III: From decomposition of modal formulas to preservation of stability and divergence
cites work: Tau laws for pi calculus
cites work: Q4596788
cites work: The Value-Passing Calculus
cites work: Non-deterministic structures of computation
cites work: Theory of interaction
cites work: Q5111635
cites work: On the expressiveness of interaction
cites work: Computational Complexity of Probabilistic Turing Machines
cites work: A theory of encodings and expressiveness (extended abstract)
cites work: Branching Bisimilarity with Explicit Divergence
cites work: Computation Tree Logic with Deadlock Detection
cites work: Branching time and abstraction in bisimulation semantics
cites work: Turing machines, transition systems, and interaction
cites work: Comparing communication primitives via their relative expressive power
cites work: Towards a Unified Approach to Encodability and Separation Results for Process Calculi
cites work: A theory of communicating processes with value passing
cites work: Symbolic bisimulations
cites work: Q3777424
cites work: General recursive functions of natural numbers
cites work: A Theory of Interactive Computation
cites work: Q5856418
cites work: Q3992568
cites work: Functions as processes
cites work: A calculus of mobile processes. II
cites work: Barbed bisimulation
cites work: What is a ``good'' encoding of guarded choice?
cites work: Welcome to the Jungle: A Subjective Guide to Mobile Process Calculi
cites work: Decoding choice encodings
cites work: Q2706552
cites work: Q3907077
cites work: Algebraic theories for name-passing calculi
cites work: Q3906427
cites work: Q5573961
cites work: From π-calculus to higher-order π-calculus — and back
cites work: The \(\pi\)-calculus: A theory of mobile processes
cites work: Computability by Probabilistic Turing Machines
cites work: Q4040892
cites work: A theory of higher order communicating systems
cites work: On Computable Numbers, with an Application to the Entscheidungsproblem
cites work: How We Think of Computing Today
cites work: Distinguishing and relating higher-order and first-order processes by expressiveness
DOI: 10.1016/J.TCS.2021.10.001
description: scientific article; zbMATH DE number 7437215