Publications of Maribel Fernandez

Theses:

• PhD Thesis: Multiparadigm computational models based on rewriting. University of Paris 11, 1993.
• Habilitation to Direct Research in Computer Science. Multiparadigm models: types, semantics, modularity. University of Paris 11, 2000.

Books:

• M. Fernandez. Programming Languages and Operational Semantics. Texts in Computing, Volume 1. King's College Publications, 2004. ISBN 0-9543006-3-7.
• M. Fernandez. Models of computation - An introduction to computability theory. Springer, UTiCS series, 2009. ISBN-10: 1848824335, ISBN-13: 978-1848824331

Edited Journal Special Issues and Conference Proceedings:

M. Fernández and C. Urban, editors. Theory and Applications of Abstraction, Substitution and Naming. Special issue of the International Journal on Automated Reasoning, 2011.

M. Fernández, T. Kutsia and W. Schreiner (eds.). Principles and Practice of Declarative Programming, Proceedings of the 12th International ACM SIGPLAN Symposium PPDP 2010. Hagenberg, Austria, July 2010. ACM Press.

M. Fernández, editor. Proceedings of the 24th International Workshop on Unification. Electronic Proceedings in Theoretical Computer Science, Volume 42, DOI: 10.4204/EPTCS.42 ISSN: 2075-2180, December 2010.

M. Fernández and K. Steinhoefel (eds.). Proceedings of URC* 2010, UG Research in Computer Science - Theory and Applications. King's College London, March 2010. IFCOLOG, Volume 1, 2011.

M. Fernández, editor. Proceedings of the 9th International Workshop on Reduction Strategies in Rewriting and Programming. Electronic Proceedings in Theoretical Computer Science, Volume 15, DOI: 10.4204/EPTCS.15, ISSN: 2075-2180, January 2010.

H. Cirstea and M. Fernández, editors. Rewriting Calculi, Higher-order reductions and Patterns. Special issue of the Journal of Mathematical Structures in Computer Science, Volume 18, 2008. Cambridge University Press.

M. Fernández, I. Mackie, editors. More Developments in Computational Models, 2nd special issue of the Journal of Mathematical Structures in Computer Science, Volume 17(4), 2007. Cambridge University Press.

M. Fernández, C. Fox, S. Lappin, editors. Lambda-Calculus, Type Theory and Natural Language II, 2nd Special Issue of the Journal of Logic and Computation, Oxford University Press, 2007.

M. Fernández, I. Mackie, editors. Developments in Computational Models, Special issue of the Journal of Mathematical Structures in Computer Science, 16(4), 2006. Cambridge University Press.

