The deevolution of concurrent logic programming languages

https://doi.org/10.1016/0743-1066(94)00038-8Get rights and content
Under an Elsevier user license
open archive

Abstract

This article surveys the field of implementation of concurrent logic programming languages. I briefly review language semantics and programming paradigms, before summarizing the results of the past decade in compiler and runtime system implementation. A theme throughout the research presented is the deevolution of concurrent logic programming languages due to the limitations of what systems designers and compiler writers can efficiently implement, as well as the growing perception among programmers that reduced expressivity is sufficient.

Cited by (0)

The author was supported by an NSF Presidential Young Investigator award, with matching funds from Sequent Computer Systems Inc., and a grant from the Institute for New Generation Computer Technology (ICOT). I thank the anonymous referees, and particularly Kazunori Ueda for his insightful and plentiful comments. I also thank Takashi Chikayama, Jim Crammond, Saumya Debray, Ian Foster, and Catuscia Palamidessi for sharing their expert knowledge, greatly assisting in the completion of the article. Finally, I thank members of ICOT and the Monaco group for many fruitful discussions.