Zobrazeno 1 - 10
of 74
pro vyhledávání: '"André 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
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
Publikováno v:
Logical Methods in Computer Science, Vol Volume 17, Issue 2 (2021)
We present a device for specifying and reasoning about syntax for datatypes, programming languages, and logic calculi. More precisely, we study a notion of "signature" for specifying syntactic constructions. In the spirit of Initial Semantics, we de
Externí odkaz:
https://doaj.org/article/6dee9c3af7944403a8068cd53b861c21
Autor:
André Hirschowitz, Marco Maggesi
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 77, Iss Proc. FICS 2012, Pp 31-38 (2012)
We give a new general definition of arity, yielding the companion notions of signature and associated syntax. This setting is modular in the sense requested by Ghani and Uustalu: merging two extensions of syntax corresponds to building an amalgamated
Externí odkaz:
https://doaj.org/article/07906182604c4985a08f8b590ab67bfc
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:
Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2020, pp.1-29. ⟨10.1145/3371099⟩
Proceedings of the ACM on Programming Languages, 2020, pp.1-29. ⟨10.1145/3371099⟩
Proceedings of the ACM on Programming Languages, ACM, 2020, pp.1-29. ⟨10.1145/3371099⟩
Proceedings of the ACM on Programming Languages, 2020, pp.1-29. ⟨10.1145/3371099⟩
In this work, we study 'reduction monads', which are essentially the same as monads relative to the free functor from sets into multigraphs. Reduction monads account for two aspects of the lambda calculus: on the one hand, in the monadic viewpoint, t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3acf2e86072a12291cbeed6bbe47e352
http://arxiv.org/abs/1911.06391
http://arxiv.org/abs/1911.06391
Publikováno v:
Journal of Homotopy and Related Structures
Journal of Homotopy and Related Structures, Springer, 2013, pp.25-8. ⟨10.1007/s40062-013-0025-8⟩
Journal of Homotopy and Related Structures, 2013, pp.25-8. ⟨10.1007/s40062-013-0025-8⟩
Journal of Homotopy and Related Structures, Springer, 2013, pp.25-8. ⟨10.1007/s40062-013-0025-8⟩
Journal of Homotopy and Related Structures, 2013, pp.25-8. ⟨10.1007/s40062-013-0025-8⟩
Directed topology is a refinement of standard topology, where spaces may have non-reversible paths. It has been put forward as a candidate approach to the analysis of concurrent processes. Recently, a wealth of different frameworks for, i.e., categor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c00b5b4ac6ea65932dc54d70a62a57b2
https://doi.org/10.1007/s40062-013-0025-8
https://doi.org/10.1007/s40062-013-0025-8