Computer Science – Programming Languages
Scientific paper
2004-04-24
Theory and Practice of Logic Programming, vol. 1, no. 2, 2001
Computer Science
Programming Languages
Appeared in Theory and Practice of Logic Programming, vol. 1, no. 2, 2001
Scientific paper
We propose a general framework for first-order functional logic programming, supporting lazy functions, non-determinism and polymorphic datatypes whose data constructors obey a set C of equational axioms. On top of a given C, we specify a program as a set R of C-based conditional rewriting rules for defined functions. We argue that equational logic does not supply the proper semantics for such programs. Therefore, we present an alternative logic which includes C-based rewriting calculi and a notion of model. We get soundness and completeness for C-based rewriting w.r.t. models, existence of free models for all programs, and type preservation results. As operational semantics, we develop a sound and complete procedure for goal solving, which is based on the combination of lazy narrowing with unification modulo C. Our framework is quite expressive for many purposes, such as solving action and change problems, or realizing the GAMMA computation model.
Arenas-Sanchez Puri
Rodríguez-Artalejo Mario
No associations
LandOfFree
A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-393486