The following pages link to Germán Vidal (Q232929):
Displaying 50 items.
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Ensuring the quasi-termination of needed narrowing computations (Q845935) (← links)
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Cauder: a causal-consistent reversible debugger for Erlang (Q1648893) (← links)
- Reversible computation in term rewriting (Q1683707) (← links)
- Cost-augmented partial evaluation of functional logic programs (Q1768472) (← links)
- A theory of reversibility for Erlang (Q1785852) (← links)
- A residualizing semantics for the partial evaluation of functional logic programs. (Q1853170) (← links)
- Rules + strategies for transforming lazy functional logic programs (Q1884942) (← links)
- Reversible computations in logic programming (Q2039908) (← links)
- An SMT-based concolic testing tool for logic programs (Q2039953) (← links)
- Explanations as programs in probabilistic logic programming (Q2163172) (← links)
- Computing race variants in message-passing concurrent programming with selective receives (Q2165226) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- Dynamic slicing of lazy functional programs based on redex trails (Q2271904) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- Symbolic execution and thresholding for efficiently tuning fuzzy logic programs (Q2409732) (← links)
- On the completeness of selective unification in concolic testing of logic programs (Q2409737) (← links)
- A reversible semantics for Erlang (Q2409740) (← links)
- Conversion to tail recursion in term rewriting (Q2436518) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- Operational semantics for declarative multi-paradigm languages (Q2456574) (← links)
- (Q2763647) (← links)
- (Q2766540) (← links)
- (Q2766777) (← links)
- (Q2767032) (← links)
- Specialization of inductively sequential functional logic programs (Q2817728) (← links)
- (Q2843603) (← links)
- Computing More Specific Versions of Conditional Rewriting Systems (Q2848903) (← links)
- Static Slicing of Rewrite Systems (Q2873792) (← links)
- Fast narrowing-driven partial evaluation for inductively sequential programs (Q2936786) (← links)
- Concolic Execution and Test Case Generation in Prolog (Q2949706) (← links)
- A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (Q3003494) (← links)
- Forward Slicing of Multi-paradigm Declarative Programs Based on Partial Evaluation (Q3079913) (← links)
- Specialization of functional logic programs based on needed narrowing (Q3370571) (← links)
- Forward slicing of functional logic programs by partial evaluation (Q3430670) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- Towards Erlang Verification by Term Rewriting (Q3453650) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
- Towards Symbolic Execution in Erlang (Q3455085) (← links)
- Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation (Q3557098) (← links)
- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing (Q3558285) (← links)
- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs (Q3591075) (← links)
- Automatic Partial Inversion of Inductively Sequential Functions (Q3612954) (← links)
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (Q3617429) (← links)
- Fast Offline Partial Evaluation of Large Logic Programs (Q3617434) (← links)
- (Q4217931) (← links)
- (Q4281615) (← links)
- (Q4364365) (← links)
- (Q4413065) (← links)
