Entry Burton:1988:NRT from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Burton:1988:NRT,
  author =       "F. W. Burton",
  title =        "Nondeterminism with Referential Transparency in
                 Functional Programming Languages",
  journal =      j-COMP-J,
  volume =       "31",
  number =       "3",
  pages =        "243--247",
  month =        jun,
  year =         "1988",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/31.3.243",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  bibdate =      "Tue Dec 4 14:48:24 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/31/3.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_03/;
                 Misc/Functional.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/31/3/243.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_03/tiff/243.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_03/tiff/244.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_03/tiff/245.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_03/tiff/246.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_03/tiff/247.tif",
  abstract =     "Procedural programmers have found nondeterminism to be
                 unavoidable in many parallel programs (e.g. operating
                 systems). If functional programming languages are to be
                 usable as general-purpose parallel-programming
                 languages then provision of some nondeterministic
                 language constructs appears to be necessary. Existing
                 constructs for nondeterminism are not functional and
                 are not compatible with the mathematical foundations of
                 functional programming, which require that the value of
                 a function be uniquely determined by the values of its
                 arguments. We propose to solve this problem by placing
                 the nondeterminism in pseudo-data. A program is passed
                 an infinite tree of two-valued decisions, along with
                 its input. These decisions may be fixed at run time,
                 thereby permitting nondeterminism. Once fixed, a
                 decision remains unchanged, so equivalent expressions
                 must always have the same value. The approach
                 generalizes so that a program can make use of other
                 run-time information such as the current time or the
                 current amounts of available storage.",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of Utah, Salt Lake City, UT, USA",
  affiliationaddress = "Univ of Utah, Salt Lake City, UT, USA",
  classcodes =   "C6110 (Systems analysis and programming); C6140D (High
                 level languages)",
  classification = "723",
  corpsource =   "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
                 USA",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "available storage; computer programming languages;
                 functional programming languages; high level languages;
                 language construct; nondeterminism; nondeterminism with
                 referential transparency; operating systems; parallel
                 programming; parallel programs; parallel-programming
                 languages; pseudo-data; referential transparency;
                 run-time information; Theory",
  treatment =    "P Practical",
}

Related entries