UPV-Curry: An incremental curry interpreter*

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Functional logic programming integrates the best features of modern functional and logic languages. The multi-paradigm declarative language Curry is an extension of Haskell which is intended to become a standard in the area. In this paper, we present UPV-Curry, an efficient and quite complete implementation of Curry based on a new, incremental definition of its basic evaluation mechanism. We compare UPV-Curry with already existing implementations of other Curry interpreters.

Cite

CITATION STYLE

APA

Alpuente, M., Escobar, S., & Lucas, S. (1999). UPV-Curry: An incremental curry interpreter*. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1725, pp. 331–339). Springer Verlag. https://doi.org/10.1007/3-540-47849-3_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free