Entry Moffat:1988:PPP 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{Moffat:1988:PPP,
author = "D. S. Moffat and P. M. D. Gray",
title = "{Perlog}: a {Prolog} with Persistence and Modules",
journal = j-COMP-J,
volume = "31",
number = "2",
pages = "110--115",
month = apr,
year = "1988",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/31.2.110",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:24 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/31/2.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_02/",
URL = "http://comjnl.oxfordjournals.org/content/31/2/110.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_02/tiff/110.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_02/tiff/111.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_02/tiff/112.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_02/tiff/113.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_02/tiff/114.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_31/Issue_02/tiff/115.tif",
acknowledgement = ack-nhfb,
affiliation = "Univ of Aberdeen, Aberdeen, Scotl",
affiliationaddress = "Univ of Aberdeen, Aberdeen, Scotl",
classcodes = "C6140D (High level languages); C6150C (Compilers,
interpreters and other processors)",
classification = "723",
corpsource = "Dept. of Comput. Sci., Aberdeen Univ., UK",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "abstract data types; B-tree routines; computer
programming languages; data structures; database
management systems; database systems; global; high
level; interpreter; languages; metacalls; module name
space; modules; name clashes; object storage systems;
Perlog; persistence; procedure call; program
interpreters; Prolog; PROLOG; Prolog; secondary
storage; {B}-tree routines",
treatment = "P Practical",
}
Related entries
- abstract,
23(3)243,
24(4)308,
25(1)17,
25(2)161,
26(4)289,
27(2)127,
28(1)1,
28(1)59,
28(2)154,
28(3)298,
29(3)261,
29(4)340,
31(2)165,
31(3)193,
31(4)313,
31(6)570,
32(2)127,
32(4)290,
32(4)312,
32(5)413,
32(5)461,
32(6)494
- B-tree,
28(4)417,
29(3)269
- call,
23(1)33,
24(1)16,
24(2)111,
25(2)286,
26(2)134,
27(3)288-2,
28(2)104-2,
28(3)231,
28(4)446-1,
29(6)531,
32(3)281
- clash,
27(4)354
- global,
25(1)52,
31(4)289
- Gray, P. M. D.,
23(1)60,
28(5)501
- high,
23(2)124,
23(2)153,
24(1)56,
25(1)153,
25(2)176,
25(2)264,
25(3)289,
26(1)52,
26(1)72,
26(2)124,
26(2)175,
26(3)228,
26(3)277,
26(4)344,
26(4)360,
26(4)366,
27(1)37,
27(1)83,
27(2)97,
27(2)151,
28(1)34,
28(3)231,
28(3)250,
28(4)391,
29(2)118,
29(3)229,
29(3)253,
29(4)289,
29(4)340,
29(6)500,
29(6)506,
29(6)538,
30(2)128,
30(5)437,
30(6)487,
30(6)558,
31(2)99,
31(3)220,
31(3)243,
32(1)36,
32(1)90,
32(2)127,
32(2)152,
32(2)162,
32(4)290,
32(4)297,
32(4)305,
32(4)312,
32(4)323,
32(4)341,
32(5)413
- interpreter,
23(3)223,
26(2)164,
30(1)37,
30(1)43,
30(6)519,
31(6)517,
31(6)525,
31(6)540,
31(6)545,
32(1)29,
32(1)91,
32(2)108,
32(2)127,
32(2)142,
32(2)152,
32(2)175,
32(3)276,
32(5)422,
32(5)445
- level,
23(2)124,
23(2)153,
24(1)25,
24(1)56,
24(1)62,
25(1)153,
25(2)176,
25(2)264,
25(3)289,
25(4)429,
26(1)52,
26(1)72,
26(2)124,
26(2)175,
26(2)188,
26(3)228,
26(3)235,
26(3)277,
26(4)344,
26(4)360,
26(4)366,
27(1)83,
27(2)97,
27(2)151,
27(4)334,
28(1)34,
28(3)250,
28(4)357,
29(2)118,
29(3)229,
29(3)253,
29(4)340,
29(6)500,
29(6)506,
29(6)538,
30(1)52,
30(2)128,
30(5)437,
30(6)487,
31(2)99,
31(3)220,
31(3)229,
31(3)243,
31(4)344,
32(1)36,
32(1)90,
32(2)127,
32(2)152,
32(2)162,
32(4)290,
32(4)297,
32(4)305,
32(4)312,
32(4)323,
32(4)341,
32(5)413
- module,
24(2)184,
27(3)254,
28(3)231,
29(6)495,
30(6)507,
31(2)165,
32(2)98,
32(2)127
- name,
24(1)95,
25(1)2,
27(1)47,
30(5)437
- object,
23(3)212,
23(3)287,
24(4)331,
26(4)360,
27(2)127,
28(1)68,
29(1)38,
29(5)423,
31(1)56,
31(2)116,
32(3)194,
32(4)323,
32(4)333,
32(4)351
- persistence,
26(4)360
- procedure,
23(2)107,
23(2)115,
23(2)142,
23(2)187-1,
23(3)212,
23(3)230,
23(3)233,
23(4)382,
24(1)29,
25(2)199,
25(2)207,
25(3)331,
26(4)354,
29(6)531,
30(5)451,
30(5)458,
31(1)12,
31(1)51,
31(1)65
- PROLOG,
29(1)17,
29(3)246,
30(2)183,
30(5)393,
31(2)133
- Prolog,
28(2)134,
28(5)487,
29(1)9,
29(1)17,
29(3)246,
29(6)545,
30(2)183,
30(5)393,
31(2)133
- routine,
23(3)274,
25(1)121,
26(1)92,
26(2)134,
28(2)117,
30(3)254,
32(5)445,
32(6)549
- secondary,
28(3)291,
28(3)309,
28(4)398,
28(4)406,
28(5)524,
31(4)344,
32(6)494
- space,
24(4)316,
25(1)45,
25(4)486,
26(1)15,
26(3)224,
27(4)368-1,
28(1)73,
28(3)330,
28(4)439,
29(3)269,
30(1)87,
30(2)119,
30(2)163,
30(3)223,
30(4)362,
30(4)372,
31(1)17,
31(1)56,
31(3)279,
31(4)296,
31(4)358,
32(3)228,
32(4)362
- tree, B-,
28(4)417,
29(3)269
- type,
23(1)66,
24(2)118,
24(4)308,
25(3)289,
25(4)448,
26(4)289,
26(4)366,
27(1)47,
27(3)260,
27(4)310,
28(1)59,
28(2)154,
28(3)298,
29(1)38,
29(3)261,
29(4)340,
29(6)538,
30(1)27,
30(5)404,
30(5)451,
31(2)99,
31(2)116,
31(6)517,
32(4)305,
32(4)312,
32(5)413,
32(6)524,
32(6)541