( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Linearity and iterator types for Gödel's System.

, , , и . High. Order Symb. Comput., 23 (1): 1-27 (2010)

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.

Bárbara Fernández Fernández

Fernando Fernández

Victoria Fernández

Asunción Fernández

Pablo Fernández

 

Другие публикации лиц с тем же именем

Workshop TERMGRAPH 2004.. ICGT, том 3256 из Lecture Notes in Computer Science, стр. 437-438. Springer, (2004)Rewrite Systems with Abstraction and beta-Rule: Types, Approximants and Normalization., , и . ESOP, том 1058 из Lecture Notes in Computer Science, стр. 387-403. Springer, (1996)An Operational Approach to Program Extraction in the Calculus of Constructions., и . LOPSTR, том 2664 из Lecture Notes in Computer Science, стр. 111-125. Springer, (2002)Access Control and Obligations in the Category-Based Metamodel: A Rewrite-Based Semantics., , и . LOPSTR, том 8981 из Lecture Notes in Computer Science, стр. 148-163. Springer, (2014)Iterator Types., , , и . FoSSaCS, том 4423 из Lecture Notes in Computer Science, стр. 17-31. Springer, (2007)From Term Rewriting to Generalised Interaction Nets., и . PLILP, том 1140 из Lecture Notes in Computer Science, стр. 319-333. Springer, (1996)Modularity of Termination and Confluence in Combinations of Rewrite Systems with lambda_omega., и . ICALP, том 700 из Lecture Notes in Computer Science, стр. 657-668. Springer, (1993)A new graphical calculus of proofs, , и . TERMGRAPH, том 48 из EPTCS, стр. 69-84. (2011)Combining interaction nets with externally defined programs., , и . APPIA-GULP-PRODE, стр. 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)