Developed Programs:
<Back>

NOTICE:

These programs are provided by Akimasa Morihata "AS IS" and any
express or implied warranties are disclaimed.
In no event shall Akimasa Morihata be liable
for any damages and on any theory of liability
arising in any way out of the use of this software,
even if advised of the possibility of such damage.

- A Haskell Library for Enumerating Optimal Sequences

The library consists of functions useful to describe desirable lists; moreover, it consist of rewrite rules that automatically improve programs written in the library functions. Detailed explanations can be found in the following paper:

A, Morihata: A Short Cut to Optimal Sequences.*New Generation Computing*, Vol. 29, No. 1, pp. 31-59, 2011. - Optimal Path Querying System

The system generates C++ codes for querying the optimal path on a graph from description of the criterion of optimality written in our DSL. Detailed explanations can be found in the following papers:

A. Morihata, K. Matsuzaki, M. Takeichi: Write It Recursively: Generic Framework for Optimal Path Queries. ICFP'08.

森畑明昌, 松崎公紀, 武市正人: 領域限定言語に基づく最適経路問合せ (Optimal Path Querying based on a Domain-Specific Language).*情報処理学会論文誌 プログラミング*, Vol. 4, No. 2, pp. 1-18, 2011.

(c) Akimasa Morihata, 2008--2012