M. Fernández, R. Lammel (editors). Proceedings of the 7th Int. Workshop on Rule Based Programming (RULE'06), Seattle, 2006. Electronic Notes in Theoretical Computer Science, Volume 174, Issue 1, April 2007. Elsevier.

M. Fernández, C. Kirchner (editors). Proceedings of the 1st Int. Workshop on Security and Rewriting Techniques (SecReT'06), Venice, 2006. Electronic Notes in Theoretical Computer Science, issue 4 of volume 171, 2007. Elsevier. http://dx.doi.org/10.1016/j.entcs.2007.02.052

M. Fernández and I. Mackie (editors). Proceedings of the 1st Int. Workshop on Developments in Computational Models (DCM'05), Lisbon, 2005. Issue 3 of Volume 135 of Electronic Notes in Theoretical Computer Science, Elsevier.

M. Fernández, C. Fox, S. Lappin, editors. Lambda-Calculus, Type Theory and Natural Language, Special Issue of the Journal of Logic and Computation, Oxford University Press, 2005.

M. Fernández (editor). Proceedings of the 2nd Int. Workshop on Term Graph Rewriting (TERMGRAPH'04), Rome, 2004. Volume 127, Issue 5, Pages 1-195, Electronic Notes in Theoretical Computer Science, Elsevier.

Papers:

• On term rewriting and security:

  Journals:

  C. Bertolissi and M. Fernández. Distributed Event-Based Access Control. International Journal of Information and Computer Security, Volume 3, Nos. 3/4, 2009. Inderscience. Special Issue, selected papers from Crisis 2008.

  C. Bertolissi and M. Fernández. A Meta-model of Access Control for Distributed Environments: Applications and Properties. Submitted, 2011.

  Conferences:

  C. Bertolissi and M. Fernández. Rewrite Specifications of Access Control Policies in Distributed Environments. Proceedings of the 6th International Workshop on Security and Trust Management (STM 2010), Athens, Greece, September 2010. Lecture Notes in Computer Science, Springer, 2010.
  pdf©Springer 2010.

  A. Ali and M. Fernández. A Programming Language with Role-Based Access Control. Proceedings of URC* 2010, UG Research in Computer Science - Theory and Applications, London, March 2010. College Publications.

  C. Bertolissi and M. Fernandez. Category-based authorisation models: operational semantics and expressive power. In Proceedings of the International Symposium on Engineering Secure Software and Systems, ESSOS 2010, Pisa, 2010. Lecture Notes in Computer Science, Springer, 2010.

  C. Bertolissi and M. Fernandez. A rewriting framework for the composition of access control policies. In Proceedings of the 10th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'08), Valencia, 2008. ACM Press.

  C. Bertolissi and M. Fernandez. An Algebraic-Functional Framework for Distributed Access Control. In Proceedings 3rd Int. Conf. on Risks and Security of Internet Systems (CRISIS), 2008, IEEEXplore.

  C. Bertolissi, M. Fernandez. Time and Location Based Services with Access Control. In Proceedings of the 2nd IFIP International Conference on New Technologies, Mobility and Security, IEEEXplore. Presented at the International Workshop on Service computing, Context-aware, Location-aware and Positioning techniques (SCLP'08), Tangier, Morocco, 2008. pdf

  S. Barker, C. Bertolissi, M. Fernandez. Action Control by Term Rewriting. 3rd Int. Workshop on Security and Rewriting Techniques (SecReT 2008), associated to LICS and CSF, Pittsburgh, June 2008. Volume 234, Electronic Notes in Theoretical Computer Science, Elsevier, 2009.

  C. Bertolissi, M. Fernandez, S. Barker. Dynamic Event-Based Access Control as Term Rewriting.
  Data and Applications Security XXI. 21st Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSEC 2007), Redondo Beach, CA, USA, July 8-11, 2007, Proceedings. LNCS 4602, Springer, 2007. pdf©Springer 2007.

  S. Barker, M. Fernandez. Action Status Access Control as Term Rewriting.
  2nd Int. Workshop on Security and Rewriting Techniques (SecReT 2007), RDP 2007, Paris, June 2007.

  S. Barker, M. Fernandez. Term rewriting for access control.
  Proceedings of the 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'2006), Sophia Antipolis, France, July 2006. LNCS, Springer, 2006. pdf©Springer 2006.

• On lambda-calculus, term rewriting, and types:

  Journals:

  M. Fernandez and N. Siafakas. Labelled calculi of resources. Special issue on Linearity, to appear in the Journal of Logic and Computation, OUP.
  pdf

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Linearity: A Roadmap. Special issue on Linearity, to appear in the Journal of Logic and Computation, OUP.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Linearity and Iterator Types for G"odel's System T.
  International Journal on Higher-Order and Symbolic Computation, Volume 23, Issue 1 (2011), Page 1-27, Springer.
  pdf©Springer.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Goedel's System T Revisited. Theoretical Computer Science, 2010. http://dx.doi.org/10.1016/j.tcs.2009.11.014
  pdf©Elsevier 2010.

  M. Fernandez, M.J. Gabbay. Nominal Rewriting. Information and Computation 205, pages 917-865, 2007.

  M. Fernandez, I. Mackie, F-R. Sinot. Closed Reduction: Explicit Substitutions without alpha-conversion.
  Mathematical Structures in Computer Science, volume 15, issue 02. Cambridge University Press, April 2005. Abstract
  Review by M. Dezani-Ciancaglini, MathSciNet

  M. Fernandez, I. Mackie, F-R. Sinot. Lambda-Calculus with Director Strings.
  Applicable Algebra in Engineering, Communication and Computing, Volume 15, Number 6, Pages 393 - 437, Springer-Verlag, 2005. Abstract.
  Review by M.W. Bunder, MathSciNet

  M. Fernandez, I. Mackie, P. Severi and N.Szasz. Reduction Strategies for Program Extraction.
  CLEI Electronic Journal, Volume 6(1), December 2003. Special Issue of Best Papers presented at CLEI'2002. Montevideo, Uruguay. Guest Editor: A. Viola.

  S. van Bakel and M. Fernandez. Normalization, Approximation, and Semantics for combinator systems.
  Theoretical Computer Science, 290(1), pages 975-1019, 2003. PostScript.
  Also available as Departmental Technical Report number 2000/10, Imperial College, London, 2000.
  Review by J.P. Seldin, MathSciNet

  S. van Bakel and M. Fernandez. Normalization Results for Typeable Rewrite Systems.
  Information and Computation, volume 133, number 2, pages 73-116, 1997. Abstract.

  F. Barbanera, M. Fernandez, H. Geuvers. Modularity of Strong Normalization in the algebraic lambda-cube.
  Journal of Functional Programming, volume 7, number 6, pages 613-660, 1997.
  Abstract.

  F. Barbanera, M. Fernandez. Intersection Type Assignment Systems with Algebraic Rewriting.
  Theoretical Computer Science, volume 170, pages 173-207, 1996. Abstract.
  Review by B. Venneri, MathSciNet

  Conferences:

  M. Fernandez, A. Rubio. Nominal Completion for Rewrite Systems with Binding. Proceedings of ICALP 2012, 39th International Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Springer.

  E. Fairweather, M. Fernandez, M.J. Gabbay. Principal Types for Nominal Theories. Proceedings of the 18th International Symposium on Fundamentals of Computation Theory (FCT 2011), Oslo, August 2011, Lecture Notes in Computer Science, Springer.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Linearity and Recursion in a Typed Lambda Calculus. Proceedings of the 13th International ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming} (PPDP 2011), Odense, 2011. ACM Press.

  M.Fernández and M.J. Gabbay. Closed nominal rewriting and efficiently computable nominal algebra equality. In Proceedings of the 5th International Workshop on Logical Frameworks and Meta-languages: Theory and Practice (LFMTP 2010), FLoC 2010. EPTCS 34, 2010. pdf

  M. Fernandez and N. Siafakas. Labelled lambda-calculi with explicit copy and erase. In Proceedings of Linearity 2009, Coimbra, Portugal, September 2009. In Proceedings of Linearity 2009, Coimbra, Portugal, September 2009. Electronic Proceedings in Theoretical Computer Science, Volume 22, DOI: 10.4204/EPTCS.22, ISSN: 2075-2180, 2010.

  M. Fernandez and N. Siafakas. New developments in abstract machines. In Proceedings of the 8th Workshop on Rewriting Strategies in Rewriting and Programming (WRS 2008), Castle Hagenberg, Austria, 2008. Electronic Notes in Theoretical Computer Science, Elsevier.
  pdf©Elsevier 2009.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Iterator Types
  In Proceedings of FOSSACS 2007, Braga, Portugal, March 2007. LNCS 4423, Springer, 2007. pdf©Springer 2007.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. Linear Recursive Functions
  Rewriting, Computation and Proof}, Essays dedicated to Jean-Pierre Jouannaud on the occasion of his 60th birthday. LNCS 4600 Festchrift, Springer, 2007.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. System T Revisited
  Workshop on Linear Logic, Ludics, Implicit Complexity and Operator Algebras: Dedicated to Jean-Yves Girard on his 60th birthday. Siena, Italy, 2007.

  M. Fernandez and M.J. Gabbay. Curry style types for nominal terms.
  In the Proceedings of TYPES 2006, Lecture Notes in Computer Science 4502, Springer, 2007. pdf©Springer 2007.

  S. Alves, M. Fernandez, M. Florido, I. Mackie. The power of linear functions.
  Proceedings of the Int. Conf. Computer Science Logic (CSL 2006), Szeged, Hungary , September 2006. LNCS 4207, Springer, 2006. pdf©Springer 2006.

  H. Cirstea, G. Faure, M. Fernandez, I. Mackie, F-R. Sinot. From functional programs to interaction nets via the rewriting calculus.
  Proceedings of the 6th International Workshop on Rewriting Strategies in Rewriting and Programming (WRS 2006), Electronic Notes in Theoretical Computer Science Volume 174, Issue 10, July 2007, Pages 39-56. Elsevier. http://dx.doi.org/10.1016/j.entcs.2007.02.046

  S. Alves, M. Fernandez, M. Florido, I. Mackie. The power of closed-reduction strategies.
  Proceedings of the 6th International Workshop on Rewriting Strategies in Rewriting and Programming (WRS 2006), Electronic Notes in Theoretical Computer Science Volume 174, Issue 10, July 2007, Pages 39-56. Elsevier. http://dx.doi.org/10.1016/j.entcs.2007.02.047

  M. Fernandez and M.J. Gabbay. Nominal Rewriting with Name Generation: Abstraction vs. Locality.
  Proc. of the 7th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'05), Lisbon, 2005. ACM Press. Postcript©ACM 2005.

  M. Fernandez, M.J. Gabbay and I. Mackie. Nominal Rewriting Systems.
  Proc. of the 6th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'04), Verona, 2004. ACM Press.Postcript©ACM 2004.

  F-R. Sinot, M. Fernandez and I. Mackie. Efficient Reductions with Director Strings.
  Proc. of the Int. Conference on Rewriting Techniques and Applications (RTA'03), Valencia, 2003. LNCS, Springer, 2003.Postcript©Springer 2003.

  M. Fernandez and I. Mackie. Call by value lambda-graph rewriting --- without rewriting.
  Proc. of the Int. Conference on Graph Transformations (ICGT'02), Barcelona, 2002. LNCS 2505, Springer, 2002.Postcript©Springer 2003.

  M. Fernandez and P. Severi. An operational approach to program extraction in the Calculus of Constructions
  Proc. of the Int. Workshop on Logic Based Program Development and Transformation (LOPSTR'02), Madrid, 2002. LNCS, Springer, 2002.Postcript©Springer 2002.

  M. Fernandez, I. Mackie, P. Severi and N.Szasz. A uniform approach to program extraction: Pure Type Systems with Ultra-Sigma Types.
  Proc. XXVIII Conferencia Latinoamericana de Informatica (CLEI'02), InfoUYclei, Montevideo, 2002.
  Eds. A. Viola, M. Lasarte, D. Perovich, M. Solari and A. Vignaga. ISBN: 9974-7704-1-6. Postcript.

  M. Fernandez and I. Mackie. Director Strings and Explicit Substitutions.
  Workshop on Explicit Substitutions and Applications, WESTAPP'01, Utrecht, 2001. Postcript.

  S. van Bakel, F. Barbanera, M. Fernandez. Polymorphic intersection type assignment for rewrite systems with abstraction and beta-rule.
  In Types for Proofs and Programs, Proceedings TYPES'99, LNCS 1956, Springer 2000. Postcript©Springer 2000.

  M. Fernandez and I. Mackie. Closed reductions in the lambda-calculus.
  Proceedings of CSL'99, Computer Science Logic, Madrid. LNCS 1683. 1999. Postcript©Springer 1999.

  S. van Bakel, F. Barbanera, M. Fernandez. Rewrite Systems with Abstraction and Beta-rule: Types, Approximants and Normalization.
  In Proceedings ESOP'96, Linkoping, Sweden, 1996. LNCS 1058. dvi©Springer 1996.

  S. van Bakel, M. Fernandez. Approximation and Normalization Results for Typable Term Rewriting Systems.
  In Proceedings HOA'95 (Higher-Order Algebra, Logic, and Term Rewriting), Paderborn, Germany, 1995. LNCS 1074. PostScript©Springer 1995.

  S. van Bakel, M. Fernandez. (Head-) Normalization of Typeable Rewrite Systems.
  In Proc. RTA'95, Kaiserslautern, 1995. LNCS 914. dvi©Springer 1995.

  F. Barbanera, M. Fernandez, H. Geuvers. Modularity of Strong Normalization and Confluence in the algebraic lambda-cube. (Extended Abstract)
  In Proc. 9th IEEE Symp. of Logic in Computer Science (LICS'94), Paris, 1994. PostScript.

  M. Fernandez, J-P. Jouannaud. Modular Termination of Term Rewriting Systems Revisited.
  In Proc. ADT'94. S. Margherita, Italy, 1994. LNCS 906. dvi.

  F. Barbanera, M. Fernandez. Modularity of termination and confluence in combinations of rewrite systems with Lambda_omega.
  In Proc. ICALP'93, Lund, 1993. LNCS 820. dvi©Springer 1993.

  F. Barbanera, M. Fernandez. Combining First and Higher Order Rewrite Systems with Type Assignment Systems.
  In Proc. TLCA'93, Utrecht, 1993. LNCS 664. dvi©Springer 1993.

  S. van Bakel, M. Fernandez. Strong Normalization of Typeable Rewrite Systems.
  In Proc. HOA'93, Amsterdam, 1993. LNCS 816. dvi.

• On object calculus and rewriting:

  M. Fernandez, F. Fleutot. A historic functional and object oriented calculus.
  Proc. of the 8th ACM-SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP'06), Venice, 2006. ACM Press. pdf©ACM 2006.

  A. Compagnoni, M. Fernandez. An object calculus with algebraic rewriting.
  In Proc. PLILP'97, Southampton, 1997. LNCS 1292. PostScript©Springer 1997.

• On graph rewriting and interaction nets:

  Journals:

  M. Fernandez, L. Khalil. Interaction nets with McCarthy's amb: Properties and Applications.
  Nordic Journal of Computing, Vol.10, Number 2, 2003. Postcript.

  M. Fernandez and I. Mackie. Operational Equivalence for Interaction Nets.
  Theoretical Computer Science, volume 297, issue 1-3, pages 157-181, 2003.
  Special Issue: Latin American Theoretical Informatics. Abstract.

  M. Fernandez and I. Mackie. Interaction Nets and Term Rewriting Systems.
  Theoretical Computer Science, volume 190, pages 3-39, 1998. Special Issue (Selected papers from CAAP'96). Abstract.

  M. Fernandez. Type Assignment and Termination of Interaction Nets.
  Mathematical Structures in Computer Science, vol.8, pages 593-636, 1998. Special Issue, Colloquium on Logic and Models of Computation, Marseille 1996.
  PostScript.

  Conferences:

  M. Fernandez, H. Kirchner, O. Namet.A Strategy Language for Graph Rewriting. Proceedings of LOPSTR 2011, Logic-Based Program Synthesis and Transformation, Odense, 2011. To appear in Lecture Notes in Computer Science, Springer.

  O. Andrei, M. Fernandez, H. Kirchner, G. Melancon, O. Namet, B. Pinaud. PORGY: Strategy-Driven Interactive Transformation of Graphs. Proceedings of TERMGRAPH 2011, EPTCS.

  S. Alves, M. Fernandez, I. Mackie. A new graphical calculus of proofs. Proceedings of TERMGRAPH 2011, EPTCS.

  M. Fernández and O. Namet. Strategic programming on graph rewriting systems
  In Proceedings of the International Workshop on Strategies in Rewriting, Proving, and Programming, Edinburgh, UK, 9th July 2010. Electronic Proceedings in Theoretical Computer Science, Volume 44, DOI 10.4204/EPTCS.44 ISSN: 2075-2180, December 2010.

  M. Fernandez, I. Mackie, S. Sato, M. Walker. Recursive functions with pattern-matching in interaction nets. In Proceedings of TERMGRAPH 2009 - Electronic Notes in Theoretical Computer Science, Elsevier, 2009.

  M. Fernandez and O. Namet. Graph creation, visualisation and transformation. In Proceedings of the 10th International Workshop on Rule Based Programming, RULE 2009, part of the Federated Conference on Rewriting, Deduction, Programming. Brasilia, June 2009. Electronic Proceedings in Theoretical Computer Science.

  M. Fernandez andI. Mackie, F-R. Sinot. Interaction Nets vs. the Rho Calculus: Introducing Bigraphical Nets.
  Proc. of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS 2005), San Francisco, 2005. Electronic Notes in Theoretical Computer Science, Elsevier. PostScript.

  M. Fernandez andI. Mackie, F-R. Sinot. Strict Rho Calculus for Typed Functional Languages.
  Int. Workshop on Implementation and Application of Functional Languages, Technical Report, Dublin, 2005. Superseded by WRS'06.

  M. Fernandez, I. Mackie, and J. S. Pinto. A Higher-order Calculus for Graph Transformation.
  In Proc. of the First International Workshop on Term Graph Rewriting (TERMGRAPH 2002), Barcelona, 2002.
  Electronic Notes in Theoretical Computer Science, Vol. 72 (1), pages 45-58, 2007. doi:10.1016/j.entcs.2002.09.005 Postcript.

  M. Fernandez, L. Khalil. Interaction nets with McCarthy's amb.
  In Proc. of the 9th Int. Workshop on Expressiveness in Concurrency (EXPRESS'02), Brno, Czech Republic, 2002. U. Nestmann and P. Panangaden (eds.),
  Electronic Notes in Theoretical Computer Science, Vol. 68 (2), 2002. Postcript.

  M. Fernandez, I. Mackie, and J. S. Pinto. Combining Interaction Nets with Externally Defined Programs.
  Proc. of AGP'01, Joint Conference on Declarative Programming. Evora, Portugal, 2001. Postcript.

  M. Fernandez and I. Mackie. Packing Interaction Nets: Applications to Linear Logic and the Lambda-Calculus.
  Proc. of WAIT'01, JAIIO, Buenos Aires, 2001.

  M. Fernandez and I. Mackie. A Theory of Operational Equivalence for Interaction Nets.
  Proceedings of LATIN'2000, Punta del Este, Uruguay, 2000. LNCS 1776, Springer. Postcript.

  M. Fernandez and I. Mackie. A Calculus for Interaction Nets.
  Proceedings of PPDP'99, Principles and Practice of Declarative Programming, Paris, 1999. LNCS 1702, Springer. Postcript.

  M. Fernandez and I. Mackie. Coinductive Techniques for Operational Equivalence of Interaction Nets.
  In Proc. LICS'98, IEEE Symposium on Logic in Computer Science, Indianapolis, USA, 1998. Abstract.

  M. Fernandez and I. Mackie. From Term Rewriting to Generalised Interaction Nets.
  In Proc. PLILP'96, Aachen, Germany, 1996. LNCS 1140.PostScript.

  M. Fernandez and I. Mackie. Interaction Nets and Term Rewriting Systems (Extended abstract).
  In Proc. CAAP'96, Linkoping, Sweden, 1996. LNCS 1059. PostScript.

• On unification, disunification, complement problems:

  Journals:

  C. Calves and M. Fernandez. Matching and Alpha-Equivalence Check for Nominal Terms. Journal of Computer and System Sciences. Special issue: Logic, Language and Computation (Selected papers from WOLLIC 2008), Volume 76, Issue 5, Pages 283–301, 2010. Elsevier.

  C. Calves and M. Fernandez. A polynomial nominal unification algorithm. Theoretical Computer Science, 2008. Available from http://dx.doi.org/10.1016/j.tcs.2008.05.012

  M. Fernandez. Negation Elimination in Empty or Permutative Equational Theories.
  In the Journal of Symbolic Computation, Volume 26, pages 97-133. Academic PressLimited, 1998. Abstract.
  Review by Alexander Leitsch, MathSciNet

  M. Fernandez. AC Complement Problems: Satisfiability and Negation Elimination.
  In the Journal of Symbolic Computation, Volume 22, pages 49-82. Academic PressLimited, 1996. Abstract.

  M. Fernandez. Narrowing based procedures for equational disunification.
  In Applicable Algebra in Engineering, Communication and Computing, Vol.3, pages 1-26. Springer-Verlag, 1992. Abstract.

  Conferences:

  M. Fernandez. Nominal Graphs - Joint GT-VMT and TERMGRAPH Invited Talk. Abstract in Proceedings of TERMGRAPH 2011, EPTCS, to appear.

  C. Calves, M. Fernandez. The first-order nominal link Proceedings of LOPSTR 2010, LNCS 6564, Springer, 2011.

  C. Calves, M. Fernandez. Nominal Matching and Alpha-Equivalence. Proceedings of WOLLIC 2008, LNAI 5110, Springer, 2008.

  C. Calves, M. Fernandez. Implementing Nominal Unification. Proceedings 3rd Int. Workshop on Term Graph Rewriting (TERMGRAPH'06), Vienna, 2006. Electronic Notes in Theoretical Computer Science, Volume 176, Issue 1, 2007, Pages 25-37. pdf© ENTCS 2007.

  M. Fernandez. AC-Complement Problems: Satisfiability and Negation Elimination (Extended Abstract).
  In Proc. RTA'93, Montreal, 1993. LNCS 690. dvi.

  H. Comon, M. Fernandez. Negation Elimination in Equational Formulae.
  In Proc. MFCS'92, Praha, 1992. LNCS 629. dvi.