Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

26 relations
Compile time function executionComputer programConstant foldingDefunctionalization

Broader (1)

Incremental computing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Reinforcement Learning-based Content-Centric Services in Mobile Sensing
The recent remarkable advancement of smart devices is enabling a higher-level flexibility of mobile sensing. Along with the rapid… 
Highly Cited
2013
Highly Cited
2013
Symbolic PathFinder: integrating symbolic execution with model checking for Java bytecode analysis
Symbolic PathFinder (SPF) is a software analysis tool that combines symbolic execution with model checking for automated test… 
Highly Cited
2002
Highly Cited
2002
Compilation Semantics of Aspect-Oriented Programs
paper presents a semantics-based compilation frame- work for an aspect-oriented programming language based on its operational… 
Highly Cited
2001
Highly Cited
2001
Preprocessor conditional removal by simple partial evaluation
  • I. BaxterM. Mehlich
  • Proceedings Eighth Working Conference on Reverse…
  • 2001
  • Corpus ID: 17064506
Preprocessors with conditionals are often used as software configuration management tools, with preprocessor variables naming… 
Highly Cited
1998
Highly Cited
1998
The essence of the Visitor pattern
For object-oriented programming, the Visitor pattern enables the definition of a new operation on an object structure without… 
Highly Cited
1998
Highly Cited
1998
Tempo: specializing systems applications and beyond
Permission to make digital/hard copy of part or all of this work for personal or classroom use is granted without fee provided… 
1998
1998
An Architecture for An Open Compiler
This is a progress report on an experiment to build a compile-time metaobject protocol for Scheme. The compilation setting raises… 
Highly Cited
1995
Highly Cited
1995
Interprocedural symbolic analysis
Compiling for efficient execution on advanced computer architectures requires extensive program analysis and transformation. Most… 
Highly Cited
1993
Highly Cited
1993
Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree
We introduce the notion of a perfect process tree as a model for the full propagation of information in metacomputation. Starting… 
Highly Cited
1982
Highly Cited
1982
Long-term Results of Arthroscopic Partial Menisectomy
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)