UPV-Curry

An Incremental Curry interpreter with polymorphic types and monadic declarative I/O

Curry is a functional logic programming language that combines the best ideas of existing declarative languages in an elegant, practical, comprehensive, and seamless way. Curry includes higher-order features, a type system, a module system, modern evaluation strategies, non-determinism, encapsulated search, partial data structures, existential variables, constraints, and declarative I/O.

UPV-Curry is a novel implementation of Curry which has been developed by the ELP group at the Technical University of Valencia (UPV). A description of the UPV-Curry system is available here. And the correctness proof of its incremental needed narrowing algorithm can be found here.

The main features of the UPV-Curry system are:

• Higher order functions (including lambda abstractions and Haskell sections).
• Curry constraint solver.
• Local declarations.
• Basic built-in types: Booleans, Integers, Characters, Strings, Lists, and Tuples.
• A polymorphic Hindley/Milner type system.
• A complete implementation of the monadic I/O declarative model.
• Updated to November 23 1998 Curry description.

UPV-Curry is an interactive programming environment which provides:

• a small self-contained Curry implementation, which constitutes a portable stand-alone SICStus Prolog application.
• a read-eval-point loop for displaying the solution for each expression which is entered as an input to the interpreter.
• naïve browsing facilities which are able to obtain the type and the definitional tree of each function.
• a debugging module, which allows the user to trace the evaluation of goals.

A detailed user's manual describing the system and the use of UPV-Curry is available.

You can get the UPV-Curry system here (45k). Last version of April 11, 2001.

Last update Apr 2001 # sescobar@dsic.upv.es