Entry Jayaraman:1992:SAL 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{Jayaraman:1992:SAL,
author = "Bharat Jayaraman",
title = "Sublist assertions for listless and lazy evaluation",
journal = j-COMP-LANGS,
volume = "17",
number = "2",
pages = "133--146",
month = apr,
year = "1992",
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 = "State Univ of New York at Buffalo",
affiliationaddress = "Buffalo, NY, USA",
classcodes = "C6130 (Data handling techniques); C6110L (Logic
programming); C6140D (High level languages)",
classification = "723.1.1",
corpsource = "Dept. of Comput. Sci., State Univ. of New York,
Buffalo, NY, USA",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "answer; eager evaluation; lazy evaluation; list; list
pattern; list processing; List processing; List
processing languages; list-matching; list-valued
function; listless evaluation; listof operation; logic
programming; logical form; order; processing;
programming languages; PROLOG; Prolog (Programming
language); Prolog programming; relational assertions;
Relational assertions; sublist assertion;
Subset-equational program; unification",
treatment = "P Practical",
}
Related entries
- answer,
23(2)161,
36(2)158
- assertion,
3(2)135
- eager,
19(2)91
- 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,
18(2)137,
18(4)217,
19(2)91,
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
- form,
1(1)45,
5(2)77,
8(3)139,
9(3)133,
9(3)183,
12(1)9,
13(3)109,
14(3)153,
15(3)141,
20(1)43,
23(2)179,
35(2)173
- 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)147,
18(2)125,
18(4)217,
19(1)1,
19(2)91,
19(4)213,
20(2)101,
20(3)177,
21(3)129,
24(1)1,
35(3)266,
43(z)41,
47(z)77
- Jayaraman, Bharat,
24(3)179,
49(z)82
- lazy,
14(3)181,
18(1)31,
20(3)177,
23(2)61,
26(1)43,
52(z)92
- list,
1(1)45,
3(1)31,
3(2)115,
3(2)127,
3(2)135,
5(2)115,
12(2)69,
14(1)35,
19(1)1,
28(3)289,
35(2)99,
36(1)1,
37(1)1
- logical,
1(2)161,
1(3)197,
2(1)27,
7(3)147,
9(3)133,
9(3)183,
12(1)9,
14(1)35,
19(2)79,
22(2)51,
22(4)237,
23(1)25,
23(2)161
- operation,
1(4)321,
4(3)187,
6(3)155,
8(1)1,
10(2)91,
13(3)143,
15(3)153,
15(3)163,
15(3)177,
16(1)19,
16(1)65,
18(3)153,
20(4)213,
20(4)267,
23(2)179,
25(2)89,
35(3)293
- order,
14(1)35,
15(2)109,
19(2)79,
20(1)25,
20(2)101,
20(3)177,
22(1)1,
23(2)179,
34(4)184
- pattern,
1(3)233,
2(4)179,
3(1)13,
3(1)37,
8(2)77,
13(1)23,
13(3)149,
14(1)25,
14(3)153,
14(3)193,
15(1)41,
15(3)127,
17(1)61,
30(1)21,
45(z)1,
46(z)106,
46(z)140,
48(z)89
- 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(1)27,
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(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
- PROLOG,
12(1)9,
13(3)149,
14(2)63,
14(3)193,
17(4)213,
18(1)57,
18(3)185,
19(4)235,
20(1)25,
22(2)95,
22(2)115
- Prolog,
12(1)9,
13(3)149,
14(3)193,
17(4)213,
18(1)57,
18(3)185,
19(3)185,
19(4)235,
20(1)25,
21(2)81,
22(2)95,
22(2)115,
22(2)181,
31(1)17,
39(4)142,
51(z)102
- relational,
2(3)61,
3(3)157,
9(1)25,
14(2)63,
15(2)65,
16(3)235,
17(2)101,
17(3)185,
19(4)261
- unification,
20(1)25,
23(2)61