Classical realizability as a classifier for nondeterminism

DOI10.1145/3209108.3209140zbMath1452.03045arXiv1805.11392OpenAlexW3098075529MaRDI QIDQ5145321

Guillaume Geoffroy

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.11392

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Unnamed Item

This page was built for publication: Classical realizability as a classifier for nondeterminism