Entry Thiemann:1993:OSR 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{Thiemann:1993:OSR,
author = "Peter J. Thiemann",
title = "Optimizing structural recursion in functional
programs",
journal = j-COMP-LANGS,
volume = "19",
number = "2",
pages = "91--103",
month = apr,
year = "1993",
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,
affiliation = "Universit{\"a}t T{\"u}bingen",
affiliationaddress = "T{\"u}bingen, Ger",
classcodes = "C6110 (Systems analysis and programming)",
classification = "721.1; 723.1; 723.1.1; 921.4; 921.5",
corpsource = "Wilhelm Schickard Inst., T{\"u}bingen Univ., Germany",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "algorithm; Algorithms; Computer programming languages;
Data structures; eager evaluation; Eager evaluation;
Function evaluation; Functional languages; functional
languages; functional programming; functional programs;
Graph theory; Optimization; Program compilers;
Programming theory; Recursive functions; Schorr--Waite;
Schorr--Waite algorithm; stack space; Structural
recursion; structural recursion optimisation;
Subroutines",
treatment = "P Practical",
}
Related entries
- eager,
17(2)133
- evaluation,
4(2)99,
6(2)67,
6(3)115,
7(2)69,
7(3)161,
8(1)1,
12(3)145,
12(3)173,
13(1)13,
14(2)63,
14(3)181,
14(4)225,
17(2)133,
18(2)137,
18(4)217,
19(3)205,
20(1)53,
20(2)101,
20(2)127,
20(4)239,
20(4)267,
21(2)113,
22(1)39,
22(2)143,
22(4)259,
23(2)121,
26(1)27,
26(1)43,
31(3)127,
35(2)173,
36(2)203,
37(2)63,
38(1)1,
40(3)99,
44(z)299,
45(z)299
- function,
1(2)121,
3(1)13,
3(1)31,
7(3)103,
9(3)133,
10(1)1,
11(2)55,
11(2)85,
12(2)69,
12(3)163,
14(3)181,
15(1)55,
17(2)133,
17(2)147,
18(2)125,
18(4)217,
19(1)1,
19(4)213,
20(2)101,
20(3)177,
21(3)129,
24(1)1,
35(3)266,
43(z)41,
47(z)77
- functional,
3(1)31,
8(1)27,
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(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(1)27,
8(2)69,
9(3)203,
10(1)43,
15(2)65,
19(2)135,
19(3)169,
19(3)205,
21(2)101,
21(2)113,
36(1)96,
39(1)25,
40(3)155
- 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,
16(2)179,
19(1)41,
47(z)131
- optimization,
1(2)161,
3(3)163,
5(1)29,
6(1)19,
8(2)69,
11(2)105,
14(2)63,
14(3)193,
15(1)27,
15(2)83,
16(1)81,
19(1)41,
19(2)105,
19(3)205,
21(2)113,
22(2)115,
24(1)33,
47(z)189,
54(z)119
- optimizing,
5(3)141,
6(1)47,
8(2)69,
14(3)193,
18(4)217,
20(1)43,
20(2)89,
25(2)89,
35(3)266
- recursion,
1(3)219,
3(4)241,
10(2)75,
11(2)55,
15(1)55,
18(4)217,
44(0)181
- recursive,
3(1)31,
5(3)155,
6(3)115,
8(1)15,
11(2)55,
13(2)65,
14(1)11,
14(2)93,
14(4)225,
15(1)55,
15(2)65,
15(4)193,
18(1)1,
19(1)19,
24(1)1,
35(3)266,
53(z)143
- space,
3(3)163,
13(1)1,
20(2)89,
20(3)135,
20(4)213,
22(2)79,
22(4)205,
23(2)61,
37(4)168,
54(z)358
- stack,
1(3)219,
8(1)15,
9(3)149,
12(3)145,
35(3)266
- structural,
4(4)209,
5(3)141,
13(3)109,
14(3)181,
19(2)119,
47(z)170
- subroutine,
3(1)31,
3(1)37,
3(2)95,
3(2)115,
3(3)163,
3(4)241,
16(1)97,
16(2)129,
17(2)147,
19(2)105