On the discriminating power of passivation and higher-order interaction

DOI10.1145/2603088.2603113zbMath1392.68283OpenAlexW2085038574MaRDI QIDQ4635597

Valeria Vignudelli, Marco Bernardo, Davide Sangiorgi

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2603088.2603113

zbMATH Keywords

lambda-calculuscontextual equivalenceCCSprobabilistic processespassivationhigher-order pi-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (2)

A general SOS theory for the specification of probabilistic transition systems ⋮ Towards general axiomatizations for bisimilarity and trace semantics

This page was built for publication: On the discriminating power of passivation and higher-order interaction