default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilmer Ricciotti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c17]Wilmer Ricciotti
:
Comprehending queries over finite maps. PPDP 2023: 8:1-8:12- 2022
- [j9]Wilmer Ricciotti, James Cheney:
A Formalization of SQL with Nulls. J. Autom. Reason. 66(4): 989-1030 (2022) - [j8]Wilmer Ricciotti, James Cheney:
Strongly-Normalizing Higher-Order Relational Queries. Log. Methods Comput. Sci. 18(3) (2022) - 2021
- [c16]James Cheney, Wilmer Ricciotti:
Comprehending nulls. DBPL 2021: 3-6 - [c15]Wilmer Ricciotti, James Cheney:
Query Lifting - Language-integrated query for heterogeneous nested collections. ESOP 2021: 579-606 - [i10]Wilmer Ricciotti, James Cheney:
Query Lifting: Language-integrated query for heterogeneous nested collections. CoRR abs/2101.04102 (2021) - [i9]James Cheney, Wilmer Ricciotti:
Comprehending nulls. CoRR abs/2107.11347 (2021) - 2020
- [c14]Wilmer Ricciotti, James Cheney:
Strongly Normalizing Higher-Order Relational Queries. FSCD 2020: 28:1-28:22 - [i8]Wilmer Ricciotti, James Cheney:
A Formalization of SQL with Nulls. CoRR abs/2003.11331 (2020) - [i7]Wilmer Ricciotti, James Cheney:
Strongly-Normalizing Higher-Order Relational Queries. CoRR abs/2011.13451 (2020)
2010 – 2019
- 2019
- [c13]Wilmer Ricciotti, James Cheney:
Mixing set and bag semantics. DBPL 2019: 70-73 - [i6]Wilmer Ricciotti, James Cheney:
Mixing set and bag semantics. CoRR abs/1905.02069 (2019) - 2018
- [c12]Wilmer Ricciotti, James Cheney:
Explicit Auditing. ICTAC 2018: 376-395 - [i5]Wilmer Ricciotti, James Cheney:
Explicit Auditing. CoRR abs/1808.00486 (2018) - 2017
- [j7]Wilmer Ricciotti, Jan Stolarek, Roly Perera, James Cheney:
Imperative functional programs that explain their work. Proc. ACM Program. Lang. 1(ICFP): 14:1-14:28 (2017) - [c11]Wilmer Ricciotti, James Cheney:
Strongly Normalizing Audited Computation. CSL 2017: 36:1-36:21 - [c10]Wilmer Ricciotti:
A core calculus for provenance inspection. PPDP 2017: 187-198 - [i4]Wilmer Ricciotti, Jan Stolarek, Roly Perera, James Cheney:
Imperative Functional Programs that Explain their Work. CoRR abs/1705.07678 (2017) - [i3]Wilmer Ricciotti, James Cheney:
Strongly Normalizing Audited Computation. CoRR abs/1706.03711 (2017) - 2015
- [j6]Andrea Asperti, Wilmer Ricciotti:
A formalization of multi-tape Turing machines. Theor. Comput. Sci. 603: 23-42 (2015) - [c9]Wilmer Ricciotti:
Binding Structures as an Abstract Data Type. ESOP 2015: 762-786 - [c8]Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker:
Abstracting an Operational Semantics to Finite Automata. ICTERI (Revised Selected Papers) 2015: 109-123 - [c7]Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker:
Abstracting an Operational Semantics to Finite Automata. ICTERI 2015: 354-365 - 2014
- [j5]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen:
Matita Tutorial. J. Formaliz. Reason. 7(2): 91-199 (2014) - [i2]Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker:
Abstracting an operational semantics to finite automata. CoRR abs/1409.7841 (2014) - 2012
- [j4]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions. Log. Methods Comput. Sci. 8(1) (2012) - [j3]Randy Pollack, Masahiko Sato, Wilmer Ricciotti:
A Canonical Locally Named Representation of Binding. J. Autom. Reason. 49(2): 185-207 (2012) - [j2]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover. J. Autom. Reason. 49(3): 427-451 (2012) - [j1]Andrea Asperti, Wilmer Ricciotti:
A proof of Bertrand's postulate. J. Formaliz. Reason. 5(1): 37-57 (2012) - [c6]Andrea Asperti, Wilmer Ricciotti:
A Web Interface for Matita. AISC/MKM/Calculemus 2012: 417-421 - [c5]Andrea Asperti, Wilmer Ricciotti:
Rating Disambiguation Errors. CPP 2012: 240-255 - [c4]Andrea Asperti, Wilmer Ricciotti:
Formalizing Turing Machines. WoLLIC 2012: 1-25 - [i1]Andrea Asperti, Wilmer Ricciotti:
A Web Interface for Matita. CoRR abs/1207.2892 (2012) - 2011
- [b1]Wilmer Ricciotti:
Theoretical and implementation aspects in the mechanization of the metatheory of programming languages. University of Bologna, Italy, 2011 - [c3]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
The Matita Interactive Theorem Prover. CADE 2011: 64-69
2000 – 2009
- 2009
- [c2]Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi:
Hints in Unification. TPHOLs 2009: 84-98 - 2008
- [c1]Andrea Asperti, Wilmer Ricciotti:
About the Formalization of Some Results by Chebyshev in Number Theory. TYPES 2008: 19-31
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-04-24 23:04 CEST 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:
