Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,384,115 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Call site
Program analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Parent and reduced graphene oxide of different origin in light of neutron scattering
E. Sheka
,
I. Natkaniec
,
+4 authors
V. P. Mel’nikov
2016
Corpus ID: 56073274
E. F. Sheka, I. Natkaniec, N. N. Rozhkova, E. Yu. Buslaeva, S. V. Tkachev, S. P. Gubin, V. P. Mel’nikov Department of Theoretical…
Expand
2010
2010
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
Stefan Holdermans
,
Jurriaan Hage
ACM SIGPLAN International Conference on…
2010
Corpus ID: 17005611
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for…
Expand
2008
2008
An Approach to Polyvariant Binding Time Analysis for a Stack-Based Language
Y. Klimov
2008
Corpus ID: 1531455
Binding time analysis (BTA) is used in specialization by means of partial evaluation method. Usual BTA only annotates a source…
Expand
1998
1998
A conservative technique to improve deterministic evaluation of logic programs
Abhik Roychoudhury
,
C. Ramakrishnan
,
I. Ramakrishnan
,
R. Sekar
Proceedings of the International Conference on…
1998
Corpus ID: 2459136
The performance of logic programs can be significantly improved by reducing nondeterminism in their evaluation using techniques…
Expand
1998
1998
Collecting Interpreters Yield Constraint-based Analyses
J. M. Ashley
,
John Hatclii
1998
Corpus ID: 18231254
interpretation-based and constraint-based analyses are analysis methodologies with diierent strengths and weaknesses. Abstract…
Expand
1994
1994
POPE: An On-line Partial Evaluator
P. Orbaek
1994
Corpus ID: 117426501
In the past, most partial evaluators have been geared towards purely functional and logic languages with no or little support for…
Expand
1993
1993
Separate polyvariant binding-time analysis
C. Consel
,
P. Jouvelot
1993
Corpus ID: 54042101
Binding-time analysis aims at determining which variables can be bound to their values at compile time. This binding-time…
Expand
1993
1993
On-line & O(cid:11)-line Partial Evaluation: Semantic Speci(cid:12)cations and Correctness Proofs (cid:3)
Charles Consel
,
Siau-cheng Khoo
1993
Corpus ID: 267941779
,
1992
1992
Towards a New Perspective on Partial Evaluation
M. Katz
,
D. Weise
ACM SIGPLAN Workshop on Partial Evaluation and…
1992
Corpus ID: 16817437
1 Introduction We have designed a new method for performing partial evaluation. This method divides specialization into two…
Expand
1992
1992
Avoiding Redundant Specialization during Partial Evaluation
Erik Ruf
,
D. Weise
1992
Corpus ID: 15318849
Existing partial evaluators use a strategy called polyvariant specialization, which involves specializing program points on the…
Expand
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)
ACCEPT & CONTINUE