Entry Hartonas:1998:FAF from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
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{Hartonas:1998:FAF,
author = "Chrysafis Hartonas",
title = "A fixpoint approach to finite delay and fairness",
journal = j-THEOR-COMP-SCI,
volume = "198",
number = "1--2",
pages = "131--158",
day = "30",
month = may,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:48 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=198&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/198/1-2/2612.pdf",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240P (Parallel programming
and algorithm theory)",
corpsource = "Sch. of Cognitive and Comput. Sci., Sussex Univ.,
Brighton, UK",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "calculus of communicating systems; explicit typing;
fairness; finite delay; recursion; restriction
operation; SCCS; subcalculi",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- approach,
138(1)101,
139(1)27,
139(1)207,
139(1)315,
146(1)109,
147(1)19,
147(1)55,
151(1)37,
152(2)305,
159(2)245,
159(2)319,
160(1)217,
170(1)349,
171(1)77,
173(2)513,
175(1)3,
177(1)3,
179(1)103,
180(1)115,
184(1)145,
187(1)3,
187(1)105,
194(1)183,
194(1)240-2,
194(1)241-3,
194(1)243-2,
194(1)247,
195(2)183,
203(1)69,
206(1)219,
210(1)73,
216(1)311,
220(2)489,
221(1)271
- communicating,
138(2)243,
138(2)273,
138(2)315,
139(1)315,
140(1)73,
141(1)195,
146(1)25,
146(1)341,
152(2)171,
152(2)219,
152(2)251,
153(1)65,
165(2)463,
167(1)235,
168(1)53,
170(1)445,
174(1)217,
174(1)231,
176(1)205,
177(2)287,
177(2)329,
179(1)217,
179(1)301,
189(1)179,
192(2)287,
195(2)155,
195(2)205,
198(1)99,
198(1)225,
215(1)349
- delay,
162(2)323,
176(1)205,
178(1)119,
191(1)61,
195(2)155,
196(1)131,
196(1)131-1,
204(1)11,
205(1)297
- explicit,
145(1)71,
151(1)207,
168(1)53,
170(1)383,
171(1)61,
186(1)83,
194(1)243,
211(1)375
- fairness,
146(1)199,
152(2)219,
153(1)245,
176(1)205,
177(1)139,
183(2)229,
189(1)109,
197(1)1
- fixpoint,
138(1)141,
149(1)67,
160(1)283,
169(2)201,
176(1)205,
176(1)283,
177(1)27,
178(1)237,
190(2)317,
194(1)241,
195(2)133
- Hartonas, Chrysafis,
176(1)205,
202(1)193
- operation,
141(1)53,
143(1)51,
148(1)171,
149(1)179,
149(2)201,
154(2)165,
155(1)1,
156(1)1,
157(2)215,
160(1)87,
161(1)301,
164(1)1,
165(2)391,
166(1)173,
167(1)131,
172(1)135,
173(1)151,
174(1)67,
175(1)183,
179(1)251,
180(1)17,
180(1)341,
181(2)379,
187(1)7,
190(2)363,
191(1)79,
191(1)117,
192(2)167,
192(2)201,
192(2)259,
194(1)242-2,
195(1)61,
196(1)347,
200(1)1,
205(1)317,
207(1)73,
216(1)159
- recursion,
138(2)391,
146(1)269,
149(1)3,
151(1)207,
151(1)z,
152(2)251,
160(1)1,
162(1)23,
163(1)245,
163(1)269,
169(1)113,
169(2)201,
170(1)145,
176(1)111,
176(1)205,
177(1)3,
177(2)329,
177(2)351,
187(1)203,
193(1)129,
210(1)121,
212(1)157
- restriction,
142(2)229,
148(1)93,
155(1)85,
155(1)111,
179(1)61,
180(1)139,
194(1)241,
226(1)207
- SCCS,
176(1)205
- typing,
155(1)85,
155(1)179,
193(1)75,
194(1)240-1,
194(1)246