The following pages link to Salvador Lucas (Q293292):
Displaying 50 items.
- Strongly sequential and inductively sequential term rewriting systems (Q293294) (← links)
- Root-neededness and approximations of neededness (Q293367) (← links)
- Dependency pairs for proving termination properties of conditional term rewriting systems (Q347382) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Completeness of context-sensitive rewriting (Q477588) (← links)
- Normal forms and normal theories in conditional rewriting (Q730473) (← links)
- Proving termination of context-sensitive rewriting by transformation (Q859833) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Context-sensitive dependency pairs (Q989290) (← links)
- Strong and NV-sequentiality of constructor systems (Q1029079) (← links)
- Operational termination of conditional term rewriting systems (Q1041807) (← links)
- On-demand strategy annotations revisited: an improved on-demand evaluation strategy (Q1044842) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Analysis of rewriting-based systems as first-order theories (Q1671151) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Context-sensitive rewriting strategies (Q1854569) (← links)
- Applications and extensions of context-sensitive rewriting (Q2043816) (← links)
- The origins of the halting problem (Q2043819) (← links)
- Derivational complexity and context-sensitive Rewriting (Q2069872) (← links)
- The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques (Q2228436) (← links)
- Proving operational termination of membership equational programs (Q2271899) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Automatic generation of logical models with AGES (Q2305421) (← links)
- On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting (Q2502172) (← links)
- (Q2726287) (← links)
- (Q2766794) (← links)
- (Q2778880) (← links)
- Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting (Q2808236) (← links)
- Methods for Proving Termination of Rewriting-based Programming Languages by Transformation (Q2808239) (← links)
- Specialization of inductively sequential functional logic programs (Q2817728) (← links)
- Use of Logical Models for Proving Operational Termination in General Logics (Q2827835) (← links)
- Lazy Rewriting and Context-Sensitive Rewriting (Q2841298) (← links)
- (Q2844059) (← links)
- (Q2849587) (← links)
- (Q2851049) (← links)
- Improving the Context-sensitive Dependency Graph (Q2867962) (← links)
- Proving Termination of Context-Sensitive Rewriting with MU-TERM (Q2867963) (← links)
- (Q2871851) (← links)
- Strong and Weak Operational Termination of Order-Sorted Rewrite Theories (Q2945137) (← links)
- 2D Dependency Pairs for Proving Operational Termination of CTRSs (Q2945138) (← links)
- Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting (Q2945713) (← links)
- Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems (Q2949703) (← links)
- Removing Redundant Arguments of Functions* (Q2996146) (← links)
- Termination of Rewriting with Strategy Annotations (Q2996200) (← links)
- Proving Termination Properties with mu-term (Q3067476) (← links)
- Abstract Diagnosis of Functional Programs (Q3079916) (← links)
- Specialization of functional logic programs based on needed narrowing (Q3370571) (← links)
- Removing redundant arguments automatically (Q3430663) (← links)
