Entry PeytonJones:1989:PIF 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{PeytonJones:1989:PIF,
author = "Simon L. {Peyton Jones}",
title = "Parallel Implementations of Functional Programming
Languages",
journal = j-COMP-J,
volume = "32",
number = "2",
pages = "175--186",
month = apr,
year = "1989",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/32.2.175",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:26 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/32/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/;
Misc/Functional.bib; Parallel/Pfpbib.bib;
Theory/CLiCS.bib",
URL = "http://comjnl.oxfordjournals.org/content/32/2/175.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/175.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/176.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/177.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/178.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/179.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/180.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/181.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/182.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/183.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/184.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/185.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/186.tif",
abstract = "One of the most attractive features of functional
programming languages is their suitability for
programming parallel computers. This paper is devoted
to discussion of such a claim. Firstly, parallel
functional programming is discussed from the
programmer's point of view. Secondly, since most
parallel functional language implementations are based
on the concept of graph reduction, the issues raised by
graph reduction are discussed. Finally, the paper
concludes with a case study of a particular parallel
graph reduction machine and a survey of other parallel
architectures.",
acknowledgement = ack-nhfb,
affiliation = "Univ. Coll.",
affiliationaddress = "London, Engl",
classcodes = "C6150C (Compilers, interpreters and other processors);
C6110 (Systems analysis and programming)",
classification = "723; 921; C6110 (Systems analysis and programming);
C6150C (Compilers, interpreters and other processors)",
corpsource = "Univ. Coll., London, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "compilers; Computer Systems, Digital--Parallel
Processing; functional programming; Functional
Programming Languages; functional programming
languages; Graph reduction; graph reduction; graph
reduction machine; Mathematical Techniques--Graph
Theory; parallel; parallel architectures; Parallel
architectures, Computer Programming Languages; Parallel
computers; parallel computers; Parallel functional
programming; parallel functional programming; Parallel
graph reduction machine; Parallel Graph Reduction,
Para-Functional Programming, Dataflow, Peyton Jones
grip graph reduction, Functional programming languages;
Parallel Programming; parallel programming; program",
thesaurus = "Functional programming; Parallel programming; Program
compilers",
treatment = "P Practical",
}
Related entries
- architecture,
23(2)115,
23(4)382,
24(1)25,
24(1)62,
24(2)139,
24(3)210,
24(4)353,
25(1)74,
25(1)153,
25(2)207,
26(1)43,
26(3)208,
27(2)127,
27(3)254,
27(4)294,
27(4)362,
28(2)105,
28(2)138,
28(2)170,
28(3)282,
29(2)103,
29(2)182,
29(4)300,
29(5)416,
29(5)451,
29(6)486,
30(2)110,
30(2)157,
30(2)189,
30(3)214,
30(4)289,
30(5)404,
30(5)413,
32(1)29,
32(3)267,
32(3)281,
32(4)370,
32(5)453,
32(5)461,
32(6)505
- based,
23(2)124,
23(2)142,
25(1)105,
25(4)471,
26(1)10,
27(1)67,
27(2)127,
27(4)368-1,
28(3)298,
29(4)340,
30(3)249,
30(5)469,
31(2)155,
31(6)481,
32(3)241,
32(4)297,
32(5)453,
32(5)461
- C6110,
31(5)391,
31(5)420,
31(5)426,
31(5)431,
31(6)481,
31(6)531,
31(6)545,
32(1)1,
32(2)98,
32(2)122,
32(2)142,
32(2)152,
32(3)202,
32(4)290,
32(4)305,
32(4)323,
32(4)333,
32(4)341,
32(5)461
- C6150C,
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(3)276,
32(5)422,
32(5)445
- case,
24(4)320,
25(1)148,
27(3)276,
28(2)97,
30(5)420,
30(5)437,
31(1)25,
31(5)398,
32(1)93,
32(2)142,
32(4)305
- compiler,
23(2)115,
23(2)147,
23(3)211,
23(3)212,
23(3)223,
23(3)273,
24(2)107,
25(1)17,
25(3)331,
26(1)15,
26(2)142,
26(2)164,
27(3)233,
27(4)348,
28(1)9,
28(2)128,
28(3)257,
29(2)151,
29(3)253,
30(2)183,
30(4)328,
30(6)519,
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(3)276,
32(5)422,
32(5)445
- concept,
23(3)211,
23(4)369,
24(2)97,
25(1)34,
25(1)135,
25(2)183,
26(3)235,
27(1)67,
28(2)112,
29(2)135,
30(4)316,
30(6)487
- dataflow,
28(3)264,
30(4)289
- Digital--Parallel,
32(4)341
- discussed,
29(4)289,
31(4)296
- discussion,
23(1)28,
23(1)90,
23(3)286,
23(4)377,
24(1)92,
31(4)296
- feature,
23(2)142,
28(3)223,
30(3)214,
32(1)21,
32(2)98
- graph,
23(3)237,
24(1)85,
25(3)338,
25(3)397,
27(1)86,
27(2)165,
28(1)5,
28(1)44,
28(1)78,
28(2)105,
29(6)531,
29(6)553,
30(1)16,
30(1)20,
30(2)128,
30(6)498,
31(1)71,
31(1)76,
31(2)155,
31(3)253,
31(4)289,
31(4)304,
31(6)545,
32(1)45,
32(4)290,
32(5)461,
32(5)474
- Graph, Techniques-,
31(6)545,
32(1)45
- implementation,
23(3)212,
23(3)233,
24(1)71,
24(2)191,
24(4)384-2,
25(1)74,
25(3)307,
25(3)399,
25(4)471,
26(2)134,
26(2)164,
26(2)187,
26(3)235,
27(2)127,
27(3)260,
28(1)22,
28(2)97,
28(2)128,
28(4)391,
29(2)97,
29(3)201,
29(3)269,
29(6)500,
30(2)97,
30(2)157,
30(3)282,
30(3)282-1,
30(5)393,
30(5)420,
31(1)56,
31(2)116,
31(2)125,
31(2)147,
31(4)330,
31(5)398,
31(6)531,
31(6)545,
32(1)93,
32(2)127,
32(2)142,
32(2)152,
32(3)267,
32(4)312,
32(5)422
- interpreter,
23(3)223,
26(2)164,
30(1)37,
30(1)43,
30(6)519,
31(2)110,
31(6)517,
31(6)525,
31(6)540,
31(6)545,
32(1)29,
32(1)91,
32(2)108,
32(2)127,
32(2)142,
32(2)152,
32(3)276,
32(5)422,
32(5)445
- issue,
24(1)8,
24(2)138,
24(3)255,
24(4)382,
29(3)201
- machine,
23(3)229,
25(1)153,
26(4)293,
27(3)254,
27(3)283,
28(2)148,
28(5)449,
29(5)396,
29(5)451,
30(2)110,
30(3)214,
30(5)386,
30(5)393,
30(5)420,
31(4)325,
31(5)386,
31(5)391,
31(5)398,
31(5)409,
31(5)420,
31(5)426,
31(5)431,
31(5)437,
31(5)457,
31(6)490,
32(1)36,
32(2)127,
32(2)152,
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)243,
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(4)351,
32(4)374,
32(4)377
- most,
29(3)277,
32(1)93
- one,
23(2)165,
27(4)368-1,
28(3)313,
28(5)530,
30(5)437,
31(6)496,
32(1)13,
32(2)152,
32(5)461
- other,
31(3)243,
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(3)262,
32(3)276,
32(5)422,
32(5)445
- paper,
23(1)33,
24(1)95,
25(4)471,
26(2)109,
26(3)235,
27(3)288-2,
27(4)368-1,
28(1)1,
28(2)104-2,
28(4)446-1,
29(3)201,
29(3)277,
29(4)289,
29(5)477-1,
31(5)457,
31(6)496,
32(2)98,
32(2)142,
32(2)152,
32(5)422
- Parallel, Digital-,
32(4)341
- particular,
30(5)437,
31(4)289,
32(2)98,
32(2)122,
32(2)162
- point,
23(2)189,
23(2)190,
24(1)52,
24(1)94,
25(1)7,
25(1)126,
25(2)231,
25(4)471,
27(1)18,
29(1)76,
32(5)432
- 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,
30(5)437,
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(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,
30(5)437,
31(3)243
- reduction,
23(2)142,
27(2)165,
28(1)78,
28(2)184,
28(3)270,
28(4)439,
30(3)214,
32(5)461
- since,
30(5)437
- study,
23(4)290,
24(3)230,
24(4)320,
25(2)161,
26(3)283,
26(4)303,
28(1)9,
28(2)97,
29(2)118,
31(4)344,
31(5)398,
31(6)550
- such,
30(5)437,
31(3)243,
31(4)296,
32(2)108,
32(2)142,
32(2)152,
32(2)162
- suitability,
32(3)202
- survey,
23(4)377,
24(2)139,
25(1)130,
26(4)354,
28(1)82,
28(5)474,
30(3)233
- Techniques--Graph,
31(6)545,
32(1)45
- view,
30(5)393,
30(5)437,
31(3)269,
32(4)333,
32(6)524