Entry Turner:1985:IFS from compj1980.bib
Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
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{Turner:1985:IFS,
author = "R. Turner and B. G. T. Lowden",
title = "An introduction to the formal specification of
relational query languages",
journal = j-COMP-J,
volume = "28",
number = "2",
pages = "162--169",
month = may,
year = "1985",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/28.2.162",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
MRclass = "68P15 (68Q55)",
MRnumber = "800 328",
bibdate = "Tue Dec 4 14:48:18 MST 2012",
bibsource = "Compendex database; Database/database.bib;
http://comjnl.oxfordjournals.org/content/28/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/28/2/162.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/162.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/163.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/164.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/165.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/166.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/167.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/168.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_02/tiff/169.tif",
abstract = "An introduction is given to the use of formal
semantics as a means of both specifying relational
query languages and of establishing a conceptual basis
for their analysis. The approach is demonstrated with
respect to the relational calculus and then extended to
cope with the more advanced constructs of SEQUEL and
QUEL.",
acknowledgement = ack-nhfb,
affiliation = "Univ of Essex, Dep of Computer Science, Colchester,
Engl",
affiliationaddress = "Univ of Essex, Dep of Computer Science,
Colchester, Engl",
classcodes = "C4210 (Formal logic); C4250 (Database theory); C6140D
(High level languages); C6160D (Relational databases)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Essex Univ., Colchester, UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "computer programming languages; database systems;
database theory; formal; formal languages; formal
specification; QUEL; query languages; relational
calculus; relational databases; relational query
languages; semantics; SEQUEL",
treatment = "G General Review; P Practical",
}
Related entries
- 68P15,
27(4)315,
30(5)458
- 68Q55,
27(3)233,
30(6)498,
32(4)290
- advanced,
23(2)160,
26(3)208,
31(6)531
- approach,
23(1)3,
23(1)9,
23(1)28,
23(2)114-1,
23(3)223,
23(3)256,
23(4)317,
24(3)222,
24(4)320,
25(1)12,
25(3)353,
25(4)410,
25(4)442,
25(4)492,
26(3)255,
26(3)283,
26(4)293,
26(4)360,
26(4)383,
27(1)3,
27(1)37,
27(2)171,
27(3)246,
28(1)59,
28(1)89,
28(2)97,
28(4)353,
29(2)161,
29(2)189,
29(2)189-1,
29(3)222,
29(4)330,
29(5)385,
30(1)8,
30(2)119,
30(2)176,
30(3)258,
30(5)393,
30(5)437,
30(6)507,
31(2)133,
31(2)182,
31(3)243,
31(5)409,
32(2)152,
32(2)162,
32(5)386,
32(5)437
- basis,
24(4)312,
25(1)22,
29(3)201
- both,
24(4)320,
25(4)471,
29(3)201,
30(5)437
- calculus,
28(3)298,
31(6)510,
32(5)399
- conceptual,
24(1)42,
25(1)12,
26(3)228,
28(2)138,
28(3)270,
28(5)508,
30(4)328,
31(4)376,
31(4)379
- construct,
27(1)83,
27(2)97,
29(5)404,
29(5)423,
29(6)506,
30(6)487,
31(3)243,
31(6)531,
32(1)90
- extended,
25(2)193,
26(2)142,
26(4)366,
27(4)362,
29(1)38,
32(1)1
- formal,
27(2)121,
28(1)59,
28(2)112,
28(5)474,
28(5)480,
29(6)481,
30(2)134,
30(2)183,
30(4)316,
30(4)328,
30(4)337,
30(6)507,
31(4)313,
31(4)325,
31(4)336,
31(6)510,
31(6)525,
31(6)564,
32(1)1,
32(1)36,
32(1)90,
32(1)91,
32(4)290,
32(4)305,
32(4)351,
32(5)385,
32(5)399,
32(5)413,
32(5)422,
32(5)432,
32(5)445
- given,
32(1)93,
32(5)461
- introduction,
23(1)3,
23(2)123,
23(2)191,
24(4)320,
31(4)296,
31(6)531
- Lowden, B. G. T.,
25(1)93
- mean,
25(1)32,
26(4)320,
29(2)167,
30(4)289,
z(z)z
- more,
23(2)142,
30(5)437,
31(4)289,
32(1)13,
32(2)152
- query,
24(1)56,
24(2)125,
25(1)2,
25(2)239,
26(3)239,
27(4)301,
28(2)154,
28(3)282,
29(1)38,
29(1)76,
29(2)176,
29(5)451,
30(2)157,
30(6)535,
31(1)34,
31(1)41,
31(2)133,
31(2)155,
31(4)344,
32(1)55,
32(1)90,
32(3)220
- relational,
24(2)112,
24(4)312,
25(1)68,
25(1)135,
27(4)301,
28(1)82,
28(2)170,
28(4)391,
28(4)398,
28(5)501,
29(1)38,
29(3)261,
29(4)348,
29(4)378,
29(4)378,
29(5)451,
29(5)458,
30(2)157,
30(5)404,
30(5)437,
31(1)34,
31(1)41,
31(1)51,
31(2)125,
31(2)141,
31(2)147,
31(2)155,
31(3)253,
31(3)258,
31(6)550,
32(1)63,
32(1)90
- semantic,
23(2)132,
23(3)212,
23(4)317,
24(1)56,
24(2)125,
25(1)63,
25(2)264,
25(3)331,
26(2)124,
26(2)164,
26(3)228,
27(1)83,
27(3)233,
28(2)112,
28(3)250,
28(4)357,
28(5)480,
29(1)33,
29(2)151,
29(3)241,
29(5)404,
30(2)128,
30(3)239,
30(4)328,
30(6)498,
31(1)9,
31(2)141,
31(3)193,
32(1)90,
32(2)108,
32(2)152,
32(4)290,
32(5)422
- specification,
23(1)61,
23(3)230,
25(1)34,
25(1)63,
26(4)289,
27(2)121,
27(2)143,
28(1)22,
28(1)59,
28(2)117,
28(2)154,
28(3)250,
28(4)357,
29(3)261,
29(6)495,
30(2)97,
30(2)134,
30(3)223,
30(3)239,
30(4)316,
30(4)337,
30(6)512,
31(3)193,
31(3)229,
31(3)269,
31(4)313,
31(5)426,
31(6)510,
32(1)1,
32(5)399,
32(5)413,
32(5)422,
32(5)432,
32(6)541
- specifying,
27(3)209
- then,
31(3)243
- use,
23(2)107,
24(1)95,
25(2)218,
26(1)93,
26(3)235,
28(3)203,
29(1)52,
29(2)167,
29(4)289,
29(5)430,
30(1)80,
30(3)214,
30(4)362,
30(5)437,
30(5)451,
31(3)243,
31(4)289,
31(5)420,
32(2)122,
32(2)152,
32(4)333,
z(z)z