Axiomatic Domain Theory in Categories of Partial Maps

Front Cover
Cambridge University Press, Mar 25, 2004 - Computers - 256 pages
0 Reviews
Axiomatic categorical domain theory is crucial for understanding the meaning of programs and reasoning about them. This book is the first systematic account of the subject and studies mathematical structures suitable for modelling functional programming languages in an axiomatic (i.e. abstract) setting. In particular, the author develops theories of partiality and recursive types and applies them to the study of the metalanguage FPC; for example, enriched categorical models of the FPC are defined. Furthermore, FPC is considered as a programming language with a call-by-value operational semantics and a denotational semantics defined on top of a categorical model. To conclude, for an axiomatisation of absolute non-trivial domain-theoretic models of FPC, operational and denotational semantics are related by means of computational soundness and adequacy results. To make the book reasonably self-contained, the author includes an introduction to enriched category theory.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

III
1
VI
2
VII
3
IX
4
X
6
XI
7
XII
9
XIII
10
XLV
115
XLVI
117
XLVII
120
XLVIII
126
XLIX
130
L
132
LI
133
LIII
137

XIV
11
XV
12
XVII
17
XIX
20
XX
22
XXII
29
XXIII
33
XXIV
34
XXVI
39
XXVII
48
XXVIII
52
XXX
55
XXXI
58
XXXII
59
XXXIII
62
XXXIV
65
XXXV
71
XXXVI
72
XXXVII
73
XXXVIII
77
XL
85
XLI
90
XLII
100
XLIII
106
LIV
138
LVI
142
LVII
147
LIX
150
LX
151
LXI
152
LXII
158
LXIII
159
LXV
166
LXVI
170
LXVIII
171
LXIX
191
LXX
192
LXXII
193
LXXIII
198
LXXIV
200
LXXVI
201
LXXVII
202
LXXVIII
205
LXXIX
222
LXXX
226
LXXXI
233
LXXXII
238
Copyright

Common terms and phrases

Popular passages

Page 226 - M. Barr. Algebraically compact functors. Journal of Pure and Applied Algebra, 82:211-231, 1992.

References to this book

All Book Search results »

Bibliographic information