Flávio L. C. de Moura

Orcid: 0000-0002-9390-5751

According to our database1, Flávio L. C. de Moura authored at least 16 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Formalized Extension of the Substitution Lemma in Coq.
Proceedings of the Proceedings 7th Symposium on Working Formal Methods, 2023

2019
The Computational Relevance of Formal Logic Through Formal Proofs.
Proceedings of the Formal Methods Teaching - Third International Workshop and Tutorial, 2019

2017
Applied Logic for Computer Scientists - Computational Deduction and Formal Proofs
Undergraduate Topics in Computer Science, Springer, ISBN: 978-3-319-51653-0, 2017

2016
Unification for \lambda -calculi Without Propagation Rules.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2016, 2016

2014
First-order unification in the PVS proof assistant.
Log. J. IGPL, 2014

Formalizing a Named Explicit Substitutions Calculus in Coq.
Proceedings of the Joint Proceedings of the MathUI, 2014

Metaconfluence of Calculi with Explicit Substitutions at a Distance.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2011
A Formalization of the Theorem of Existence of First-Order Most General Unifiers
Proceedings of the Proceedings 6th Workshop on Logical and Semantic Frameworks with Applications, 2011

2010
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi.
Proceedings of the Fifth Logical and Semantic Frameworks, with Applications Workshop, 2010

Verification of the Completeness of Unification Algorithms à la Robinson.
Proceedings of the Logic, 2010

2008
Higher-Order Unification: A structural relation between Huet's method and the one based on explicit substitutions.
J. Appl. Log., 2008

2006
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi.
J. Appl. Non Class. Logics, 2006

2005
Comparing and implementing calculi of explicit substitutions with eta-reduction.
Ann. Pure Appl. Log., 2005

2004
Second-Order Matching via Explicit Substitutions.
Proceedings of the Logic for Programming, 2004

Understanding Higher Order Unification via Explicit Substitutions and Patterns.
Proceedings of the Contributions to the Doctoral Programme of the 2nd International Joint Conference on Automated Reasoning, 2004

2002
Comparing Calculi of Explicit Substitutions with Eta-reduction.
Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002


  Loading...