Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-order Functional Logic Language (1997)
| Venue: | In Proceedings of Sixth International Joint Conference, ALP '97 - HOA '97, LNCS 1298 |
| Citations: | 8 - 4 self |
BibTeX
@INPROCEEDINGS{Suzuki97higher-orderlazy,
author = {Taro Suzuki and Koji Nakagawa and Tetsuo Ida},
title = {Higher-Order Lazy Narrowing Calculus: A Computation Model for a Higher-order Functional Logic Language},
booktitle = {In Proceedings of Sixth International Joint Conference, ALP '97 - HOA '97, LNCS 1298},
year = {1997},
pages = {99--113},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper we present a computation model for a higher-order functional and logic programming. Although investigations of computation models for higherorder functional logic languages are under way[13, 9, 8, 20, 22], implemented functional logic languages like K-LEAF[6] and Babel[18] among others, are all based on first-order models of computation. First-order narrowing has been used as basic computation mechanism. The lack of higher-order-ness is exemplified by the following prototypical program
