Entry Kawamura:1990:PSE from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
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{Kawamura:1990:PSE,
author = "T. Kawamura and T. Kanamori",
title = "Preservation of stronger equivalence in unfold\slash
fold logic program transformation",
journal = j-THEOR-COMP-SCI,
volume = "75",
number = "1-2",
pages = "139--156",
day = "25",
month = sep,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988",
conftitle = "International Conference on Fifth Generation Computer
Systems 1988",
corpsource = "Mitsubishi Electr. Corp., Central Res. Lab., Hyogo,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "answer substitutions; equivalence classes; formal
logic; initial program; least Herbrand model; logic
programming; programming theory; Prolog programs;
semantics; stronger equivalence; Tamaki--Sato
transformation; top-level goal; unfold/fold logic
program transformation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- answer,
74(3)325,
75(1)45,
83(2)313,
86(1)3,
114(2)201,
124(1)93,
133(2)267
- fold,
86(1)107,
105(1)57
- goal,
75(1)67,
83(1)131,
95(1)43,
120(1)1
- Herbrand,
75(1)85,
76(2)309,
77(3)309,
95(1)43,
99(1)65,
107(2)277,
118(2)99,
119(1)127,
119(1)z,
122(1)3,
122(1)263,
124(1)93
- initial,
86(2)365,
93(2)185,
108(2)291,
114(2)299,
115(1)77,
117(1)187,
124(1)149,
132(1)387,
135(2)221
- least,
70(1)65,
70(2)233,
75(1)45,
75(1)85,
76(2)309,
92(1)87,
121(1)411,
131(1)95,
131(1)121
- preservation,
75(1)z
- Prolog,
71(1)155,
71(2)193,
71(2)z,
75(1)15,
75(1)z,
82(2)373,
85(2)333,
86(1)35,
104(1)109,
119(1)23,
119(1)63,
119(1)z,
124(2)297,
136(1)277
- stronger,
75(1)z,
91(1)101
- substitution,
70(1)3,
75(1)45,
80(1)1,
81(2)169,
86(1)3,
86(2)277,
98(1)115,
99(2)327,
103(2)283,
107(2)209,
107(2)333,
117(1)113,
124(1)71,
124(1)93,
127(1)149,
127(1)181,
132(1)209,
132(1)243,
134(2)329
- transformation,
70(1)35,
71(1)47,
73(2)121,
73(2)155,
73(2)231,
75(1)85,
75(1)z,
76(1)115,
76(2)331,
77(1)97,
81(1)1,
81(2)295,
86(1)107,
86(1)z,
89(1)179,
90(1)37,
93(1)43,
94(1)141,
104(1)109,
105(1)57,
106(1)135,
108(1)151,
108(1)z,
109(1)3,
109(1)145,
109(1)181,
109(1)257,
109(1)z,
110(2)377,
115(1)107,
115(2)291,
116(2)373,
120(2)169,
122(1)119,
123(1)139,
124(1)180,
124(2)221,
127(2)199,
128(1)99,
129(1)123,
136(1)57
- unfold/fold,
75(1)z,
86(1)107,
86(1)z,
105(1)57
- unfoldash,
86(1)107,
105(1)57