Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Marco Maggesi"'
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:
Marco Maggesi
Publikováno v:
Laboratorio dell'ISPF, Vol 2022, Iss XIX (2022)
Externí odkaz:
https://doaj.org/article/c484042a184849e08d41f14a5c66d6ef
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:
Mathematical Structures in Computer Science, 31, 10, pp. 1-38
Mathematical structures in computer science, 31(SI: 10). Cambridge University Press
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science, 31, 1-38
Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany, 5:1-5:17. Dagstuhl : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
STARTPAGE=5:1;ENDPAGE=5:17;ISSN=1868-8969;TITLE=Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany
Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany, pp. 5:1-5:17
Mathematical structures in computer science, 31(SI: 10). Cambridge University Press
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science, 31, 1-38
Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany, 5:1-5:17. Dagstuhl : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
STARTPAGE=5:1;ENDPAGE=5:17;ISSN=1868-8969;TITLE=Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany
Geuvers, H. (ed.), FSCD 2019: 4th International Conference on Formal Structures for Computation and Deduction, June 24-30, 2019, Dortmund, Germany, pp. 5:1-5:17
We develop bicategory theory in univalent foundations. Guided by the notion of univalence for (1-)categories studied by Ahrens, Kapulkin, and Shulman, we define and study univalent bicategories. To construct examples of univalent bicategories in a mo
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:
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
We prove some extension theorems for quaternionic holomorphic functions in the sense of Fueter. Starting from the existence theorem for the nonhomogeneous Cauchy-Riemann-Fueter Problem, we prove that an $\mathbb{H}$-valued function $f$ on a smooth hy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bced12e4aee5bb04cb179a0a70cc75d
Autor:
Marco Maggesi, Vezzosi, G.
Publikováno v:
Scopus-Elsevier
In this short note, we simply collect some known results about representing algebraic cycles by various kind of "nice" (e.g. smooth, local complete intersection, products of local complete intersection) algebraic cycles, up to rational equivalence. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::905fdfd987d89c7e49597265909e091f
http://hdl.handle.net/2158/1149388
http://hdl.handle.net/2158/1149388
Autor:
Marco Maggesi
We present a computer formalization of metric spaces in the HOL Light theorem prover. Basic results of the theory of complete metric spaces are provided, including the Banach Fixed-Point Theorem, the Baire Category Theorem and the completeness of the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44c56031614187c60bd322ad52a821f9
http://hdl.handle.net/2158/1080621
http://hdl.handle.net/2158/1080621