The following pages link to (Q3742690):
Displaying 17 items.
- Essence of generalized partial computation (Q808278) (← links)
- CAL: A theoretical background of constraint logic programming and its applications (Q908680) (← links)
- Mixed computation and compilation: New approaches to old problems (Q912601) (← links)
- How to control unfolding when specializing interpreters (Q918195) (← links)
- Set abstraction - an extension of all solutions predicate in logic programming language (Q1094865) (← links)
- Mixed computation of Prolog programs (Q1108777) (← links)
- Partial evaluation of metaprograms in a ``multiple worlds'' logic language (Q1108779) (← links)
- Partial evaluation with inference rules (Q1108781) (← links)
- A self-applicable partial evaluator and its use in incremental compilation (Q1108782) (← links)
- Using Prolog for building FROG, a hybrid knowledge representation system (Q1115205) (← links)
- A general criterion for avoiding infinite unfolding during partial deduction (Q1205178) (← links)
- Mixtus: An automatic partial evaluator for full Prolog (Q1313369) (← links)
- Sound and complete partial deduction with unfolding based on well-founded measures (Q1314419) (← links)
- Most specific logic programs (Q1356224) (← links)
- Specialisation calculus and communication (Q1818001) (← links)
- Compiling OR-parallelism into AND-parallelism (Q1819930) (← links)
- Role of logic programming in the FGCS project (Q5096224) (← links)