Wilmer Ricciotti

Proceedings of the International Symposium on Principles and Practice of Declarative Programming, 2023

2022

Strongly-Normalizing Higher-Order Relational Queries.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2022

A Formalization of SQL with Nulls.

[BibT_eX]

[DOI]

J. Autom. Reason., 2022

2021

Query Lifting - Language-integrated query for heterogeneous nested collections.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2021

Comprehending nulls.

[BibT_eX]

[DOI]

Proceedings of the DBPL '21: The 18th International Symposium on Database Programming Languages, 2021

2019

Mixing set and bag semantics.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM SIGPLAN International Symposium on Database Programming Languages, 2019

2018

Explicit Auditing.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

2017

Imperative functional programs that explain their work.

[BibT_eX]

[DOI]

Proc. ACM Program. Lang., 2017

A core calculus for provenance inspection.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

Strongly Normalizing Audited Computation.

[BibT_eX]

[DOI]

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2015

A formalization of multi-tape Turing machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Abstracting an Operational Semantics to Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Information and Communication Technologies in Education, Research, and Industrial Applications, 2015

Binding Structures as an Abstract Data Type.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2015

2014

Matita Tutorial.

[BibT_eX]

[DOI]

J. Formaliz. Reason., 2014

2012

A proof of Bertrand's postulate.

[BibT_eX]

[DOI]

J. Formaliz. Reason., 2012

A Canonical Locally Named Representation of Binding.

[BibT_eX]

[DOI]

Randy Pollack

Masahiko Sato

J. Autom. Reason., 2012

Formal Metatheory of Programming Languages in the Matita Interactive Theorem Prover.

[BibT_eX]

[DOI]

J. Autom. Reason., 2012

A Bi-Directional Refinement Algorithm for the Calculus of (Co)Inductive Constructions

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2012

Formalizing Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information and Computation, 2012

Rating Disambiguation Errors.

[BibT_eX]

[DOI]

Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

A Web Interface for Matita.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - 11th International Conference, 2012

2011

Theoretical and implementation aspects in the mechanization of the metatheory of programming languages.

[BibT_eX]

[DOI]

PhD thesis, 2011

The Matita Interactive Theorem Prover.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-23 - 23rd International Conference on Automated Deduction, Wroclaw, Poland, July 31, 2011

2009

Hints in Unification.

[BibT_eX]

[DOI]

Proceedings of the Theorem Proving in Higher Order Logics, 22nd International Conference, 2009

2008

About the Formalization of Some Results by Chebyshev in Number Theory.

[BibT_eX]

[DOI]