Vidal, Germán - Departamento de Sistemas Informáticos y Computación, Universitat Politècnica de València

• Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
• Uniform Lazy Narrowing Maria Alpuente1
• A Compositional Semantics for Conditional Term Rewriting Systems
• Safe Folding/Unfolding with Conditional M. Alpuente1
• Dynamic Slicing of Lazy Functional Programs Based on Redex Trails
• Time Equations for Lazy Functional (Logic) Languages ?
• An Embedded Language Approach to Router Speci cation in Curry ?
• Automatic Partial Inversion of Inductively Sequential Functions
• Compositional Analysis for Equational Horn Programs
• Multi-Paradigm Logic Programming Call-by-Name Specialization of
• A Hybrid Approach to Conjunctive Partial Deduction
• Fast NarrowingDriven Partial Evaluation for Inductively Sequential Programs
• Rules + Strategies for Transforming Lazy Functional Logic Programs
• Lightweight Program Specialization via Dynamic Slicing Claudio Ochoa
• Run-Time Profiling of Functional Logic Programs
• INDY User's Manual (v1.8) Elvira Albert Mar'ia Alpuente Germ'an Vidal
• Termination of Narrowing in Left-Linear Constructor Systems
• Specialization of Functional Logic Programs \Lambda Mar'ia Alpuente z Moreno Falaschi x Germ'an Vidal z
• Automatic Partial Inversion of Inductively Sequential Functions #
• An Operational Semantics for Declarative Multi-Paradigm Languages ?
• Trace Analysis for Predicting the Effectiveness of Partial Evaluation
• A Deterministic Operational Semantics for Functional Logic Programs ?
• Lazy Call-By-Value Evaluation Bernd Brael Sebastian Fischer
• Towards Router Speci cation in Curry: The Language ROSE ?
• AAECC manuscript No. (will be inserted by the editor)
• A Hybrid Approach to Conjunctive Partial Deduction German Vidal
• A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs
• Goal-directed and Relative Dependency Pairs for Proving the Termination of Narrowing
• Fast Offline Partial Evaluation of Large Logic Programs
• Towards Scalable Partial Evaluation of Declarative Programs
• Towards scalable partial evaluation of declarative programs
• A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
• Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
• Dynamic Slicing Techniques for Petri Nets1 M. Llorens2
• Trace Analysis for Predicting the Effectiveness of Partial Evaluation
• Predicting the Effectiveness of Partial Evaluation German Vidal
• Improving Offline Narrowing-Driven Partial Evaluation using Size-Change Graphs
• Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
• Towards a Safe Partial Evaluation of Lazy Functional Logic Programs
• Ensuring the Quasi-Termination of Needed Narrowing Computations
• Termination of Narrowing in Left-Linear Constructor Systems
• Improving Offline Narrowing-Driven Partial Evaluation using Size-Change Graphs
• A Slicing Tool for Lazy Functional Logic Programs
• Quasi-Terminating Logic Programs for Ensuring the Termination of Partial Evaluation
• Operational Semantics for Declarative Multi-Paradigm Languages
• Forward Slicing by Conjunctive Partial Deduction and Argument Filtering
• Fast Narrowing-Driven Partial Evaluation for Inductively Sequential Programs
• An Offline Partial Evaluator for Curry Programs J. Guadalupe Ramos
• Cost-Augmented Partial Evaluation of Functional Logic Programs
• The Narrowing-Driven Approach to Functional Logic Program Specialization 1 The Narrowing-Driven Approach to Func-
• A Compositional Semantic Basis for the Analysis of Equational Horn Programs
• Narrowing-driven Partial Evaluation of Functional Logic Programs
• Call-by-Name Partial Evaluation of Functional Logic Programs
• Narrowing-driven Specialization of Functional Logic Programs
• Unfolding of Equational Logic Programs M. Alpuente
• Narrowing Approximations as an Optimization for Equational Logic Programs
• Using Narrowing Approximations to Optimize Equational Logic Programs
• I L P S ' 9 3 Incremental Equational Constraint Analyses
• Program Inversion for Tail Recursive Functions Naoki Nishida1
• Quasi-Terminating Logic Programs for Ensuring the Termination of Partial Evaluation ?
• Improving Size-Change Analysis in Offline Partial Evaluation
• Optimization of Equational Logic Programs using Abstract Narrowing
• Automatic Partial Inversion of Inductively Sequential Functions
• Oine narrowing-driven partial evaluation J. Guadalupe Ramos
• Fast Offline Partial Evaluation of Large Logic Programs
• Improving Control in Functional Logic Program Specialization ?
• A Partial Evaluation Framework for Curry Elvira Albert 1 , Mar a Alpuente 1 , Michael Hanus 2 , and Germ an Vidal 1
• Quasi-Termination Analysis of Logic Programs Using Size-Change Graphs
• A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs
• Automatic Partial Inversion of Inductively Sequential Functions
• A Unifying View of Functional and Logic Program Specialization
• Operational Semantics for Lazy Functional Logic Programs
• Specialization of Functional Logic Programs* Mar'ia Alpuentez Moreno Falaschix Germ'an Vidalz
• A Deterministic Operational Semantics for Functional Logic Programs?
• An Operational Semantics for Declarative Multi-Paradigm Languages?
• Symbolic Profiling for Multi-Paradigm Declarative Languages ?
• Quasi-Terminating Logic Programs for Ensuring the Termination of Partial Evaluation
• Improving Offline Narrowing-Driven Partial Evaluation using Size-Change Graphs
• Static Slicing of Rewrite Systems1 Diego Cheda2
• Partial Evaluation of Functional Logic Programs MARIA ALPUENTE
• Specialization of Lazy Functional Logic Programs M. Alpuente
• Towards Predicting the Effectiveness of Partial Evaluation German Vidal