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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

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

We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for…

2008

Binding time analysis (BTA) is used in specialization by means of partial evaluation method. Usual BTA only annotates a source…

1998

The performance of logic programs can be significantly improved by reducing nondeterminism in their evaluation using techniques…

1997

1997

The concepts of value- and control-flow graphs are important for program analysis of imperative programs. An imperative value…

1996

Memoization is a key ingredient in every partial evaluator. It enables folding by caching previously specialized functions. It is…

1994

This paper describes a network formula generation method in frequency or time domain for circuits allowing symbolic…

1994

In the past, most partial evaluators have been geared towards purely functional and logic languages with no or little support for…

1992