Re: Topology of proof

please excuse
as i am at work right now
and only have access to my work library

but there are two books here
that cover this topic in some detail

topological denotational semantics
in computer science
is often called domain theory
(or alternatively fixed-point semantics
though the references may mix this with other results)
so you may have luck searching under that

"domains and lambda-calculi"
by amadio (robert m.) and curien (pierre-louis)
is a really good modern book

it starts with the basics of cartesian-closed categories
and progresses to chapters on
domain equations
stone-duality
stability and fixed points
linear logic
and the all important realisability results

a somewhat more elementary approach
can be found in
"semantics of programming languages:
structures and techniques"
by gunter (carl a.)
this is actually the book that introduced me
to domain theory
and is perhaps one of the clearest reads on the topic

once you get more into the theory
i would suggest reading _all_ of scott's papers
on the topic
he has a very clear approach
that helped me understand many of the whys

(i will give more suggestions when i get home)

-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
galathaea: prankster, fablist, magician, liar

.

Relevant Pages

  • Re: domains for typed lambda calculi
    ... based on Scott domains ... This semantics is based on the ... Gordon D. Plotkin. ... Pisa Notes (On Domain Theory). ...
    (comp.theory)
  • Re: Topology of proof
    ... > please excuse ... > is often called domain theory ... > (or alternatively fixed-point semantics ... > galathaea: prankster, fablist, magician, liar ...
    (sci.logic)