A short cut to optimal sequences

Akimasa Morihata

doi:10.1007/978-3-642-10672-9_7

A short cut to optimal sequences

Akimasa Morihata

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to derive efficient algorithms from naive enumerate-and-choose-style ones by shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions. In addition, we propose a set of transformations for exploiting our shortcut fusion law. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful for describing desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.

Original language	English
Title of host publication	Programming Languages and Systems - 7th Asian Symposium, APLAS 2009, Proceedings
Pages	63-78
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-642-10672-9_7
Publication status	Published - 2009
Externally published	Yes
Event	7th Asian Symposium on Programming Languages and Systems, APLAS 2009 - Seoul, Korea, Republic of Duration: 2009 Dec 14 → 2009 Dec 16

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5904 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	7th Asian Symposium on Programming Languages and Systems, APLAS 2009
Country/Territory	Korea, Republic of
City	Seoul
Period	09/12/14 → 09/12/16

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-10672-9_7

Cite this

A short cut to optimal sequences. / Morihata, Akimasa.

Programming Languages and Systems - 7th Asian Symposium, APLAS 2009, Proceedings. 2009. p. 63-78 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5904 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Morihata, A 2009, A short cut to optimal sequences. in Programming Languages and Systems - 7th Asian Symposium, APLAS 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5904 LNCS, pp. 63-78, 7th Asian Symposium on Programming Languages and Systems, APLAS 2009, Seoul, Korea, Republic of, 09/12/14. https://doi.org/10.1007/978-3-642-10672-9_7

@inproceedings{f70009655b70469aadd458ddf472614b,

title = "A short cut to optimal sequences",

abstract = "We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to derive efficient algorithms from naive enumerate-and-choose-style ones by shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions. In addition, we propose a set of transformations for exploiting our shortcut fusion law. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful for describing desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.",

author = "Akimasa Morihata",

year = "2009",

doi = "10.1007/978-3-642-10672-9_7",

language = "English",

isbn = "3642106714",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "63--78",

booktitle = "Programming Languages and Systems - 7th Asian Symposium, APLAS 2009, Proceedings",

note = "7th Asian Symposium on Programming Languages and Systems, APLAS 2009 ; Conference date: 14-12-2009 Through 16-12-2009",

}

TY - GEN

T1 - A short cut to optimal sequences

AU - Morihata, Akimasa

PY - 2009

Y1 - 2009

N2 - We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to derive efficient algorithms from naive enumerate-and-choose-style ones by shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions. In addition, we propose a set of transformations for exploiting our shortcut fusion law. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful for describing desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.

AB - We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to derive efficient algorithms from naive enumerate-and-choose-style ones by shortcut fusion, which is a program transformation for eliminating intermediate data structures passed between functions. In addition, we propose a set of transformations for exploiting our shortcut fusion law. As an implementation of our method, we introduce a library for finding optimal sequences. The library consists of proposed transformations, together with functions useful for describing desirable sequences, so that naive enumerate-and-choose-style programs will be automatically improved.

UR - http://www.scopus.com/inward/record.url?scp=72449174217&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=72449174217&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-10672-9_7

DO - 10.1007/978-3-642-10672-9_7

M3 - Conference contribution

AN - SCOPUS:72449174217

SN - 3642106714

SN - 9783642106712

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 63

EP - 78

BT - Programming Languages and Systems - 7th Asian Symposium, APLAS 2009, Proceedings

T2 - 7th Asian Symposium on Programming Languages and Systems, APLAS 2009

Y2 - 14 December 2009 through 16 December 2009

ER -

A short cut to optimal sequences

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this