Skip to search formSkip to main contentSkip to account menu

Polyvariance

Known as: Polyvariant 
In program analysis, an analysis is called polyvariant if functions are analyzed multiple times—typically once at each call site—to improve the… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
E. F. Sheka, I. Natkaniec, N. N. Rozhkova, E. Yu. Buslaeva, S. V. Tkachev, S. P. Gubin, V. P. Mel’nikov Department of Theoretical… 
2010
2010
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for… 
2008
2008
Binding time analysis (BTA) is used in specialization by means of partial evaluation method. Usual BTA only annotates a source… 
1998
1998
The performance of logic programs can be significantly improved by reducing nondeterminism in their evaluation using techniques… 
1998
1998
interpretation-based and constraint-based analyses are analysis methodologies with diierent strengths and weaknesses. Abstract… 
1994
1994
In the past, most partial evaluators have been geared towards purely functional and logic languages with no or little support for… 
1993
1993
Binding-time analysis aims at determining which variables can be bound to their values at compile time. This binding-time… 
1992
1992
1 Introduction We have designed a new method for performing partial evaluation. This method divides specialization into two… 
1992
1992
Existing partial evaluators use a strategy called polyvariant specialization, which involves specializing program points on the…