Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Lassez:1985:OFL,
author = "J.-L. Lassez and M. J. Maher",
title = "Optimal fixedpoints of logic programs",
journal = j-THEOR-COMP-SCI,
volume = "39",
number = "1",
pages = "15--25",
month = jul,
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C6110 (Systems analysis and programming)",
conflocation = "Bangalore, India; 12-14 Dec. 1983",
conftitle = "Third Conference on Foundations of Software Technology
and Theoretical Computer Science",
corpsource = "Dept. of Comput. Sci., Melbourne Univ., Parkville,
Vic., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "least fixedpoint semantics; logic programming; logic
programs; optimal fixed points; recursive programming",
pubcountry = "Netherlands A02",
sponsororg = "Nat. Centre Software Dev. and Comput. Tech",
treatment = "T Theoretical or Mathematical",
}