| Nominal rewriting M Fernández, MJ Gabbay Information and Computation 205 (6), 917-965, 2007 | 226* | 2007 |
| Modularity of strong normalization in the algebraic-λ-cube F Barbanera, M Fernández, H Geuvers Journal of Functional Programming 7 (6), 613-660, 1997 | 131* | 1997 |
| Strategic port graph rewriting: an interactive modelling framework M Fernández, H Kirchner, B Pinaud Mathematical Structures in Computer Science 29 (5), 615-662, 2019 | 122* | 2019 |
| A metamodel of access control for distributed environments: Applications and properties C Bertolissi, M Fernández Information and Computation 238, 187-207, 2014 | 84* | 2014 |
| Models of computation: an introduction to computability theory M Fernández Springer Science & Business Media, 2009 | 81 | 2009 |
| Closed reduction: explicit substitutions without-conversion M Fernández, I Mackie, FR Sinot Mathematical Structures in Computer Science 15 (2), 343-381, 2005 | 72* | 2005 |
| A calculus for interaction nets M Fernández, I Mackie International Conference on Principles and Practice of Declarative …, 1999 | 71 | 1999 |
| Dynamic event-based access control as term rewriting C Bertolissi, M Fernández, S Barker IFIP Annual Conference on Data and Applications Security and Privacy, 195-210, 2007 | 70 | 2007 |
| A polynomial nominal unification algorithm C Calvès, M Fernández Theoretical Computer Science 403 (2-3), 285-306, 2008 | 67* | 2008 |
| Modular termination of term rewriting systems revisited M Fernández, JP Jouannaud Workshop on the Specification of Abstract Data Types, 255-272, 1994 | 66 | 1994 |
| Matching and alpha-equivalence check for nominal terms C Calvès, M Fernández Journal of Computer and System Sciences 76 (5), 283-301, 2010 | 59* | 2010 |
| Normalization results for typeable rewrite systems S van Bakel, M Fernández Information and Computation 133 (2), 73-116, 1997 | 58* | 1997 |
| Term rewriting for access control S Barker, M Fernández IFIP Annual Conference on Data and Applications Security and Privacy, 179-193, 2006 | 57 | 2006 |
| Combining first and higher order rewrite systems with type assignment systems F Barbanera, M Fernández International Conference on Typed Lambda Calculi and Applications, 60-74, 1993 | 56* | 1993 |
| Programming languages and operational semantics: a concise overview M Fernández Springer, 2014 | 52* | 2014 |
| Gödel’s system T revisited S Alves, M Fernández, M Florido, I Mackie Theoretical Computer Science 411 (11-13), 1484-1500, 2010 | 52* | 2010 |
| A graph-based framework for the analysis of access control policies S Alves, M Fernández Theoretical Computer Science 685, 3-22, 2017 | 46* | 2017 |
| A rewriting framework for the composition of access control policies C Bertolissi, M Fernández Proceedings of the 10th international ACM SIGPLAN conference on Principles …, 2008 | 43 | 2008 |
| Interaction nets and term-rewriting systems M Fernández, I Mackie Theoretical Computer Science 190 (1), 3-39, 1998 | 42* | 1998 |
| Lambda-calculus with director strings M Fernández, I Mackie, FR Sinot Applicable Algebra in Engineering, Communication and Computing 15, 393-437, 2005 | 38* | 2005 |
Mauricio Ayala RinconProfessor of Computer Science and Mathematics, Universidade de BrasiliaПотвърден имейл адрес: unb.br
