A General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types

Simple item page
dc.creatorArenas-Sanchez, Puri
dc.creatorRodriguez-Artalejo, Mario
dc.date2004-04-24
dc.date.accessioned2026-07-07T03:21:08Z
dc.date.available2026-07-07T03:21:08Z
dc.descriptionWe 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.
dc.descriptionAppeared in Theory and Practice of Logic Programming, vol. 1, no. 2, 2001
dc.identifierhttps://arxiv.org/abs/cs/0404050
dc.identifierhttp://arxiv.org/abs/cs/0404050
dc.identifierTheory and Practice of Logic Programming, vol. 1, no. 2, 2001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32087
dc.subjectProgramming Languages
dc.subjectD.1.6; D.3.2
dc.titleA General Framework For Lazy Functional Logic Programming With Algebraic Polymorphic Types
dc.typetext

Files

Collections

arXiv