Preface
págs. 139-140
Compactly generated domain theoryResearch supported by an EPSRC research grant, `Topological Models of Computational Metalanguages¿, and an EPSRC Advanced Research Fellowship (Simpson)
págs. 141-161
Modified bar recursion
págs. 163-183
Graph models of $\lambda$-calculus at work, and variations
págs. 185-221
Quotients of countably based spaces are not closed under sobrification
págs. 223-229
A Cartesian closed extension of the category of locales
págs. 231-253
Monoids over domains
págs. 255-277
On sequential functionals of type 3
págs. 279-289
The strength of Engeler's lemma
págs. 291-297
A domain-theoretic Banach¿Alaoglu theorem
págs. 299-311
Denotational semantics for a program logic of objectsThis work was supported by the EPSRC under grant GR/R65190/01, `Programming Logics for Denotations of Recursive Objects¿
págs. 313-358
Partial metrisability of continuous posets
págs. 359-372
© 2008-2024 Fundación Dialnet · Todos los derechos reservados
Coordinado por: