Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Tom Hirschowitz"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 20, Issue 1 (2024)
By abstracting over well-known properties of De Bruijn's representation with nameless dummies, we design a new theory of syntax with variable binding and capture-avoiding substitution. We propose it as a simpler alternative to Fiore, Plotkin, and Tur
Externí odkaz:
https://doaj.org/article/b5f8337d6cbb41d380f2fc1f6a1bb843
Autor:
Tom Hirschowitz, Ambroise Lafont
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
Applicative bisimilarity is a coinductive characterisation of observational equivalence in call-by-name lambda-calculus, introduced by Abramsky (1990). Howe (1996) gave a direct proof that it is a congruence, and generalised the result to all languag
Externí odkaz:
https://doaj.org/article/1811d8c57d8443d7900dc14a034071be
Publikováno v:
Logical Methods in Computer Science, Vol Volume 18, Issue 3 (2022)
This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition monads, th
Externí odkaz:
https://doaj.org/article/58968be383f04ba8a56601c1941a0db9
Autor:
Tom Hirschowitz
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 300, Iss Proc. EXPRESS/SOS 2019, Pp 1-18 (2019)
We give a leisurely introduction to our abstract framework for operational semantics based on cellular monads on transition categories. Furthermore, we relate it for the first time to an existing format, by showing that all Positive GSOS specificatio
Externí odkaz:
https://doaj.org/article/cefa9b93f7e041e9a7697caf70d7a49d
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 4 (2017)
Following previous work on CCS, we propose a compositional model for the $\pi$-calculus in which processes are interpreted as sheaves on certain simple sites. Such sheaves are a concurrent form of innocent strategies, in the sense of Hyland-Ong/Nicka
Externí odkaz:
https://doaj.org/article/76453d669bca4012b3ce3ed822bce3cb
Autor:
Tom Hirschowitz
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 4 (2014)
In previous work with Pous, we defined a semantics for CCS which may both be viewed as an innocent form of presheaf semantics and as a concurrent form of game semantics. We define in this setting an analogue of fair testing equivalence, which we prov
Externí odkaz:
https://doaj.org/article/e985dec546d5432fb4824c5a551f273c
Autor:
Tom Hirschowitz
Publikováno v:
Logical Methods in Computer Science, Vol Volume 9, Issue 3 (2013)
We propose a semantics for permutation equivalence in higher-order rewriting. This semantics takes place in cartesian closed 2-categories, and is proved sound and complete.
Externí odkaz:
https://doaj.org/article/f375fc2860724c7482516f11c721e4af
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030992521
By abstracting over well-known properties of De Bruijn’s representation with nameless dummies, we design a new theory of syntax with variable binding and capture-avoiding substitution. We propose it as a simpler alternative to Fiore, Plotkin, and T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86577de39c1383f2506042562a2b752f
https://doi.org/10.1007/978-3-030-99253-8_20
https://doi.org/10.1007/978-3-030-99253-8_20
Publikováno v:
HAL
This paper is a contribution to the search for efficient and high-level mathematical tools to specify and reason about (abstract) programming languages or calculi. Generalising the reduction monads of Ahrens et al., we introduce transition monads, th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::39044a1578f17b3a52948e2c1f2e84f1
http://arxiv.org/abs/2012.06530
http://arxiv.org/abs/2012.06530
Publikováno v:
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.273-286, ⟨10.1145/3373718.3394738⟩
LICS
LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2020, Saarbrücken, Germany. pp.273-286, ⟨10.1145/3373718.3394738⟩
LICS
International audience; We introduce a categorical framework for operational semantics, in which we define substitution-closed bisimilarity, an abstract analogue of the open extension of Abramsky's applicative bisimilarity. We furthermore prove a con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e57d92cad032bcaa764e2b0aef96a19c
https://hal.archives-ouvertes.fr/hal-02880876/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02880876/file/main.pdf