default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlávio L. C. de Moura
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c11]Maria J. D. Lima, Flávio L. C. de Moura:
A Formalized Extension of the Substitution Lemma in Coq. FROM 2023: 80-95
2010 – 2019
- 2019
- [c10]Ariane Alves Almeida
, Ana Cristina Rocha Oliveira, Thiago Mendonça Ferreira Ramos, Flávio L. C. de Moura, Mauricio Ayala-Rincón:
The Computational Relevance of Formal Logic Through Formal Proofs. FMTea 2019: 81-96 - 2017
- [b1]Mauricio Ayala-Rincón, Flávio L. C. de Moura:
Applied Logic for Computer Scientists - Computational Deduction and Formal Proofs. Undergraduate Topics in Computer Science, Springer 2017, ISBN 978-3-319-51651-6, pp. 1-143 - 2016
- [c9]Flávio L. C. de Moura:
Unification for \lambda -calculi Without Propagation Rules. ICTAC 2016: 179-195 - 2014
- [j4]Andréia Borges Avelar, André Luiz Galdino, Flávio Leonardo Cavalcanti de Moura, Mauricio Ayala-Rincón:
First-order unification in the PVS proof assistant. Log. J. IGPL 22(5): 758-789 (2014) - [c8]Flávio L. C. de Moura, Delia Kesner, Mauricio Ayala-Rincón:
Metaconfluence of Calculi with Explicit Substitutions at a Distance. FSTTCS 2014: 391-402 - [c7]Washington de Carvalho Segundo, Flávio L. C. de Moura, Daniel Ventura:
Formalizing a Named Explicit Substitutions Calculus in Coq. CICM Workshops 2014 - 2011
- [c6]Andréia B. Avelar, André Luiz Galdino, Flávio L. C. de Moura, Mauricio Ayala-Rincón:
A Formalization of the Theorem of Existence of First-Order Most General Unifiers. LSFA 2011: 63-78 - 2010
- [c5]Andréia B. Avelar, Flávio L. C. de Moura, André Luiz Galdino, Mauricio Ayala-Rincón:
Verification of the Completeness of Unification Algorithms à la Robinson. WoLLIC 2010: 110-124 - [c4]Flávio L. C. de Moura, A. V. Barbosa, Mauricio Ayala-Rincón, Fairouz Kamareddine:
A Flexible Framework for Visualisation of Computational Properties of General Explicit Substitutions Calculi. LSFA 2010: 41-54
2000 – 2009
- 2008
- [j3]Flávio L. C. de Moura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Higher-Order Unification: A structural relation between Huet's method and the one based on explicit substitutions. J. Appl. Log. 6(1): 72-108 (2008) - 2006
- [j2]Flávio L. C. de Moura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi. J. Appl. Non Class. Logics 16(1-2): 119-150 (2006) - 2005
- [j1]Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine:
Comparing and implementing calculi of explicit substitutions with eta-reduction. Ann. Pure Appl. Log. 134(1): 5-41 (2005) - 2004
- [c3]Flávio L. C. de Moura:
Understanding Higher Order Unification via Explicit Substitutions and Patterns. IJCAR Doctoral Programme 2004 - [c2]Flávio L. C. de Moura, Fairouz Kamareddine, Mauricio Ayala-Rincón:
Second-Order Matching via Explicit Substitutions. LPAR 2004: 433-448 - 2002
- [c1]Mauricio Ayala-Rincón, Flávio L. C. de Moura, Fairouz Kamareddine:
Comparing Calculi of Explicit Substitutions with Eta-reduction. WoLLIC 2002: 76-95
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-08-05 21:24 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:
