Entry Burton:1987:FPC 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:1987:FPC,
  author =       "F. W. Burton",
  title =        "Functional programming for concurrent and distributed
                 computing",
  journal =      j-COMP-J,
  volume =       "30",
  number =       "5",
  pages =        "437--450",
  month =        oct,
  year =         "1987",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/30.5.437",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "68N05 (68N15)",
  MRnumber =     "911 966",
  bibdate =      "Tue Dec 4 14:48:23 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/30/5.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/;
                 Misc/Functional.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/30/5/437.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/437.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/438.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/439.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/440.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/441.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/442.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/443.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/444.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/445.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/446.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/447.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/448.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/449.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/450.tif",
  abstract =     "There are at least two approaches to the desing of
                 languages for parallel computing. One approach is to
                 use functional or relational languages which are easy
                 to read, write, transform and verify. The more
                 conventional approach is to use procedural languages
                 which give a programmer a high degree of control over
                 the run-time behavior of a program. There is a need to
                 reconcile these two approaches in a language which
                 permits both simplicity and efficiency. We propose a
                 small and simple set of annotations (or pragmas) to
                 control the run-time behavior of a functional program.
                 The annotations allow a programmer to use three forms
                 of parameter passing. The parameter-passing mechanisms
                 correspond to passing by name, value and need in a
                 sequential language. In addition, in a distributed
                 system a programmer can specify that work should be
                 done on the current processor, an arbitrary processor,
                 or a particular processor such as the one containing a
                 specific data item. The annotations cannot affect the
                 meaning (result) of a functional program, except for
                 causing non-termination in some cases (which we view as
                 an extreme form of inefficiency). This separation of
                 meaning from control allows a program to be both simple
                 and efficient. Since non-determinism appears to be
                 unavoidable without significant loss of efficiency in a
                 concurrent system, the interaction of the proposed
                 annotations with non-determinism is briefly considered.
                 The run-time behavior of an annotated functional
                 program is similar to that of a procedural programs
                 using message passing, semaphores ore rendezvous to
                 control communication and synchronization.",
  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)",
  classification = "722; 723; 921",
  corpsource =   "Dept. of Comput. Sci., Utah Univ., Salt Lake City, UT,
                 USA",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "annotations/pragmas; computer programming languages
                 --- Design; computer systems, digital; concurrent
                 computing; concurrent system; distributed computing;
                 functional programming; high level languages;
                 languages; parallel computing; Parallel Processing;
                 parallel programming; parameter passing; procedural
                 languages; relational; run-time behavior control,
                 annotations parallel pragmas; run-time behaviour;
                 sequential evaluation; sequential language",
  treatment =    "P Practical",
}

Related entries