Entry Hanus:1997:LNS 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{Hanus:1997:LNS,
author = "Michael Hanus",
title = "Lazy narrowing with simplification",
journal = j-COMP-LANGS,
volume = "23",
number = "2-4",
pages = "61--85",
month = jul # "--" # dec,
year = "1997",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Sun Oct 25 08:22:03 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "RWTH Aachen",
affiliationaddress = "Aachen, Ger",
classification = "721.1; 723.1; 723.1.1; C4210L (Formal languages and
computational linguistics); C4240 (Programming and
algorithm theory); C6110L (Logic programming); C6140D
(High level languages)",
conference = "Proceedings of the 1994 11th International Conference
on Logic Programming, ICLP'94",
corpsource = "Inf. II, Tech. Hochschule Aachen, Germany",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "completeness; Computational linguistics; Computer
programming languages; constructor-based weakly
orthogonal rewrite systems; deterministic
simplification steps; finite search spaces; Formal
logic; functional languages; Functional logic
programming; functional logic programming languages;
ground confluent systems; infinite search spaces; Lazy
narrowing; lazy narrowing; Logic programming; logic
programming languages; operational behavior;
operational semantics; programming theory; rewriting
systems; search problems; search space reduction;
soundness; term rewriting; terminating rewrite systems;
unification",
meetingaddress = "Santa Margherite Ligure, Italy",
meetingdate = "Jun 1994",
meetingdate2 = "06/94",
pubcountry = "UK",
treatment = "T Theoretical or Mathematical",
}
Related entries
- behavior,
4(1)29,
17(4)269,
18(2)77,
19(3)205,
19(4)235,
20(2)127,
20(3)193,
22(1)39,
22(2)51
- C4210L,
22(2)51,
22(4)225,
23(1)1,
23(1)25
- C4240,
22(1)27,
22(4)215,
22(4)225,
23(2)161,
23(2)179
- C6110L,
22(2)51,
22(2)79,
22(2)95,
22(2)115,
22(2)143,
22(2)181,
22(4)237,
23(1)25,
23(2)87,
23(2)121,
23(2)161
- C6140D,
22(1)1,
22(1)15,
22(2)79,
22(2)95,
22(2)115,
22(2)165,
22(4)193,
22(4)205,
22(4)215,
22(4)237,
22(4)259,
23(1)1,
23(1)25,
23(2)87,
23(2)121,
23(2)161
- completeness,
16(3)259,
17(1)75,
19(2)79,
23(2)161
- computational,
1(1)17,
2(1)27,
7(3)147,
10(1)43,
10(3)211,
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)87,
23(2)121,
24(1)33,
33(1)1,
35(4)406,
39(4)163,
54(z)95
- deterministic,
12(2)123,
13(1)1,
13(3)125,
14(2)99,
24(4)197,
31(2)49
- finite,
1(3)197,
1(3)233,
3(1)53,
10(2)127,
12(2)123,
13(3)125,
14(1)53,
22(1)27
- 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(2)91,
19(3)157,
19(3)205,
20(3)177,
21(2)81,
22(1)1,
22(4)215,
23(2)121,
33(3)179,
36(4)345,
38(3)214,
44(0)141,
52(z)63,
52(z)92
- infinite,
13(1)13
- lazy,
14(3)181,
17(2)133,
18(1)31,
20(3)177,
26(1)43,
52(z)92
- linguistic,
3(3)181,
10(1)43,
11(1)39,
14(1)53,
14(4)225,
15(1)1,
15(4)251,
16(2)147,
18(4)251,
19(2)65,
19(2)79,
19(2)119,
19(3)157,
20(1)1,
20(2)101,
20(4)213,
20(4)239,
20(4)253,
21(1)17,
21(2)67,
22(2)51,
22(4)225,
23(1)1,
23(1)25,
23(2)87,
23(2)121,
35(1)80,
38(1)61
- narrowing,
37(1)24
- operational,
10(2)147,
10(3)189,
11(1)15,
11(3)173,
13(1)31,
14(3)165,
16(1)39,
16(2)147,
18(4)217,
19(4)235,
20(1)1,
22(2)51,
23(1)25,
23(2)87,
23(2)121
- orthogonal,
17(2)83,
32(1)2
- problem,
1(1)61,
1(1)83,
1(2)161,
1(3)197,
1(3)255,
1(4)321,
2(1)1,
2(3)75,
3(1)53,
3(3)145,
3(3)193,
4(1)17,
4(3)187,
5(3)155,
7(3)125,
8(2)69,
8(3)95,
11(3)161,
12(1)9,
14(1)11,
14(3)137,
14(3)153,
14(4)255,
16(1)97,
16(3)235,
19(3)157,
19(3)169,
19(3)205,
20(3)177,
21(2)113,
22(1)27,
22(4)259,
23(1)25,
23(1)43,
24(1)1,
26(2)165
- reduction,
11(1)1,
19(3)205,
22(1)27,
30(3)99,
31(2)49,
39(3)95
- rewrite,
16(1)81
- rewriting,
16(1)81,
44(z)3
- search,
3(1)31,
5(2)52,
19(3)205,
20(2)89,
21(2)113,
23(2)161,
46(z)182,
47(z)153,
47(z)211
- space,
3(3)163,
13(1)1,
19(2)91,
20(2)89,
20(3)135,
20(4)213,
22(2)79,
22(4)205,
37(4)168,
54(z)358
- steps,
1(4)277
- term,
16(1)81,
19(4)235
- unification,
17(2)133,
20(1)25