×

zbMATH — the first resource for mathematics

Ayala-Rincón, Mauricio

Compute Distance To:
Author ID: ayala-rincon.mauricio Recent zbMATH articles by "Ayala-Rincón, Mauricio"
Published as: Ayala Rincón, Mauricio; Ayala-Rincon, Mauricio; Ayala-Rincón, M.; Ayala-Rincón, Mauricio; Ayala-Rincón, Maurício
External Links: ORCID
Documents Indexed: 63 Publications since 1997, including 8 Books

Publications by Year

Citations contained in zbMATH Open

28 Publications have been cited 65 times in 32 Documents Cited by Year
Unification via the \(\lambda s_e\)-style of explicit substitutions. Zbl 0987.03012
Ayala-Rincón, Mauricio; Kamareddine, Fairouz
7
2001
Type soundness for path polymorphism. Zbl 1390.68170
Viso, Andrés; Bonelli, Eduardo; Ayala-Rincón, Mauricio
4
2016
Checking overlaps of nominal rewriting rules. Zbl 1401.68131
Ayala-Rincón, Mauricio; Fernández, Maribel; Gabbay, Murdoch James; Rocha-Oliveira, Ana Cristina
4
2016
Nominal narrowing. Zbl 1387.68142
Ayala-Rincón, Mauricio; Fernández, Maribel; Nantes-Sobrinho, Daniele
4
2016
A formalization of the Knuth-Bendix(-Huet) critical pair theorem. Zbl 1207.68338
Galdino, André L.; Ayala-Rincón, Mauricio
4
2010
Nominal C-unification. Zbl 06932833
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele
3
2018
A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols. Zbl 1401.68273
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele
3
2017
On solving nominal fixpoint equations. Zbl 06821635
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele
3
2017
Completeness in PVS of a nominal unification algorithm. Zbl 1394.68348
Ayala-Rincón, Mauricio; Fernández, Maribel; Rocha-Oliveira, Ana Cristina
3
2016
A formalization of Newman’s and Yokouchi’s lemmas in a higher-order language. Zbl 1171.68713
Galdino, André Luiz; Ayala-Rincón, Mauricio
3
2008
Comparing and implementing calculi of explicit substitutions with eta-reduction. Zbl 1067.03042
Ayala-Rincón, Mauricio; de Moura, Flávio L. C.; Kamareddine, Fairouz
3
2005
On applying the \(\lambda s_e\)-style of unification for simply-typed higher order unification. Zbl 1073.03007
Ayala-Rincón, Mauricio; Kamareddine, Fairouz
3
2003
A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols. Zbl 1423.68405
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele; Rocha-Oliveira, Ana Cristina
2
2019
Higher-order unification: a structural relation between Huet’s method and the one based on explicit substitutions. Zbl 1138.03014
de Moura, Flávio L. C.; Ayala-Rincón, Mauricio; Kamareddine, Fairouz
2
2008
A variant of the Ford-Johnson algorithm that is more space efficient. Zbl 1184.68660
Ayala-Rincón, Mauricio; de Abreu, Bruno T.; de Siqueira, José
2
2007
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi. Zbl 1184.68469
de Moura, F. L. C.; Ayala-Rincón, M.; Kamareddine, F.
2
2006
Second-order matching via explicit substitutions. Zbl 1108.03308
de Moura, Flávio L. C.; Kamareddine, Fairouz; Ayala-Rincón, Mauricio
2
2005
A formalisation of nominal C-matching through unification with protected variables. Zbl 1433.68186
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele
1
2019
Typed path polymorphism. Zbl 1423.68089
Ayala-Rincón, Mauricio; Bonelli, Eduardo; Edi, Juan; Viso, Andrés
1
2019
On the average number of reversals needed to sort signed permutations. Zbl 1375.05009
de Lima, Thaynara Arielly; Ayala-Rincón, Mauricio
1
2018
Intruder deduction problem for locally stable theories with normal forms and inverses. Zbl 1386.68078
Ayala-Rincón, Mauricio; Fernández, Maribel; Nantes-Sobrinho, Daniele
1
2017
Explicit substitution calculi with de Bruijn indices and intersection type systems. Zbl 1405.03037
Ventura, Daniel Lima; Kamareddine, Fairouz; Ayala-Rincón, Mauricio
1
2015
Metaconfluence of calculi with explicit substitutions at a distance. Zbl 1360.68324
De Moura, Flávio L. C.; Kesner, Delia; Ayala-Rincón, Mauricio
1
2014
Reduction of the intruder deduction problem into equational elementary deduction for electronic purse protocols with blind signatures. Zbl 1253.94074
Sobrinho, Daniele Nantes; Ayala-Rincón, Mauricio
1
2010
A PVS theory for term rewriting systems. Zbl 1310.68124
L. Galdino, André; Ayala-Rincón, Mauricio
1
2009
Parallel Smith-Waterman algorithm for local DNA comparison in a cluster of workstations. Zbl 1121.68463
Boukerche, Azzedine; Magalhaes Alves de Melo, Alba Cristina; Ayala-Rincon, Mauricio; Santana, Thomas M.
1
2005
A linear time lower bound on McCreight and general updating algorithms for suffix trees. Zbl 1069.68548
Ayala-Rincón, Mauricio; Conejo, Paulo D.
1
2003
A deductive calculus for conditional equational systems with built-in predicates as premises. Zbl 0918.68066
Ayala-Rincón, Mauricio
1
1997
A formalisation of nominal \(\alpha\)-equivalence with A, C, and AC function symbols. Zbl 1423.68405
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele; Rocha-Oliveira, Ana Cristina
2
2019
A formalisation of nominal C-matching through unification with protected variables. Zbl 1433.68186
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele
1
2019
Typed path polymorphism. Zbl 1423.68089
Ayala-Rincón, Mauricio; Bonelli, Eduardo; Edi, Juan; Viso, Andrés
1
2019
Nominal C-unification. Zbl 06932833
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele
3
2018
On the average number of reversals needed to sort signed permutations. Zbl 1375.05009
de Lima, Thaynara Arielly; Ayala-Rincón, Mauricio
1
2018
A formalisation of nominal \(\alpha\)-equivalence with A and AC function symbols. Zbl 1401.68273
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele
3
2017
On solving nominal fixpoint equations. Zbl 06821635
Ayala-Rincón, Mauricio; de Carvalho-Segundo, Washington; Fernández, Maribel; Nantes-Sobrinho, Daniele
3
2017
Intruder deduction problem for locally stable theories with normal forms and inverses. Zbl 1386.68078
Ayala-Rincón, Mauricio; Fernández, Maribel; Nantes-Sobrinho, Daniele
1
2017
Type soundness for path polymorphism. Zbl 1390.68170
Viso, Andrés; Bonelli, Eduardo; Ayala-Rincón, Mauricio
4
2016
Checking overlaps of nominal rewriting rules. Zbl 1401.68131
Ayala-Rincón, Mauricio; Fernández, Maribel; Gabbay, Murdoch James; Rocha-Oliveira, Ana Cristina
4
2016
Nominal narrowing. Zbl 1387.68142
Ayala-Rincón, Mauricio; Fernández, Maribel; Nantes-Sobrinho, Daniele
4
2016
Completeness in PVS of a nominal unification algorithm. Zbl 1394.68348
Ayala-Rincón, Mauricio; Fernández, Maribel; Rocha-Oliveira, Ana Cristina
3
2016
Explicit substitution calculi with de Bruijn indices and intersection type systems. Zbl 1405.03037
Ventura, Daniel Lima; Kamareddine, Fairouz; Ayala-Rincón, Mauricio
1
2015
Metaconfluence of calculi with explicit substitutions at a distance. Zbl 1360.68324
De Moura, Flávio L. C.; Kesner, Delia; Ayala-Rincón, Mauricio
1
2014
A formalization of the Knuth-Bendix(-Huet) critical pair theorem. Zbl 1207.68338
Galdino, André L.; Ayala-Rincón, Mauricio
4
2010
Reduction of the intruder deduction problem into equational elementary deduction for electronic purse protocols with blind signatures. Zbl 1253.94074
Sobrinho, Daniele Nantes; Ayala-Rincón, Mauricio
1
2010
A PVS theory for term rewriting systems. Zbl 1310.68124
L. Galdino, André; Ayala-Rincón, Mauricio
1
2009
A formalization of Newman’s and Yokouchi’s lemmas in a higher-order language. Zbl 1171.68713
Galdino, André Luiz; Ayala-Rincón, Mauricio
3
2008
Higher-order unification: a structural relation between Huet’s method and the one based on explicit substitutions. Zbl 1138.03014
de Moura, Flávio L. C.; Ayala-Rincón, Mauricio; Kamareddine, Fairouz
2
2008
A variant of the Ford-Johnson algorithm that is more space efficient. Zbl 1184.68660
Ayala-Rincón, Mauricio; de Abreu, Bruno T.; de Siqueira, José
2
2007
SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi. Zbl 1184.68469
de Moura, F. L. C.; Ayala-Rincón, M.; Kamareddine, F.
2
2006
Comparing and implementing calculi of explicit substitutions with eta-reduction. Zbl 1067.03042
Ayala-Rincón, Mauricio; de Moura, Flávio L. C.; Kamareddine, Fairouz
3
2005
Second-order matching via explicit substitutions. Zbl 1108.03308
de Moura, Flávio L. C.; Kamareddine, Fairouz; Ayala-Rincón, Mauricio
2
2005
Parallel Smith-Waterman algorithm for local DNA comparison in a cluster of workstations. Zbl 1121.68463
Boukerche, Azzedine; Magalhaes Alves de Melo, Alba Cristina; Ayala-Rincon, Mauricio; Santana, Thomas M.
1
2005
On applying the \(\lambda s_e\)-style of unification for simply-typed higher order unification. Zbl 1073.03007
Ayala-Rincón, Mauricio; Kamareddine, Fairouz
3
2003
A linear time lower bound on McCreight and general updating algorithms for suffix trees. Zbl 1069.68548
Ayala-Rincón, Mauricio; Conejo, Paulo D.
1
2003
Unification via the \(\lambda s_e\)-style of explicit substitutions. Zbl 0987.03012
Ayala-Rincón, Mauricio; Kamareddine, Fairouz
7
2001
A deductive calculus for conditional equational systems with built-in predicates as premises. Zbl 0918.68066
Ayala-Rincón, Mauricio
1
1997

Citations by Year