Last update: Thu Sep 27 02:46:46 MDT 2018
@Article{Nguyen:1981:DPL,
author = "V. L. Nguyen and J. L. Lassez",
title = "A dual problem to least fixed points",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "211--221",
month = nov,
year = "1981",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer Sci., Univ. of Melbourne, Parkville,
Vic., Australia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "continuous functions; continuous lattices; dual
problem; duality (mathematics); least fixed points;
maximal ascending sequences; minimal continuous
functions; programming theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}