Entry Burton:1987:FPC from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
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
- 25-3-396b-396, 25-4-496a-496,
26(2)134,
26(2)175,
26(3)205,
26(3)235,
26(3)282,
27(1)3,
27(1)62,
27(3)254,
28(3)216,
28(4)366,
28(5)487,
29(1)9,
29(1)12,
29(1)24,
29(1)33,
29(2)109,
29(2)118,
29(2)176,
29(3)229,
29(3)235,
29(3)241,
29(6)527,
30(1)20,
30(1)52,
30(2)157,
30(3)228,
30(3)249,
30(5)386,
30(5)451,
30(6)487,
31(1)9,
31(3)209,
31(3)220,
31(6)503,
31(6)570,
32(2)162,
32(4)323,
32(4)362
- 68N05,
27(4)340,
30(1)27,
30(4)378,
30(6)507,
31(1)17,
31(3)229,
32(2)122
- 68N15,
31(3)229,
32(4)290
- addition,
25(1)126,
25(4)471,
26(3)239
- allow,
31(4)296,
32(1)13
- annotated,
23(4)307,
25(2)161
- appear,
29(3)201,
31(3)243
- approach,
23(1)3,
23(1)9,
23(1)28,
23(2)114-1,
23(3)223,
23(3)256,
23(4)317,
24(3)222,
24(4)320,
25(1)12,
25(3)353,
25(4)410,
25(4)442,
25(4)492,
26(3)255,
26(3)283,
26(4)293,
26(4)360,
26(4)383,
27(1)3,
27(1)37,
27(2)171,
27(3)246,
28(1)59,
28(1)89,
28(2)97,
28(2)162,
28(4)353,
29(2)161,
29(2)189,
29(2)189-1,
29(3)222,
29(4)330,
29(5)385,
30(1)8,
30(2)119,
30(2)176,
30(3)258,
30(5)393,
30(6)507,
31(2)133,
31(2)182,
31(3)243,
31(5)409,
32(2)152,
32(2)162,
32(5)386,
32(5)437
- arbitrary,
25(1)32,
25(1)114,
28(1)5,
30(4)298,
30(5)425,
31(4)289,
31(4)325,
32(4)362
- behavior,
27(3)238,
28(3)257
- behaviour,
26(2)154,
27(3)238,
28(1)9,
28(3)257,
29(1)47,
30(2)168,
32(1)68,
32(4)290,
32(4)297,
32(5)413,
32(6)541
- both,
24(4)320,
25(4)471,
28(2)162,
29(3)201
- Burton, F. W.,
26(2)188-1,
27(4)375,
29(2)127,
30(4)355,
31(3)243
- cannot,
32(6)567
- case,
24(4)320,
25(1)148,
27(3)276,
28(2)97,
30(5)420,
31(1)25,
31(5)398,
32(1)93,
32(2)142,
32(2)175,
32(4)305
- communication, 23-3-255b-255,
23(4)369,
24(1)25,
24(1)78,
25(1)22,
25(1)87,
25(2)161,
25(4)410,
25(4)494,
26(3)247,
28(1)5,
28(3)200,
29(2)109,
29(6)506,
30(3)254,
30(5)458,
31(2)175,
31(4)289,
31(4)296,
32(3)252,
32(3)262,
32(3)267,
32(4)362,
32(5)461
- computing,
23(1)85,
23(4)324,
23(4)347,
23(4)353,
24(1)52,
24(1)96,
24(2)162,
24(2)167,
25(1)22,
25(2)188,
25(2)207,
25(2)287,
25(3)338,
25(3)397,
26(2)187,
26(2)187,
26(3)224,
26(4)296,
27(1)8,
27(2)97,
27(3)193,
28(2)117,
28(3)243,
28(5)498,
29(2)161,
29(3)229,
29(4)348,
29(4)373,
30(1)20,
30(2)110,
30(3)193,
30(3)258,
30(3)268,
30(3)277,
30(3)282,
30(4)298,
30(5)413,
30(5)420,
31(1)12,
31(2)175,
31(2)182,
31(3)201,
31(4)364,
31(6)567,
32(3)281,
32(4)362,
32(4)370,
32(5)385,
32(5)437,
32(5)453
- concurrent,
25(1)17,
25(1)37,
28(5)449,
28(5)466,
29(5)404,
29(5)423,
29(6)500,
31(2)165,
32(4)297,
32(4)341
- considered,
23(4)290
- containing,
28(2)134
- conventional,
27(4)368-1,
32(2)152
- current,
23(3)194,
24(4)290,
25(1)12,
26(3)283,
29(3)201,
31(3)243
- degree,
29(1)36,
29(2)118,
31(1)71,
32(3)194
- done,
29(4)289,
32(5)461
- efficiency,
26(1)10,
26(3)196,
28(2)179,
28(4)398,
31(4)358,
31(5)409,
32(1)93,
32(2)142,
32(3)238
- efficient,
23(2)186,
23(4)382,
23(4)383,
24(4)316,
25(2)264,
26(3)193,
28(2)184,
28(3)330,
28(4)375,
30(2)168,
30(3)282,
30(3)282-1,
30(3)283,
31(4)330,
31(6)545,
32(1)93,
32(2)127,
32(3)267
- evaluation,
23(2)142,
23(2)187-1,
24(3)288,
25(2)183,
25(2)188,
25(2)239,
25(4)493,
26(2)134,
27(1)87,
27(3)201,
28(2)128,
28(2)142,
28(3)223,
28(3)309,
28(3)319,
28(4)409,
28(4)426,
29(4)380,
29(4)380-1,
29(5)390,
29(5)396,
30(3)214,
30(3)228,
30(4)289,
30(4)362,
30(4)376,
30(6)481,
30(6)519,
31(1)12,
31(3)220,
31(4)304,
31(5)409,
31(5)437,
31(6)565,
32(1)36,
32(2)98,
32(2)142,
32(2)162,
32(5)437,
32(5)461
- except,
31(4)289,
32(2)122
- form,
23(4)324,
25(4)471,
26(1)52,
26(3)235,
26(4)312,
26(4)366,
26(4)375,
27(3)225,
28(2)117,
29(3)201,
30(1)43,
31(3)258,
32(3)241,
32(5)422,
32(6)549
- give,
31(6)496,
32(1)13,
32(2)142
- high,
23(2)124,
23(2)153,
24(1)56,
25(1)153,
25(2)176,
25(2)264,
25(3)289,
26(1)52,
26(1)72,
26(2)124,
26(2)175,
26(3)228,
26(3)277,
26(4)344,
26(4)360,
26(4)366,
27(1)37,
27(1)83,
27(2)97,
27(2)151,
28(1)34,
28(3)231,
28(3)250,
28(4)391,
29(2)118,
29(3)229,
29(3)253,
29(4)289,
29(4)340,
29(6)500,
29(6)506,
29(6)538,
30(2)128,
30(6)487,
30(6)558,
31(2)99,
31(2)110,
31(3)220,
31(3)243,
32(1)36,
32(1)90,
32(2)127,
32(2)152,
32(2)162,
32(4)290,
32(4)297,
32(4)305,
32(4)312,
32(4)323,
32(4)341,
32(5)413
- interaction,
30(6)507,
31(5)445
- level,
23(2)124,
23(2)153,
24(1)25,
24(1)56,
24(1)62,
25(1)153,
25(2)176,
25(2)264,
25(3)289,
25(4)429,
26(1)52,
26(1)72,
26(2)124,
26(2)175,
26(2)188,
26(3)228,
26(3)235,
26(3)277,
26(4)344,
26(4)360,
26(4)366,
27(1)83,
27(2)97,
27(2)151,
27(4)334,
28(1)34,
28(3)250,
28(4)357,
29(2)118,
29(3)229,
29(3)253,
29(4)340,
29(6)500,
29(6)506,
29(6)538,
30(1)52,
30(2)128,
30(6)487,
31(2)99,
31(2)110,
31(3)220,
31(3)229,
31(3)243,
31(4)344,
32(1)36,
32(1)90,
32(2)127,
32(2)152,
32(2)162,
32(4)290,
32(4)297,
32(4)305,
32(4)312,
32(4)323,
32(4)341,
32(5)413
- loss,
25(4)471,
26(3)218,
32(2)142
- mechanism,
23(2)147,
25(1)17,
25(1)87,
26(1)52,
27(1)47,
28(3)298,
29(1)1,
29(2)109,
29(3)241,
29(4)361,
31(4)296,
31(6)503,
31(6)525,
32(1)13,
32(1)24,
32(1)63,
32(4)341
- message,
24(1)17,
24(1)56,
25(4)410,
29(2)109,
30(6)541,
31(4)289,
31(4)313,
32(1)13,
32(1)29,
32(4)362
- more,
23(2)142,
28(2)162,
31(4)289,
32(1)13,
32(2)152
- name,
24(1)95,
25(1)2,
27(1)47,
31(2)110
- need,
28(2)97,
28(3)203,
31(4)289,
31(5)391,
31(5)420,
31(5)426,
31(5)431,
32(2)142,
32(4)370,
32(5)461
- one,
23(2)165,
27(4)368-1,
28(3)313,
28(5)530,
31(6)496,
32(1)13,
32(2)152,
32(2)175,
32(5)461
- parameter,
23(1)85,
25(1)116,
27(1)84,
29(4)330,
31(1)12,
32(4)305
- particular,
31(4)289,
32(2)98,
32(2)122,
32(2)162,
32(2)175
- passing,
32(1)29
- procedural,
23(2)132,
27(1)47,
28(1)17,
31(3)243,
32(1)36
- processor,
23(2)147,
24(1)14,
24(1)62,
25(1)22,
25(4)423,
27(4)348,
28(1)29,
28(1)34,
28(2)148,
28(3)243,
28(4)357,
29(1)12,
29(4)289,
29(5)390,
29(6)486,
30(2)119,
30(3)214,
30(5)386,
30(5)393,
30(5)404,
30(5)413,
30(5)420,
30(5)433,
31(1)12,
31(6)517,
31(6)540,
31(6)545,
32(1)29,
32(1)91,
32(2)127,
32(2)142,
32(2)152,
32(2)175,
32(3)194,
32(3)276,
32(5)422,
32(5)437,
32(5)445,
32(6)571
- programmer,
26(2)154,
26(2)175,
27(1)37,
27(4)354,
30(1)52,
31(3)243,
32(2)175
- propose,
31(3)243
- proposed,
25(4)471,
26(1)60,
27(4)368-1,
29(4)289,
32(2)162,
32(5)461
- relational,
24(2)112,
24(4)312,
25(1)68,
25(1)135,
27(4)301,
28(1)82,
28(2)162,
28(2)170,
28(4)391,
28(4)398,
28(5)501,
29(1)38,
29(3)261,
29(4)348,
29(4)378,
29(4)378,
29(5)451,
29(5)458,
30(2)157,
30(5)404,
31(1)34,
31(1)41,
31(1)51,
31(2)125,
31(2)141,
31(2)147,
31(2)155,
31(3)253,
31(3)258,
31(6)550,
32(1)63,
32(1)90
- rendezvous,
32(3)267
- result,
24(4)320,
27(4)368-1,
29(3)212,
31(3)220,
31(3)253,
32(5)461
- run-time,
28(3)257,
29(3)253,
29(6)538,
31(3)243,
32(4)305
- semaphore,
25(1)121,
32(1)24,
32(1)45
- sequential,
23(1)37,
24(1)78,
25(4)486,
26(1)43,
26(3)277,
27(4)321,
28(2)179,
28(3)291,
29(4)368,
29(6)500,
29(6)506,
30(3)258,
30(6)529,
30(6)565,
31(1)41,
32(1)93,
32(2)152
- set,
23(1)46,
23(2)107,
23(2)187,
24(2)184,
25(1)140,
25(2)183,
25(3)340,
27(1)72,
27(3)209,
27(3)283,
27(3)283-1,
27(4)294,
28(3)298,
28(4)406,
28(5)496,
29(3)277,
30(3)258,
30(5)393,
31(1)65,
31(3)283,
31(4)325,
32(1)86,
32(3)281,
32(4)370,
32(4)374
- significant,
32(5)422
- similar,
32(2)122
- simple,
25(2)193,
26(1)68,
26(2)164,
28(2)142,
28(4)372,
29(3)201,
30(3)268,
30(4)295,
31(1)61,
32(1)93,
32(2)162
- since,
32(2)175
- small,
25(3)396,
30(3)239,
30(4)295,
30(4)343,
32(2)122,
32(2)142,
32(6)533
- specify,
26(3)235
- such,
31(3)243,
31(4)296,
32(2)108,
32(2)142,
32(2)152,
32(2)162,
32(2)175
- synchronization,
25(1)121,
29(2)109,
31(6)496,
32(1)24
- there,
31(4)289,
32(2)122,
32(2)162
- time, run-,
29(3)253,
31(3)243,
32(4)305
- transform,
25(2)278-1,
28(5)530,
30(1)43,
32(4)351
- two,
23(2)142,
24(4)339,
24(4)343,
25(2)169,
26(3)247,
27(2)176,
27(3)270,
27(4)368-1,
28(2)184,
28(3)313,
29(6)506,
30(4)316,
31(5)474,
32(2)98,
32(3)238
- unavoidable,
31(3)243
- use,
23(2)107,
24(1)95,
25(2)218,
26(1)93,
26(3)235,
28(2)162,
28(3)203,
29(1)52,
29(2)167,
29(4)289,
29(5)430,
30(1)80,
30(3)214,
30(4)362,
30(5)451,
31(3)243,
31(4)289,
31(5)420,
32(2)122,
32(2)152,
32(4)333,
z(z)z
- using,
23(1)41,
23(2)142,
23(4)380,
23(4)381,
24(2)118,
24(3)263,
24(3)271,
24(4)295,
24(4)324,
25(1)63,
25(1)84,
26(2)113,
26(4)344,
28(2)112,
28(4)409,
28(4)414,
29(2)118,
29(2)176,
29(2)182,
29(3)201,
29(5)423,
29(6)564,
30(1)87,
30(2)176,
30(4)298,
30(4)343,
30(6)541,
31(3)201,
31(3)269,
31(4)289,
31(6)525,
31(6)567,
31(6)570,
32(2)142,
32(3)273,
32(4)341,
32(5)470
- value,
24(2)118,
25(1)116,
26(2)109,
26(2)188,
27(3)209,
28(3)309,
30(3)268,
30(4)355,
30(5)451,
31(2)133,
31(3)243,
31(4)296,
32(4)305,
32(4)374
- view,
30(5)393,
31(3)269,
32(2)175,
32(4)333,
32(6)524
- which,
23(2)142,
24(4)320,
29(3)201,
30(3)214,
31(3)243,
31(4)289,
31(4)296,
32(1)13,
32(1)45,
32(1)93,
32(2)108,
32(2)122,
32(2)142,
32(2)162,
32(5)461
- work,
24(4)320,
26(1)93,
31(6)496,
32(4)377
- write,
32(2)162