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{Joy:1985:ECC,
author = "M. S. Joy and V. J. Rayward-Smith and F. W. Burton",
title = "Efficient Combinator Code",
journal = j-COMP-LANGS,
volume = "10",
number = "3-4",
pages = "211--224",
month = "????",
year = "1985",
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 = "Univ of East Anglia, Sch of Computing Studies \&
Accountancy, Norwich, Engl",
affiliationaddress = "Univ of East Anglia, Sch of Computing Studies \&
Accountancy, Norwich, Engl",
classcodes = "C1160 (Combinatorial mathematics); C4240 (Programming
and algorithm theory); C6120 (File organisation)",
classification = "723",
corpsource = "Sch. of Comput. Studies and Accountancy, East Anglia
Univ., Norwich, UK",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "abstracting variables; abstraction algorithm; code;
combinator code; combinatorial mathematics;
combinators; combinatory logic; combinatory logics;
computational complexity; computer programming ---
Algorithms; computer software; data; functional
languages; functional programs; NP-complete;
np-completeness; object; optimisation; structures",
treatment = "T Theoretical or Mathematical",
}
Related entries
- abstracting,
12(2)109
- abstraction,
2(3)61,
2(4)135,
2(4)149,
4(3)139,
6(3)131,
6(3)139,
8(3)125,
9(1)1,
10(1)1,
10(1)37,
11(3)143,
12(2)69,
12(2)109,
13(3)109,
14(2)83,
14(3)137,
15(1)1,
15(3)141,
15(4)251,
17(1)19,
17(3)157,
20(4)253,
25(3)165,
30(3)139,
47(z)2,
47(z)62
- combinator,
8(1)27,
19(3)205
- combinatorial,
23(1)1
- complete, NP-,
19(3)169,
21(2)113
- complexity,
3(3)163,
7(2)61,
7(3)103,
7(3)147,
9(3)133,
9(3)203,
13(1)23,
13(3)109,
14(1)11,
14(2)125,
15(1)27,
15(2)83,
17(4)251,
17(4)269,
19(2)135,
19(3)169,
20(1)43,
20(1)53,
20(2)89,
20(2)101,
20(2)127,
20(3)177,
20(4)239,
20(4)267,
21(1)17,
21(1)49,
21(2)101,
21(2)113,
24(1)33
- computational,
1(1)17,
2(1)27,
7(3)147,
10(1)43,
11(1)39,
13(1)13,
13(3)109,
14(1)11,
14(1)53,
14(2)125,
14(4)225,
15(1)1,
15(1)27,
15(2)83,
15(4)251,
16(2)113,
16(2)147,
17(4)251,
17(4)269,
18(4)251,
19(2)65,
19(2)79,
19(2)119,
19(2)135,
19(3)157,
19(3)169,
20(1)1,
20(1)43,
20(1)53,
20(2)89,
20(2)101,
20(2)127,
20(3)151,
20(3)177,
20(4)213,
20(4)239,
20(4)253,
20(4)267,
21(1)17,
21(1)49,
21(2)67,
21(2)101,
21(2)113,
22(2)51,
22(2)115,
22(4)225,
23(1)1,
23(1)25,
23(2)61,
23(2)87,
23(2)121,
24(1)33,
33(1)1,
35(4)406,
39(4)163,
54(z)95
- efficient,
14(1)11,
15(3)127,
16(1)81,
17(4)241,
19(1)41,
20(4)253,
22(4)225,
23(2)87,
34(4)170,
35(2)196,
35(3)217,
46(z)91,
46(z)167
- 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,
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
- mathematics,
1(3)233,
3(1)31,
17(3)169,
19(3)157,
20(3)151,
20(4)267,
21(2)113,
22(4)225,
23(1)1
- NP-complete,
19(3)169,
21(2)113
- object,
1(3)197,
7(1)1,
7(2)53,
9(3)203,
10(1)1,
10(2)147,
11(3)143,
12(3)145,
13(1)13,
15(3)141,
15(4)225,
16(1)39,
16(2)147,
17(4)213,
18(1)57,
18(3)169,
19(1)19,
19(2)65,
19(2)79,
20(2)69,
21(2)67,
21(2)81,
21(3)129,
21(3)147,
22(1)1,
22(1)15,
22(2)79,
22(2)165,
22(4)237,
23(1)25,
23(2)121,
24(4)229,
28(3)289,
32(1)42,
32(4)185,
35(1)63,
37(2)63,
38(1)1,
49(z)82,
51(z)90
- optimisation,
1(2)161,
1(3)197,
1(3)233,
1(4)321,
6(1)19,
7(2)53,
8(2)69,
11(2)105,
13(2)75,
14(3)193,
15(2)83,
16(2)179,
19(1)41,
19(2)91,
47(z)131
- Rayward-Smith, V. J.,
9(1)51
- Smith, V. J., Rayward-,
9(1)51
- variable,
4(3)187,
7(1)21,
11(3)123,
15(1)27,
16(2)129,
17(1)67,
17(4)251,
18(3)197,
22(4)237,
38(4)279