Entry Barroso:1978:IDD 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{Barroso:1978:IDD,
author = "P. B. Barroso and A. L. Furtado",
title = "Implementing a Data Definition Facility Driven by
Graph Grammars",
journal = j-COMP-LANGS,
volume = "3",
number = "2",
pages = "65--74",
month = "????",
year = "1978",
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,
classcodes = "C4210 (Formal logic); C4240 (Programming and algorithm
theory); C6120 (File organisation); C6140D (High level
languages)",
classification = "723; 921",
corpsource = "Pontificia Univ. Catolica do R.J., Rio de Janeiro,
Brazil",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "computer programming languages; computer programs;
correctness; data definition facility; data structures;
grammars; graph grammars; mathematical techniques ---
Trees; PL/1; programming theory; proofs of",
treatment = "A Application; T Theoretical or Mathematical",
}
Related entries
- correctness,
1(4)287,
1(4)303,
2(4)149,
3(2)135,
5(1)1,
7(2)89,
10(1)23,
10(2)147,
14(3)205,
16(3)259,
18(4)273,
21(2)67
- definition,
1(1)83,
1(2)121,
2(3)61,
3(1)13,
3(3)163,
4(3)139,
7(1)25,
9(1)1,
9(3)149,
10(2)147,
11(2)85,
12(2)69,
15(4)205,
16(2)147,
17(2)101,
17(3)199,
19(1)19,
23(2)179,
26(2)105,
43(z)116,
54(z)20,
54(z)252
- driven,
1(3)233,
2(4)179,
8(1)27,
40(2)53,
49(z)174,
50(z)127,
50(z)159,
51(z)1,
51(z)118,
54(z)199
- facility,
3(2)75,
3(3)145,
5(2)65,
7(3)103,
9(2)107,
14(3)165,
15(1)55,
16(3)197,
17(1)19,
18(1)31
- graph,
1(3)255,
3(1)37,
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)91,
19(2)135,
19(3)169,
19(3)205,
21(2)101,
21(2)113,
36(1)96,
39(1)25,
40(3)155
- Implementing,
8(2)77,
20(1)25,
45(z)1,
49(z)62
- mathematical,
3(1)31,
3(1)37,
3(2)115,
3(3)145,
4(2)99,
11(1)29,
13(1)31,
13(3)143,
16(1)5,
17(3)169,
20(2)69,
20(2)89,
20(2)101,
20(4)267,
22(1)1,
22(1)15,
22(1)27,
22(2)165
- PL/1,
1(1)29,
2(4)171,
6(1)47,
6(3)139
- proof,
1(2)151,
2(4)149,
5(1)1,
5(2)77,
17(2)101,
17(3)157,
18(4)273,
21(2)67,
23(2)161,
47(z)19
- technique,
1(1)61,
3(1)31,
3(1)37,
3(2)115,
4(2)99,
5(1)29,
5(3)141,
5(3)155,
6(1)35,
6(2)95,
8(2)69,
12(3)145,
13(2)75,
14(4)239,
15(1)41,
15(3)127,
16(2)147,
17(1)75,
17(4)241,
18(4)217,
21(1)1,
21(3)191,
22(1)39,
22(2)95,
22(2)181,
22(4)193,
23(1)25,
23(1)43,
24(2)55,
24(2)73,
25(1)1,
40(3)99,
47(z)151
- tree,
1(3)233,
3(1)31,
3(2)135,
4(3)131,
5(1)29,
10(3)225,
11(2)65,
15(3)127,
19(3)157,
20(3)151,
20(4)267,
21(1)49,
21(2)113,
22(4)225,
37(2)63,
39(4)163,
47(z)2