NP-Completeness of a Combinator Optimization Problem

Notre Dame Journal of Formal Logic 36 (2):319-335 (1995)
Abstract
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)
DOI 10.1305/ndjfl/1040248462
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 27,651
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Does Optimization Imply Rationality?Philippe Mongin - 2000 - Synthese 124 (1-2):73 - 111.
Maynard Smith, Optimization, and Evolution.Sahotra Sarkar - 2005 - Biology and Philosophy 20 (5):951-966.
Combinator Logics.Lou Goble - 2004 - Studia Logica 76 (1):17 - 66.
Optimization and Improvement. [REVIEW]Paul Weirich - 2010 - Philosophical Studies 148 (3):467 - 475.
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.

Monthly downloads

Added to index

2010-08-24

Total downloads

9 ( #461,834 of 2,169,421 )

Recent downloads (6 months)

1 ( #345,461 of 2,169,421 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums