Person: Maribel Fernández

DBLP: Fern=aacute=ndez:Maribel

Facilitated 3 volumes:

Ed

Ed

Ed

Contributed to:

2015

2015

2014

2014

2012

2011

2011

2010

2008

2007

2006

2006

2005

2004

2003

2002

2002

1999

1999

1998

1997

1996

1996

1995

1994

1993

1993

1993

Wrote 28 papers:

PPDP-2015-Al-HumaimeedyF #multi #specification #verification

Enhancing the specification and verification techniques of multiparty sessions in SOC (ASAH, MF), pp. 19–30.

TLCA-2015-FairweatherFST #dependent type

Dependent Types for Nominal Terms with Atom Substitutions (EF, MF, NS, AT), pp. 180–195.

GRAPHITE-2014-FernandezKP #analysis #framework #graph grammar #interactive #modelling

Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework (MF, HK, BP), pp. 15–29.

LOPSTR-2014-AlvesDF #data access #metamodelling #semantics

Access Control and Obligations in the Category-Based Metamodel: A Rewrite-Based Semantics (SA, AD, MF), pp. 148–163.

ICALP-v2-2012-FernandezR #term rewriting

Nominal Completion for Rewrite Systems with Binders (MF, AR), pp. 201–213.

LOPSTR-2011-FernandezKN #graph grammar

A Strategy Language for Graph Rewriting (MF, HK, ON), pp. 173–188.

PPDP-2011-AlvesFFM #recursion #λ-calculus

Linearity and recursion in a typed λ-calculus (SA, MF, MF, IM), pp. 173–182.

LOPSTR-2010-CalvesF #first-order

The First-Order Nominal Link (CC, MF), pp. 234–248.

PPDP-2008-BertolissiF #composition #data access #framework #policy

A rewriting framework for the composition of access control policies (CB, MF), pp. 217–225.

FoSSaCS-2007-AlvesFFM

Iterator Types (SA, MF, MF, IM), pp. 17–31.

CSL-2006-AlvesFFM #linear #power of

The Power of Linear Functions (SA, MF, MF, IM), pp. 119–134.

PPDP-2006-FernandezF #calculus #functional #object-oriented

A historic functional and object-oriented calculus (MF, FF), pp. 145–156.

PPDP-2005-FernandezG #abstraction #generative #locality

Nominal rewriting with name generation: abstraction vs. locality (MF, MG), pp. 47–58.

PPDP-2004-FernandezGM #term rewriting

Nominal rewriting systems (MF, MG, IM), pp. 108–119.

RTA-2003-SinotFM #performance #reduction #string

Efficient Reductions with Director Strings (FRS, MF, IM), pp. 46–60.

ICGT-2002-FernandezM #call-by #graph grammar

Call-by-Value λ-Graph Rewriting Without Rewriting (MF, IM), pp. 75–89.

LOPSTR-2002-FernandezS #approach #calculus

An Operational Approach to Program Extraction in the Calculus of Constructions (MF, PS), pp. 111–125.

CSL-1999-FernandezM #reduction #λ-calculus

Closed Reductions in the λ-Calculus (MF, IM), pp. 220–234.

PPDP-1999-FernandezM #calculus #interactive

A Calculus for Interaction Nets (MF, IM), pp. 170–187.

LICS-1998-FernandezM #equivalence #induction #interactive

Coinductive Techniques for Operational Equivalence of Interaction Nets (MF, IM), pp. 321–332.

PLILP-1997-CompagnoniF #algebra #calculus #on the

On Object Calculus with Algebraic Rewriting (ABC, MF), pp. 17–31.

ESOP-1996-BakelBF #abstraction #normalisation #term rewriting

Rewrite Systems with Abstraction and β-Rule: Types, Approximants and Normalization (SvB, FB, MF), pp. 387–403.

PLILP-1996-FernandezM #interactive #term rewriting

From Term Rewriting to Generalised Interaction Nets (MF, IM), pp. 319–333.

RTA-1995-BakelF #normalisation #term rewriting #type system

(Head-) Normalization of Typeable Rewrite Systems (SvB, MF), pp. 279–293.

LICS-1994-BarbaneraFG #algebra #composition #confluence #normalisation

Modularity of Strong Normalization and Confluence in the algebraic-λ-Cube (FB, MF, HG), pp. 406–415.

ICALP-1993-BarbaneraF #composition #confluence #term rewriting #termination

Modularity of Termination and Confluence in Combinations of Rewrite Systems with λω (FB, MF), pp. 657–668.

RTA-1993-Fernandez #problem #satisfiability

AC Complement Problems: Satisfiability and Negation Elimination (MF), pp. 358–373.

TLCA-1993-BarbaneraF #higher-order #term rewriting

Combining First and Higher Order Rewrite Systems with Type Assignment Systems (FB, MF), pp. 60–74.