Partial evaluation

Known as: Evaluation (disambiguation), Futamura projection, Partial evaluator 
In computing, partial evaluation is a technique for several different types of program optimization by specialization. The most straightforward… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2001
Highly Cited
2001
Preprocessors with conditionals are often used as software configuration management tools, with preprocessor variables naming… (More)
  • figure 4
  • figure 8
  • figure 11
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper reports the relationship between formal description of semantics (i.e., interpreter) of a programming language and an… (More)
  • figure 1
  • figure 2
  • figure 6
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Languages that integrate functional and logic programming with a complete operational semantics are based on narrowing, a… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • table II
Is this relevant?
Highly Cited
1993
Highly Cited
1993
syntax as a special case of recursively de ned data types; an encoding of recursive data types in Scheme. 
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 3.1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A partial evaluator for Prolog takes a program and a query and return a program specialized for all instances of that query. The… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A simple module facility allows the user to write a program in different files, and to create and use function libraries. Besides… (More)
  • figure 2
  • figure 3
  • figure 7
Is this relevant?
Highly Cited
1991
Highly Cited
1991
D This paper gives a theoretical foundation for partial evaluation in logic programming. Let P be a normal program, G a normal… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We argue that explanation-based generalisation as recently proposed in the machine learning literature is essentially equivalent… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
531 • The central proЬlem of supercompilation is to fi.nd а finite set of configurations (gener~lized states) of the computing… (More)
Is this relevant?
Highly Cited
1982
Highly Cited
1982
An operational semantics of the Prolog programming language is introduced. Meta-IV is used to specify the semantics. One purpose… (More)
Is this relevant?