ECCE

swMATH4196MaRDI QIDQ16380FDOQ16380

Author name not available (Why is that?)

Cited In (62)

• Ecce—a problem‐solving environment's evolution toward Grid services and a Web architecture
• Functional and Logic Programming
• Program Development in Computational Logic
• Removing Superfluous Versions in Polyvariant Specialization of Prolog Programs
• Anti-unification in constraint logic programming
• Regular tree languages as an abstract domain in program specialisation
• Offline specialisation in Prolog using a hand-written compiler generator
• Fast offline partial evaluation of logic programs
• The narrowing-driven approach to functional logic program specialization
• Title not available (Why is that?)
• Forward slicing of multi-paradigm declarative programs based on partial evaluation
• Title not available (Why is that?)
• Partial evaluation of multi-paradigm declarative languages: Foundations, control, algorithms and efficiency
• A hybrid approach to conjunctive partial evaluation of logic programs
• Title not available (Why is that?)
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog
• The transformational approach to program development
• Type-Based Homeomorphic Embedding and Its Applications to Online Partial Evaluation
• Program Development in Computational Logic
• Predicate pairing for program verification
• Title not available (Why is that?)
• Termination of floating-point computations
• Term Rewriting and Applications
• Fast Offline Partial Evaluation of Large Logic Programs
• Title not available (Why is that?)
• Towards just-in-time partial evaluation of Prolog
• Program generation in the equivalent transformation computation model using the squeeze method
• Narrowing and rewriting logic: from foundations to applications
• Convex hull abstractions in specialization of CLP programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization of rewrite theories by equational partial evaluation
• Title not available (Why is that?)
• Specialization of functional logic programs based on needed narrowing
• Title not available (Why is that?)
• Improving Offline Narrowing-Driven Partial Evaluation Using Size-Change Graphs
• Title not available (Why is that?)
• Proving correctness of imperative programs by linearizing constrained Horn clauses
• Title not available (Why is that?)
• Verification in ACL2 of a generic framework to synthesize SAT-provers
• Speedup of logic programs by binarization and partial deduction
• Programming Languages and Systems
• Conjunctive partial deduction: foundations, control, algorithms, and experiments
• Forward slicing of functional logic programs by partial evaluation
• Title not available (Why is that?)
• Natural Rewriting for General Term Rewriting Systems
• Efficient and flexible access control via Jones-optimal logic program specialisation
• Logic program specialisation through partial deduction: Control issues
• Abstract conjunctive partial deduction for the analysis and compilation of coroutines
• Partial evaluation of Maple
• Logic Based Program Synthesis and Transformation
• Title not available (Why is that?)
• Program specialization for verifying infinite state systems: an experimental evaluation
• Solving Horn clauses on inductive data types without induction
• Creating specialised integrity checks through partial evaluation of meta-interpreters
• Title not available (Why is that?)
• Title not available (Why is that?)
• Derivation of efficient logic programs by specialization and reduction of nondeterminism
• A study on the practicality of poly-controlled partial evaluation
• Type-based homeomorphic embedding for online termination
• Title not available (Why is that?)
• Supervising Offline Partial Evaluation of Logic Programs Using Online Techniques

This page was built for software: ECCE