Entry McCrosky:1991:ICR 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{McCrosky:1991:ICR,
author = "Carl McCrosky",
title = "Intermediate container removal",
journal = j-COMP-LANGS,
volume = "16",
number = "2",
pages = "179--195",
month = "????",
year = "1991",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Thu Apr 10 09:55:01 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Univ of Saskatchewan",
affiliationaddress = "Saskatoon, Sask, Can",
classcodes = "C6140D (High level languages); C6120 (File
organisation); C6150C (Compilers, interpreters and
other processors)",
classification = "722; 723",
corpsource = "Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon,
Sask., Canada",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "Array Based Computations; class array language;
compilers; Computer Programming --- Algorithms;
Computer Programming Languages; data movement; data
structures; first-; first-class arrays; high level
languages; imperative programmer; intermediate
container removal; memory allocation; nested;
optimisation; optimizer; program; rectangular
containers; storage allocation; temporary arrays",
treatment = "P Practical",
}
Related entries
- allocation,
6(1)47,
6(3)115,
12(3)145,
13(2)75,
15(2)83,
15(2)109,
19(2)135,
21(2)101,
21(2)113,
22(2)51,
22(4)237,
24(1)33,
35(4)406
- array,
1(3)219,
3(1)37,
4(2)93,
7(2)53,
9(2)97,
14(1)35,
14(4)239,
17(1)67,
18(3)197,
19(1)41,
20(3)177,
22(1)39,
28(3)289,
33(3)82,
47(z)104
- based,
5(3)141,
7(1)25,
8(3)95,
11(1)1,
13(1)1,
14(3)193,
15(2)65,
16(3)259,
17(3)157,
17(4)251,
19(2)65,
20(3)135,
21(3)165,
22(2)95,
32(2)157,
44(z)48,
45(z)161,
47(z)104,
47(z)153,
47(z)211,
51(z)71,
54(z)358
- class,
9(2)107,
11(3)143,
14(2)99,
16(2)167,
20(1)53,
21(2)81,
31(3)107,
35(2)100,
46(z)1,
47(z)211
- class, first-,
15(3)141,
18(1)57,
20(1)53
- computation,
1(2)121,
3(3)163,
4(1)17,
9(3)133,
10(2)147,
11(3)143,
12(1)1,
12(2)109,
15(3)141,
16(3)197,
19(1)1,
20(1)1,
20(1)25,
20(4)253,
22(2)95,
23(2)161,
28(2)181,
33(3)82,
34(4)184,
35(3)217,
40(1)19
- container,
50(z)53
- first-class,
14(3)153,
15(3)141,
18(1)57,
20(1)53
- imperative,
10(2)75,
19(2)119,
21(1)17,
21(3)129
- intermediate,
1(1)17,
9(3)149,
9(3)193,
10(2)147,
11(2)105,
15(3)177,
16(1)81,
18(2)137,
21(2)101,
52(z)92
- McCrosky, Carl,
18(4)241,
20(2)101
- memory,
6(3)115,
9(3)149,
18(2)125,
20(3)135,
20(3)151,
20(4)253,
22(2)115,
22(4)205,
22(4)259,
28(3)237,
31(1)35,
35(1)21,
36(2)158,
37(4)168,
40(3)137,
41(z)21,
44(z)342,
45(z)342,
47(z)62,
53(z)121
- nested,
1(1)61,
2(4)117,
10(2)75,
14(1)35,
42(z)2
- optimisation,
1(2)161,
1(3)197,
1(3)233,
1(4)321,
6(1)19,
7(2)53,
8(2)69,
10(3)211,
11(2)105,
13(2)75,
14(3)193,
15(2)83,
19(1)41,
19(2)91,
47(z)131
- optimizer,
11(2)105
- programmer,
1(1)3,
1(1)45,
2(1)21,
3(2)95,
3(4)227,
16(3)235,
17(3)169,
23(1)43
- removal,
3(4)241,
17(4)241,
53(z)27
- storage,
1(1)17,
8(1)15,
10(2)127,
12(3)145,
13(1)13,
13(2)75,
15(1)27,
15(2)83,
15(2)109,
16(2)129,
19(2)135,
20(1)53,
20(3)135,
20(3)177,
20(4)253,
20(4)267,
21(2)101,
21(2)113,
22(2)115,
24(1)33
- temporary,
17(3)185