Wilmer Ricciotti

37 papers A 3B 3C 4Misc 1Journal 19Unranked 6
YearRankTypeTitle / Venue / Authors
2023 C conf
Comprehending queries over finite maps.
PPDP
Wilmer Ricciotti
2022 J jnl
A Formalization of SQL with Nulls.
J. Autom. Reason.
Wilmer Ricciotti, James Cheney
2022 J jnl
Strongly-Normalizing Higher-Order Relational Queries.
Log. Methods Comput. Sci.
Wilmer Ricciotti, James Cheney
2021 — conf
Comprehending nulls.
DBPL
James Cheney, Wilmer Ricciotti
2021 J jnl
Comprehending nulls.
CoRR
James Cheney, Wilmer Ricciotti
2021 A conf
Query Lifting - Language-integrated query for heterogeneous nested collections.
ESOP
Wilmer Ricciotti, James Cheney
2021 J jnl
Query Lifting: Language-integrated query for heterogeneous nested collections.
CoRR
Wilmer Ricciotti, James Cheney
2020 J jnl
A Formalization of SQL with Nulls.
CoRR
Wilmer Ricciotti, James Cheney
2020 B conf
Strongly Normalizing Higher-Order Relational Queries.
FSCD
Wilmer Ricciotti, James Cheney
2020 J jnl
Strongly-Normalizing Higher-Order Relational Queries.
CoRR
Wilmer Ricciotti, James Cheney
2019 — conf
Mixing set and bag semantics.
DBPL
Wilmer Ricciotti, James Cheney
2019 J jnl
Mixing set and bag semantics.
CoRR
Wilmer Ricciotti, James Cheney
2018 C conf
Explicit Auditing.
ICTAC
Wilmer Ricciotti, James Cheney
2018 J jnl
Explicit Auditing.
CoRR
Wilmer Ricciotti, James Cheney
2017 C conf
A core calculus for provenance inspection.
PPDP
Wilmer Ricciotti
2017 J jnl
Imperative Functional Programs that Explain their Work.
CoRR
Wilmer Ricciotti, Jan Stolarek, Roly Perera, James Cheney
2017 J jnl
Imperative functional programs that explain their work.
Proc. ACM Program. Lang.
Wilmer Ricciotti, Jan Stolarek, Roly Perera, James Cheney
2017 B conf
Strongly Normalizing Audited Computation.
CSL
Wilmer Ricciotti, James Cheney
2017 J jnl
Strongly Normalizing Audited Computation.
CoRR
Wilmer Ricciotti, James Cheney
2015 J jnl
A formalization of multi-tape Turing machines.
Theor. Comput. Sci.
Andrea Asperti, Wilmer Ricciotti
2015 Misc conf
Abstracting an Operational Semantics to Finite Automata.
ICTERI
Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker
2015 — conf
Abstracting an Operational Semantics to Finite Automata.
ICTERI (Revised Selected Papers)
Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker
2015 A conf
Binding Structures as an Abstract Data Type.
ESOP
Wilmer Ricciotti
2014 J jnl
Abstracting an operational semantics to finite automata.
CoRR
Nadezhda Baklanova, Wilmer Ricciotti, Jan-Georg Smaus, Martin Strecker
2014 J jnl
Matita Tutorial.
J. Formaliz. Reason.
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen
2012 J jnl
A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions
Log. Methods Comput. Sci.
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
2012 J jnl
A Canonical Locally Named Representation of Binding.
J. Autom. Reason.
Randy Pollack, Masahiko Sato, Wilmer Ricciotti
2012 J jnl
A Web Interface for Matita
CoRR
Andrea Asperti, Wilmer Ricciotti
2012 — conf
A Web Interface for Matita.
AISC/MKM/Calculemus
Andrea Asperti, Wilmer Ricciotti
2012 J jnl
A proof of Bertrand's postulate.
J. Formaliz. Reason.
Andrea Asperti, Wilmer Ricciotti
2012 J jnl
Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover.
J. Autom. Reason.
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
2012 C conf
Formalizing Turing Machines.
WoLLIC
Andrea Asperti, Wilmer Ricciotti
2012 B conf
Rating Disambiguation Errors.
CPP
Andrea Asperti, Wilmer Ricciotti
2011 A conf
The Matita Interactive Theorem Prover.
CADE
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
2011 — —
Theoretical and implementation aspects in the mechanization of the metatheory of programming languages.
Wilmer Ricciotti
2009 — conf
Hints in Unification.
TPHOLs
Andrea Asperti, Wilmer Ricciotti, Claudio Sacerdoti Coen, Enrico Tassi
2008 — conf
About the Formalization of Some Results by Chebyshev in Number Theory.
TYPES
Andrea Asperti, Wilmer Ricciotti