The following pages link to ECCE (Q16380):
Displaying 50 items.
- Abstract conjunctive partial deduction for the analysis and compilation of coroutines (Q511025) (← links)
- Partial evaluation of Maple (Q532411) (← links)
- Derivation of efficient logic programs by specialization and reduction of nondeterminism (Q815006) (← links)
- Termination of floating-point computations (Q850498) (← links)
- Type-based homeomorphic embedding for online termination (Q989516) (← links)
- Efficient and flexible access control via Jones-optimal logic program specialisation (Q2271897) (← links)
- Fast offline partial evaluation of logic programs (Q2437798) (← links)
- Optimization of rewrite theories by equational partial evaluation (Q2667190) (← links)
- (Q2723916) (← links)
- (Q2729911) (← links)
- Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency (Q2743695) (← links)
- (Q2763647) (← links)
- (Q2767032) (← links)
- (Q2767038) (← links)
- (Q2767047) (← links)
- Narrowing and rewriting logic: from foundations to applications (Q2873786) (← links)
- A study on the practicality of poly-controlled partial evaluation (Q2873793) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← 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)
- Verification in ACL2 of a Generic Framework to Synthesize SAT-Provers (Q3079919) (← links)
- Convex Hull Abstractions in Specialization of CLP Programs (Q3079923) (← links)
- Specialization of functional logic programs based on needed narrowing (Q3370571) (← links)
- Program Generation in the Equivalent Transformation Computation Model Using the Squeeze Method (Q3401934) (← links)
- Forward slicing of functional logic programs by partial evaluation (Q3430670) (← links)
- Towards Just-In-Time Partial Evaluation of Prolog (Q3558295) (← links)
- The Transformational Approach to Program Development (Q3578393) (← links)
- Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs (Q3591075) (← links)
- Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques (Q3591078) (← links)
- Fast Offline Partial Evaluation of Large Logic Programs (Q3617434) (← links)
- (Q4217937) (← links)
- Creating specialised integrity checks through partial evaluation of meta-interpreters (Q4223470) (← links)
- (Q4413065) (← links)
- (Q4414739) (← links)
- (Q4421875) (← links)
- (Q4440317) (← links)
- Logic program specialisation through partial deduction: Control issues (Q4452606) (← links)
- (Q4472536) (← links)
- (Q4472539) (← links)
- (Q4499252) (← links)
- (Q4506391) (← links)
- Solving Horn Clauses on Inductive Data Types Without Induction (Q4559806) (← links)
- Proving correctness of imperative programs by linearizing constrained Horn clauses (Q4593003) (← links)
- Predicate Pairing for program verification (Q4644353) (← links)
- Speedup of logic programs by binarization and partial deduction (Q4669648) (← links)
- Ecce—a problem‐solving environment's evolution toward Grid services and a Web architecture (Q4794750) (← links)
- (Q4808810) (← links)
- Offline specialisation in Prolog using a hand-written compiler generator (Q4819007) (← links)
- Conjunctive partial deduction: foundations, control, algorithms, and experiments (Q4939538) (← links)
- Anti-unification in Constraint Logic Programming (Q5108501) (← links)
