@techreport{R-93-20, TITLE = {Dependency-Based Groundness Analysis of Functional Logic Programs}, AUTHOR = {Johan Boye and Jukka Paakki and Jan Maluszynski}, YEAR = {1993}, NUMBER = {R-93-20}, INSTITUTION = ida, ADDRESS = idaaddr, ABSTRACTURL = {/publications/cgi-bin/tr-fetch.pl?r-93-20+abstr}, ABSTRACT = {Many Prolog systems offer the facility of calling external functions written in non-logic programming languages. A basic requirement is often that the arguments of the functions must be ground at invocation time, otherwise an error is reported, or the call is delayed until the arguments are sufficiently instantiated. The drawback of the latter method is twofold: (1) the arguments might never be instantiated, and (2) the dynamic checks used by the delaying mechanism are expensive. This paper presents a method, which for a given program identifies a class of atomic goals for which (1) will not occur. Moreover, we describe a method for transforming a program into an equivalent program, for which dynamic delays are avoided.}, IDANR = {LiTH-IDA-R-93-20}, NOTE = {A short version accepted to PLILP'93 under the title Avoiding dynamic delays in functional logic programs, Tallinn, Estonia, August 26-28, 1993}