Entry Maurer:1983:UCT from complngs.bib
Last update: Thu Jun 20 02:00:37 MDT 2019
Top |
Symbols |
Numbers |
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{Maurer:1983:UCT,
author = "Peter M. Maurer and Arthur E. Oldehoeft",
title = "Use of Combinators in Translating a Purely Functional
Language to Low-Level Data-Flow Graphs",
journal = j-COMP-LANGS,
volume = "8",
number = "1",
pages = "27--45",
month = "????",
year = "1983",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Tue Mar 25 14:04:06 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
classcodes = "C6140D (High level languages); C6150C (Compilers,
interpreters and other processors)",
classification = "723",
corpsource = "Dept. of Computer Sci., Iowa State Univ., Ames, IA,
USA",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "combinators; computer programming languages;
data-driven flow architectures; demand driven data
flow; FCL; functional language; high level; high level
languages; higher-order functional; interpreters;
languages; low-level data-flow graphs; parallel
processing; program; programming language",
treatment = "P Practical",
}
Related entries
- architecture,
4(1)29,
4(1)49,
9(2)97,
18(1)17,
19(3)185,
20(3)135,
20(4)253,
20(4)267,
21(1)17,
21(1)49,
21(2)101,
21(3)165,
22(4)237,
23(2)121,
24(3)125,
27(1)3,
40(2)53,
41(z)21,
42(z)22,
54(z)71
- combinator,
10(3)211,
19(3)205
- data-driven,
5(3)163
- data-flow,
5(3)141,
21(1)49,
26(2)67
- driven,
1(3)233,
2(4)179,
3(2)65,
40(2)53,
49(z)174,
50(z)127,
50(z)159,
51(z)1,
51(z)118,
54(z)199
- driven, data-,
5(3)163
- flow,
1(2)161,
1(3)197,
3(1)1,
3(3)163,
4(3)155,
5(3)141,
7(1)41,
7(2)53,
8(2)69,
9(2)97,
9(3)203,
10(1)37,
10(2)91,
13(2)75,
13(3)109,
15(2)83,
19(2)105,
21(1)49,
21(3)165,
28(1)3,
29(1)15,
35(1)63,
50(z)82,
54(z)273
- flow, data-,
5(3)141,
21(1)49,
26(2)67
- functional,
3(1)31,
8(3)113,
9(1)25,
9(2)97,
10(1)1,
10(2)75,
10(2)91,
10(3)211,
11(2)55,
11(2)65,
11(2)85,
11(3)143,
12(2)69,
14(2)63,
14(3)165,
14(3)181,
15(1)1,
15(1)55,
15(4)251,
16(3)235,
17(3)157,
17(4)241,
18(1)31,
19(1)1,
19(2)79,
19(2)91,
19(3)157,
19(3)205,
20(3)177,
21(2)81,
22(1)1,
22(4)215,
23(2)61,
23(2)121,
33(3)179,
36(4)345,
38(3)214,
44(0)141,
52(z)63,
52(z)92
- graph,
1(3)255,
3(1)37,
3(2)65,
3(2)115,
3(3)163,
5(1)29,
5(2)115,
6(1)19,
6(1)47,
7(1)41,
7(3)147,
8(2)69,
9(3)203,
10(1)43,
15(2)65,
19(2)91,
19(2)135,
19(3)169,
19(3)205,
21(2)101,
21(2)113,
36(1)96,
39(1)25,
40(3)155
- higher-order,
20(1)25,
22(4)215,
23(2)179,
35(4)341,
38(3)242,
44(0)166
- interpreter,
1(1)17,
1(1)83,
3(1)13,
6(2)67,
7(1)1,
10(2)147,
11(1)1,
11(2)65,
11(2)85,
14(2)109,
14(3)153,
14(3)205,
18(2)137,
19(2)65,
19(2)79,
20(4)239,
21(2)67,
22(4)225,
23(2)121,
35(3)217,
44(z)199,
45(z)199,
48(z)39,
49(z)62
- level, low-,
21(1)17
- low-level,
21(1)17
- order, higher-,
20(1)25,
22(4)215,
23(2)179,
35(4)341,
38(3)242,
44(0)166
- processing,
1(1)17,
1(1)73,
1(2)151,
3(1)37,
3(2)75,
3(2)127,
3(2)135,
3(3)181,
3(4)209,
4(2)93,
6(3)131,
6(3)155,
7(1)11,
7(1)25,
8(2)51,
8(2)61,
8(3)113,
9(2)89,
9(2)97,
9(3)161,
9(3)193,
10(2)91,
11(1)39,
11(2)85,
12(1)39,
12(2)123,
13(1)23,
13(2)95,
13(3)149,
14(1)53,
14(4)239,
15(1)41,
15(2)95,
16(1)5,
16(1)39,
17(2)133,
17(4)213,
19(1)1,
19(1)51,
19(2)135,
19(3)169,
19(3)185,
19(4)261,
20(1)25,
20(1)43,
20(3)135,
20(4)213,
21(2)81,
22(1)1,
22(2)165,
22(2)181,
22(4)205,
25(2)113,
32(1)2,
34(1)18,
54(z)406
- purely,
18(4)251
- use,
3(3)163,
7(1)25,
10(3)179,
11(3)123,
20(1)25,
53(z)73