Entry Burton:1988:NRT 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: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
- 25-4-494a-494,
27(1)87,
27(3)230,
28(4)366,
29(2)103,
30(2)97,
30(3)258,
31(5)420,
31(6)481
- always,
31(4)296
- amount,
32(5)461
- appear,
29(3)201,
30(5)437
- 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(5)437,
30(6)507,
31(2)133,
31(2)182,
31(5)409,
32(2)152,
32(2)162,
32(5)386,
32(5)437
- argument,
32(4)305,
32(5)461
- available,
28(3)195,
30(3)214,
32(2)152
- Burton, F. W.,
26(2)188-1,
27(4)375,
29(2)127,
30(4)355,
30(5)437
- compatible,
31(4)296
- construct,
27(1)83,
27(2)97,
28(2)162,
29(5)404,
29(5)423,
29(6)506,
30(6)487,
31(6)531,
32(1)90
- current,
23(3)194,
24(4)290,
25(1)12,
26(3)283,
29(3)201,
30(5)437
- equivalent,
28(5)449,
32(1)93
- existing,
28(3)211,
30(2)157
- expression,
24(3)288,
25(2)239,
25(3)316,
25(3)340,
26(3)193,
26(4)366,
29(5)416,
29(5)423,
30(2)128,
30(4)289,
31(3)220,
32(1)24,
32(5)461
- fixed,
23(1)37,
24(4)339,
25(1)87,
25(2)231,
28(4)379,
30(6)558,
32(1)13,
32(3)228
- foundation,
32(1)1
- function,
23(2)165,
23(3)286,
24(1)42,
25(3)379,
25(3)397,
25(4)448,
28(1)54,
29(1)9,
29(1)38,
29(3)277,
29(4)289,
30(1)27,
31(1)17,
31(3)209,
31(3)229,
31(6)510,
32(1)36,
32(1)93,
32(2)98,
32(2)122,
32(4)305,
32(5)461
- general-purpose,
25(2)176,
28(3)270
- have,
24(4)320,
29(4)289,
32(1)13,
32(2)142,
32(2)152,
32(2)162,
32(5)461
- 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(5)437,
30(6)487,
30(6)558,
31(2)99,
31(2)110,
31(3)220,
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
- infinite,
32(2)162
- input,
23(1)34,
24(3)256,
25(2)207,
27(2)143,
29(1)36,
29(5)390,
31(6)550,
32(5)453
- 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(5)437,
30(6)487,
31(2)99,
31(2)110,
31(3)220,
31(3)229,
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
- make,
31(4)289
- many,
24(4)320,
31(6)510,
32(5)461
- mathematical,
24(2)177,
24(2)180,
24(2)184,
25(1)7,
25(1)56,
25(4)478,
26(1)6,
26(2)97,
26(2)106,
26(3)193,
27(2)165,
27(4)368-1,
28(1)5,
28(1)78,
28(1)89,
28(2)142,
28(2)179,
28(4)414,
28(4)417,
28(4)426,
28(5)498,
28(5)524,
28(5)530,
28(5)538,
29(1)36,
29(1)52,
29(2)171,
29(2)176,
29(2)182,
29(4)378,
29(5)416,
29(6)553,
30(1)16,
30(1)20,
30(1)70,
30(2)128,
30(2)189,
30(3)258,
30(3)268,
30(3)282,
30(4)298,
30(5)458,
30(6)498,
30(6)569,
31(1)61,
31(1)71,
31(1)76,
31(2)155,
31(3)229,
31(3)283,
31(4)364,
31(6)490,
31(6)545,
31(6)557,
31(6)564,
31(6)567,
32(1)45,
32(1)68,
32(1)76,
32(1)86,
32(1)93,
32(2)175,
32(4)351,
32(4)374,
32(4)377
- may,
24(4)320,
26(3)235,
31(4)289,
32(2)108,
32(2)152
- must,
31(4)296,
32(2)162
- nondeterministic,
29(2)109,
29(6)506
- not,
23(2)142,
27(4)376,
31(4)296,
31(4)379,
32(2)142,
32(2)162
- other,
31(6)496,
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)262,
32(3)276,
32(5)422,
32(5)445
- procedural,
23(2)132,
27(1)47,
28(1)17,
30(5)437,
32(1)36
- programmer,
26(2)154,
26(2)175,
27(1)37,
27(4)354,
30(1)52,
30(5)437,
32(2)175
- propose,
30(5)437
- purpose, general-,
28(3)270
- referential,
28(1)44
- run,
25(1)114,
25(1)116,
25(2)193,
28(1)9,
30(5)475,
32(2)152
- run-time,
28(3)257,
29(3)253,
29(6)538,
30(5)437,
32(4)305
- solve,
29(2)176
- such,
30(5)437,
31(4)296,
32(2)108,
32(2)142,
32(2)152,
32(2)162,
32(2)175
- then,
28(2)162
- time,
23(1)34,
23(2)147,
23(2)153,
23(3)262,
23(4)290,
24(1)85,
24(2)156,
25(1)32,
25(1)45,
25(2)193,
25(4)429,
26(2)154,
26(3)224,
26(4)293,
26(4)320,
27(1)27,
27(3)201,
27(3)246,
27(3)254,
27(4)368-1,
28(1)9,
28(1)54,
28(1)78,
28(2)105,
28(3)309,
28(4)409,
28(4)412,
29(1)47,
29(1)52,
29(2)103,
29(2)118,
29(2)176,
29(3)229,
29(3)269,
29(5)390,
29(5)396,
29(5)436,
30(3)249,
30(4)362,
30(4)372,
30(4)376,
30(5)475,
30(6)519,
30(6)535,
31(3)279,
31(3)283,
31(6)496,
31(6)545,
31(6)553,
32(3)212,
32(3)228,
32(3)241,
32(4)374,
32(5)474
- time, run-,
29(3)253,
30(5)437,
32(4)305
- unavoidable,
30(5)437
- 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)437,
30(5)451,
31(4)289,
31(5)420,
32(2)122,
32(2)152,
32(4)333,
z(z)z
- 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)437,
30(5)451,
31(2)133,
31(4)296,
32(4)305,
32(4)374
- which,
23(2)142,
24(4)320,
29(3)201,
30(3)214,
30(5)437,
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