Fernández, Maribel - Department of Computer Science, King's College London

• Callbyvalue graph rewriting without rewriting
• Approximation and Normalization Results for Typeable Term Rewriting Systems
• A Higherorder Calculus for Graph Transformation Maribel Fern'andez 1 , Ian Mackie 2 , and Jorge Sousa Pinto 3
• A Theory of Operational Equivalence for Interaction Nets
• Nominal Rewriting Systems Maribel Fern
• The Power of Linear Functions Sandra Alves1
• Type Assignment and Termination of Interaction Nets Maribel Fern'andez
• Closed Reductions in the -calculus (Extended Abstract)
• Electronic Notes in Theoretical Computer Science 68 No. 2 (2002) URL: http://www.elsevier.nl/locate/entcs/volume68.html 18 pages
• From Term Rewriting to Generalised Interaction Nets
• Combining Interaction Nets with Externally Defined Programs
• Normalization, Approximation, and Semantics for Combinator Systems ?
• Nominal Matching and Alpha-Equivalence (Extended Abstract)
• Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor)
• Rewrite Specifications of Access Control Policies in Distributed Environments
• Time and Location Based Services with Access Control
• Iterator Types Sandra Alves1
• Term Rewriting for Access Control Steve Barker and Maribel Fernandez
• TERMGRAPH 2006 Preliminary Version Implementing Nominal Unification
• New Developments in Environment Machines Maribel Fernandez1
• Polymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and firule ?
• Godel's System T Revisited Sandra Alves a
• Submitted to Electronic Proceedings in Theoretical Computer Science.
• Interaction Nets and Term Rewriting Systems (Extended Abstract)
• Dynamic Event-Based Access Control as Term Rewriting
• AC Complement Problems: Satisfiability and Negation Elimination
• Combining First and Higher Order Rewrite Systems with Type Assignment Systems
• An operational approach to program extraction in the Calculus of Constructions
• [17] H. Geuvers and M.J. Nederhof. A simple modular proof of the strong normalization for the calculus
• Linear Recursive Functions Sandra Alves1
• Modular Termination of Term Rewriting Systems Revisited ?
• Strong Normalization of Typeable Rewrite Systems
• Negation Elimination in Equational Formulae (Extended Abstract)
• A Uniform Approach to Program Extraction: Pure Type Systems with Ultra -types
• Nominal Rewriting with Name Generation: Abstraction vs. Locality
• A Calculus for Interaction Nets Maribel Fern'andez 1 and Ian Mackie 2
• Curry-Style Types for Nominal Terms Maribel Fernandez and Murdoch J. Gabbay
• Modularity of Termination and Confluence in Combinations of Rewrite Systems with ~!
• (Head-)Normalization of Typeable Rewrite Systems
• Rewrite Systems with Abstraction and fi-rule: Types, Approximants and Normalization
• Labelled calculi of resources Maribel Fernandez and Nikolaos Siafakas