( en | de | ru )

 

Disambiguation of "Fernández, Maribel"

Author of the publication

copydeleteadd this publication to your clipboard
Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega.

, and . ICALP, volume 700 of Lecture Notes in Computer Science, page 657-668. Springer, (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bárbara Fernández Fernández

Fernando Fernández

Victoria Fernández

Asunción Fernández

Pablo Fernández

 

Other publications of authors with the same name

Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega., and . ICALP, volume 700 of Lecture Notes in Computer Science, page 657-668. Springer, (1993)Workshop TERMGRAPH 2004.. ICGT, volume 3256 of Lecture Notes in Computer Science, page 437-438. Springer, (2004)From Term Rewriting to Generalised Interaction Nets., and . PLILP, volume 1140 of Lecture Notes in Computer Science, page 319-333. Springer, (1996)Iterator Types., , , and . FoSSaCS, volume 4423 of Lecture Notes in Computer Science, page 17-31. Springer, (2007)An Operational Approach to Program Extraction in the Calculus of Constructions., and . LOPSTR, volume 2664 of Lecture Notes in Computer Science, page 111-125. Springer, (2002)Access Control and Obligations in the Category-Based Metamodel: A Rewrite-Based Semantics., , and . LOPSTR, volume 8981 of Lecture Notes in Computer Science, page 148-163. Springer, (2014)Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization., , and . ESOP, volume 1058 of Lecture Notes in Computer Science, page 387-403. Springer, (1996)Combining interaction nets with externally defined programs., , and . APPIA-GULP-PRODE, page 297-312. Departamento de Informática, Universidade de Évora, (2001)Type assignment and termination of interaction nets.. Math. Struct. Comput. Sci., 8 (6): 593-636 (1998)Call-by-Value lambda-Graph Rewriting Without Rewriting., and . ICGT, volume 2505 of Lecture Notes in Computer Science, page 75-89. Springer, (2002)