default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Maggesi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi
:
Variable binding and substitution for (nameless) dummies. Log. Methods Comput. Sci. 20(1) (2024)- [c10]Cosimo Perini Brogi, Marco Maggesi:
Analysing Collective Adaptive Systems by Proving Theorems. ISoLA (1) 2024: 223-237 - [c9]Marco Maggesi, Cosimo Perini Brogi:
Rigorous Analysis of Idealised Pathfinding Ants in Higher-Order Logic. ISoLA (2) 2024: 297-315 - 2023
- [j8]Marco Maggesi, Cosimo Perini Brogi:
Mechanising Gödel-Löb Provability Logic in HOL Light. J. Autom. Reason. 67(3): 29 (2023) - 2022
- [c8]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi:
Variable binding and substitution for (nameless) dummies. FoSSaCS 2022: 389-408 - [i12]Marco Maggesi, Cosimo Perini Brogi:
A theorem prover and countermodel constructor for provability logic in HOL Light. CoRR abs/2205.03659 (2022) - [i11]André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi:
Variable binding and substitution for (nameless) dummies. CoRR abs/2209.02614 (2022) - 2021
- [j7]Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
Presentable signatures and initial semantics. Log. Methods Comput. Sci. 17(2) (2021) - [j6]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niccolò Veltri, Niels van der Weide:
Bicategories in univalent foundations. Math. Struct. Comput. Sci. 31(10): 1232-1269 (2021) - [c7]Marco Maggesi, Cosimo Perini Brogi:
A Formal Proof of Modal Completeness for Provability Logic. ITP 2021: 26:1-26:18 - [i10]Marco Maggesi, Cosimo Perini Brogi:
A formal proof of modal completeness for provability logic. CoRR abs/2102.05945 (2021) - [i9]Gianluca Amato, Marco Maggesi, Cosimo Perini Brogi:
Universal Algebra in UniMath. CoRR abs/2102.05952 (2021) - 2020
- [j5]Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
Reduction monads and their signatures. Proc. ACM Program. Lang. 4(POPL): 31:1-31:29 (2020) - [i8]Marco Maggesi, Massimo Nocentini:
Kanren Light: A Dynamically Semi-Certified Interactive Logic Programming System. CoRR abs/2007.04691 (2020) - [i7]Gianluca Amato, Marco Maggesi, Maurizio Parton, Cosimo Perini Brogi:
Universal Algebra in UniMath. CoRR abs/2007.04840 (2020)
2010 – 2019
- 2019
- [c6]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide:
Bicategories in Univalent Foundations. FSCD 2019: 5:1-5:17 - [c5]Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
Modular Specification of Monads Through Higher-Order Presentations. FSCD 2019: 6:1-6:19 - [i6]Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
Modular specification of monads through higher-order presentations. CoRR abs/1903.00922 (2019) - [i5]Benedikt Ahrens, Dan Frumin, Marco Maggesi, Niels van der Weide:
Bicategories in Univalent Foundations. CoRR abs/1903.01152 (2019) - [i4]Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
Reduction Monads and Their Signatures. CoRR abs/1911.06391 (2019) - 2018
- [j4]Marco Maggesi:
A Formalization of Metric Spaces in HOL Light. J. Autom. Reason. 60(2): 237-254 (2018) - [c4]Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
High-Level Signatures and Initial Semantics. CSL 2018: 4:1-4:22 - [i3]Benedikt Ahrens, André Hirschowitz, Ambroise Lafont, Marco Maggesi:
High-level signatures and initial semantics. CoRR abs/1805.03740 (2018) - 2017
- [c3]Andrea Gabrielli, Marco Maggesi:
Formalizing Basic Quaternionic Analysis. ITP 2017: 225-240 - 2012
- [j3]André Hirschowitz, Marco Maggesi:
Nested Abstract Syntax in Coq. J. Autom. Reason. 49(3): 409-426 (2012) - [c2]André Hirschowitz, Marco Maggesi:
Initial Semantics for Strengthened Signatures. FICS 2012: 31-38 - 2011
- [j2]Gianni Ciolli, Graziano Gentili, Marco Maggesi:
A Certified Proof of the Cartan Fixed Point Theorems. J. Autom. Reason. 47(3): 319-336 (2011) - 2010
- [j1]André Hirschowitz, Marco Maggesi:
Modules over monads and initial semantics. Inf. Comput. 208(5): 545-564 (2010)
2000 – 2009
- 2007
- [c1]André Hirschowitz, Marco Maggesi:
Modules over Monads and Linearity. WoLLIC 2007: 218-237 - [i2]André Hirschowitz, Marco Maggesi:
The algebraicity of the lambda-calculus. CoRR abs/0704.2900 (2007) - 2006
- [i1]André Hirschowitz, Marco Maggesi:
Modules over Monads and Linearity. CoRR abs/cs/0608051 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:15 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
