Decoding choice encodings
type: Item
instance of: scholarly article
title: Decoding choice encodings
zbMATH Open document ID: 1003.68080
author: Uwe Nestmann
author: Benjamin C. Pierce
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 1853134
describes a project that uses: Pict
MaRDI profile type: Publication
full work available at URL: inco.2000.2868
OpenAlex ID: W2075040560
cites work: On bisimulations for the asynchronous \(\pi\)-calculus
cites work: An efficiency preorder for processes
cites work: From a concurrent λ-calculus to the π-calculus
cites work: Q4490761
cites work: On reduction-based process semantics
cites work: Q3992568
cites work: Functions as processes
cites work: A calculus of mobile processes. II
cites work: Barbed bisimulation
cites work: Q4018066
cites work: Q4222921
cites work: Polarized name passing
cites work: Q4513619
cites work: Q4942625
cites work: From π-calculus to higher-order π-calculus — and back
cites work: An investigation into functions as processes
cites work: The lazy lambda calculus in a concurrency scenario
cites work: On the proof method for bisimulation
cites work: \(\pi\)-calculus, internal mobility, and agent-passing calculi
cites work: A foundation for higher-order concurrent constraint programming
cites work: Plain CHOCS. A second generation calculus for higher order processes
cites work: A theory of higher order communicating systems
cites work: Process Algebra
cites work: Constraints as processes
cites work: Bisimulation and divergence
cites work: π-Calculus semantics of object-oriented programming languages
cites work: Objects in the \(\pi\)-calculus
DOI: 10.1006/INCO.2000.2868
description: scientific article; zbMATH DE number 1853134