Process Realizability
Logic in Computer Science
2015-12-22 v1
Abstract
We develop a notion of realizability for Classical Linear Logic based on a concurrent process calculus.
Keywords
Cite
@article{arxiv.1512.06233,
title = {Process Realizability},
author = {Samson Abramsky},
journal= {arXiv preprint arXiv:1512.06233},
year = {2015}
}
Comments
Appeared in Foundations of Secure Computation: Proceedings of the 1999 Marktoberdorf Summer School, F. L. Bauer and R. Steinbruggen, eds. (IOS Press) 2000, 167-180