Path: utzoo!mnetor!uunet!lll-winken!lll-tis!ames!ncar!noao!arizona!debray
From: debray@arizona.edu (Saumya Debray)
Newsgroups: comp.lang.prolog
Subject: Re: deterministic predicates
Message-ID: <5244@megaron.arizona.edu>
Date: 29 Apr 88 03:57:14 GMT
References: <2714@mulga.oz>
Organization: U of Arizona CS Dept, Tucson
Lines: 26
Summary: References on determinacy analysis



Several people have looked at the connection between predicate determinacy 
and modes.  Some references that come to mind:

- U. S. Reddy, "Transformation of Logic Programs into Functional Programs",
  Proc. SLP-84, Atlantic City, NJ, Feb. 1984.

- C. S. Mellish, "Some Global Optimizations for a Prolog Compiler",
  J. Logic Programming vol 2 no. 1, Apr 1985.

- S. K. Debray and D. S. Warren, "Detection and Optimization of Functional
  Computations in Prolog", Proc. 3d ICLP, London, Jul 1986.

Also, a paper by Gert Smolka:

- G. Smolka, "Making Control and Data Flow in Logic Programs Explicit",
  Proc. 1984 Symp. on Lisp and Func. Prog., Austin, TX, Aug. 1984.

may be relevant (it's been so long since I read the paper I've forgotten
if he treats this issue explicitly, but it's a good paper that people ought
to read anyway).
-- 
Saumya Debray		CS Department, University of Arizona, Tucson

     internet:   debray@arizona.edu
     uucp:       {allegra, cmcl2, ihnp4} !arizona!debray