Maribel Fernández

Author Info

Name	Affiliation	Papers
MARIBEL FERNÁNDEZ	Ecole Normale Super, UMR 8548, Liens, 45 Rue Ulm, F-75005 Paris, France	35
Collaborators	Citations	PageRank
42	315	23.44
Referers	Referees	References
512	556	400

Search Limit

100556

Publications (35 rows)

Collaborators (42 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A Reversible Operational Semantics for Imperative Programming Languages.	0	0.34	2020
On Solving Nominal Disunification Constraints	0	0.34	2020
Strategic Port Graph Rewriting: an Interactive Modelling Framework	5	0.44	2019
A Formalisation of Nominal C-Matching through Unification with Protected Variables.	0	0.34	2019
Nominal essential intersection types.	0	0.34	2018
Fixed-Point Constraints for Nominal Equational Unification.	0	0.34	2018
Towards a Privacy-Aware Qunatified Self Data Management Framework.	3	0.46	2018
On Solving Nominal Fixpoint Equations.	0	0.34	2017
Intruder deduction problem for locally stable theories with normal forms and inverses.	0	0.34	2017
Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory.	3	0.57	2016
Completeness in PVS of a Nominal Unification Algorithm.	3	0.48	2016
Checking Overlaps of Nominal Rewriting Rules.	3	0.44	2016
Nominal Narrowing.	0	0.34	2016
A Typed Language for Events.	0	0.34	2015
Dependent Types for Nominal Terms with Atom Substitutions.	4	0.44	2015
From nominal to higher-order rewriting and back again.	0	0.34	2015
Towards Privacy-Preserving Web Metering via User-Centric Hardware.	0	0.34	2014
A metamodel of access control for distributed environments: Applications and properties	3	0.54	2014
Elementary Deduction Problem For Locally Stable Theories With Normal Forms	0	0.34	2012
Linearity and recursion in a typed Lambda-calculus	2	0.37	2011
Action Control by Term Rewriting	0	0.34	2009
Recursive Functions with Pattern Matching in Interaction Nets	6	0.47	2009
Distributed event-based access control.	4	0.38	2009
Rewriting calculi, higher-order reductions and patterns: Introduction	0	0.34	2008
A rewriting framework for the composition of access control policies	15	0.58	2008
Lambda Calculus, Type Theory, and Natural Language II	1	0.38	2008
From Functional Programs to Interaction Nets via the Rewriting Calculus	2	0.38	2007
More developments in computational models: introduction	0	0.34	2007
The Power of Closed Reduction Strategies	3	0.42	2007
Curry-style types for nominal terms	213	8.90	2006
Efficient reductions with director strings	9	0.56	2003
Call-by-Value lambda-Graph Rewriting Without Rewriting	10	0.71	2002
Combining Interaction Nets with Externally Defined Programs	2	0.39	2001
Closed Reductions in the lambda-Calculus	11	0.76	1999
Modularity of strong normalization and confluence in the algebraic-λ-cube	13	0.70	1994