Notre Dame Journal of Formal Logic 36 (2):319-335 (1995)
We consider a deterministic rewrite system for combinatory logic over combinators , and . Terms will be represented by graphs so that reduction of a duplicator will cause the duplicated expression to be "shared" rather than copied. To each normalizing term we assign a weighting which is the number of reduction steps necessary to reduce the expression to normal form. A lambda-expression may be represented by several distinct expressions in combinatory logic, and two combinatory logic expressions are considered equivalent if they represent the same lambda-expression (up to --equivalence). The problem of minimizing the number of reduction steps over equivalent combinator expressions (i.e., the problem of finding the "fastest running" combinator representation for a specific lambda-expression) is proved to be NP-complete by reduction from the "Hitting Set" problem
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Should We Abandon Optimization Theory? The Need for Bounded Rationality.Frédéric Laville - 2000 - Journal of Economic Methodology 7 (3):395-426.
Maynard Smith, Optimization, and Evolution.Sahotra Sarkar - 2005 - Biology and Philosophy 20 (5):951-966.
Optimization and Simplicity: Marr's Theory of Vision and Biological Explanation.Daniel J. Gilman - 1993 - Synthese 107 (3):293-323.
A Completeness Proof for a Logic with an Alternative Necessity Operator.Stéphane Demri - 1997 - Studia Logica 58 (1):99-112.
Husserl's Two Notions of Completeness: Husserl and Hilbert on Completeness and Imaginary Elements in Mathematics.Jairo José Da Silva - 2000 - Synthese 125 (3):417 - 438.
Methodological Altruism as an Alternative Foundation for Individual Optimization.Christian Arnsperger - 2000 - Ethical Theory and Moral Practice 3 (2):115-136.
Optimization and Improvement. [REVIEW]Paul Weirich - 2010 - Philosophical Studies 148 (3):467 - 475.
Mean-Variance Vs. Full-Scale Optimization: Broad Evidence for the UK.Björn Hagströmer, Richard G. Anderson, Jane M. Binner, Thomas Elger & Birger Nilsson - manuscript
The Church-Rosser Property in Dual Combinatory Logic.Katalin Bimbó - 2003 - Journal of Symbolic Logic 68 (1):132-152.
Probability Kinematics: A Constrained Optimization Problem. [REVIEW]Sherry May - 1976 - Journal of Philosophical Logic 5 (3):395 - 398.
Optimization, Option Disclosure, and Problem Redefinition.Robert E. McGinn - 1997 - Professional Ethics 6 (1/2):5-25.
Added to index2010-08-24
Total downloads9 ( #461,834 of 2,169,421 )
Recent downloads (6 months)1 ( #345,461 of 2,169,421 )
How can I increase my downloads?