Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Simon Castellan"'
Autor:
Simon Castellan, Pierre Clairambault
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 3 (2024)
Game semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated achievement is to have obtained full abstraction results for programming languages with a
Externí odkaz:
https://doaj.org/article/65319b39c5e14e2ea1a61e1bb3852de7
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 1 (2019)
We build a cartesian closed category, called Cho, based on event structures. It allows an interpretation of higher-order stateful concurrent programs that is refined and precise: on the one hand it is conservative with respect to standard Hyland-Ong
Externí odkaz:
https://doaj.org/article/8ccbe1c5463140a581b1b301367a57df
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 4 (2017)
We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a 2-categorical s
Externí odkaz:
https://doaj.org/article/b8cd19b82c994898896efc0f008019f3
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 3 (2017)
In 2011, Rideau and Winskel introduced concurrent games and strategies as event structures, generalizing prior work on causal formulations of games. In this paper we give a detailed, self-contained and slightly-updated account of the results of Ridea
Externí odkaz:
https://doaj.org/article/98a4f8ac3e354590b83690c0b79d5367
Autor:
Simon Castellan, Pierre Clairambault
Publikováno v:
Proceedings of the ACM on Programming Languages. 7:689-717
We introduce a multi-token machine for Idealized Parallel Algol (IPA), a higher-order concurrent programming language with shared state and semaphores. Our machine takes the shape of a compositional interpretation of terms as Petri structures, certai
Publikováno v:
Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics ISBN: 9783030665449
Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics
Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics, 20, Springer International Publishing, pp.135-180, 2021, Outstanding Contributions to Logic, ⟨10.1007/978-3-030-66545-6_5⟩
Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics
Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics, 20, Springer International Publishing, pp.135-180, 2021, Outstanding Contributions to Logic, ⟨10.1007/978-3-030-66545-6_5⟩
We show how the categorical logic of the untyped, simply typed and dependently typed lambda calculus can be structured around the notion of category with families (cwf). To this end we introduce subcategories of simply typed cwfs (scwfs), where types
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59efd880a7ae4049c916671ae2fbfaa6
https://doi.org/10.1007/978-3-030-66545-6_5
https://doi.org/10.1007/978-3-030-66545-6_5
Autor:
Nobuko Yoshida, Simon Castellan
Publikováno v:
Proceedings of the ACM on Programming Languages. 3:1-29
Game semantics and session types are two formalisations of the same concept: message-passing open programs following certain protocols. Game semantics represents protocols as games, and programs as strategies; while session types specify protocols, a
Autor:
Hugo Paquet, Simon Castellan
Publikováno v:
Programming Languages and Systems ISBN: 9783030171834
ESOP
ESOP
We define a new denotational semantics for a first-order probabilistic programming language in terms of probabilistic event structures. This semantics is intensional, meaning that the interpretation of a program contains information about its behavio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b83483f93c9f81d7a70fc634c163cde6
https://doi.org/10.1007/978-3-030-17184-1_12
https://doi.org/10.1007/978-3-030-17184-1_12
Autor:
Nobuko Yoshida, Simon Castellan
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030171261
FoSSaCS
22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)
FoSSaCS
22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS)
Commuting conversions of Linear Logic induce a notion of dependency between rules inside a proof derivation: a rule depends on a previous rule when they cannot be permuted using the conversions. We propose a new interpretation of proofs of Linear Log
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4a94e5f3c30f2f52af17d70b8223d355
https://doi.org/10.1007/978-3-030-17127-8_9
https://doi.org/10.1007/978-3-030-17127-8_9
Publikováno v:
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018)
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), Jul 2018, Oxford, France. ⟨10.1145/3209108.3209187⟩
LICS
Symposium on Logic in Computer Science (LCIS 2018)
the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2018), Jul 2018, Oxford, France. ⟨10.1145/3209108.3209187⟩
LICS
Symposium on Logic in Computer Science (LCIS 2018)
We define a new games model of Probabilistic PCF (PPCF) by enriching thin concurrent games with symmetry, recently introduced by Castellan et al, with probability. This model supports two interpretations of PPCF, one sequential and one parallel. We m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::013f7e7cd115a9486537579553befe74
https://hal.science/hal-01886965
https://hal.science/hal-01886965