References

Publications of Mart′?n H.Escard′o,

last updated29th January2007 Available at https://www.wendangku.net/doc/052006810.html,/~mhe/papers/index.html.

2007

References

[1]J.Raymundo Marcial-Romero and M.H.Escardo.Semantics of a sequential

language for exact real-number computation.Theoretical Computer Science, 2007.

2006

References

[1]F.DeJaeger,M.H.Escard′o,and G.Santini.On the computational content

of the Lawson topology.Theoretical Computer Science,357:230–240,2006.

[2]M.H.Escard′https://www.wendangku.net/doc/052006810.html,pactly generated Hausdor?locales.Annals of Pure and

Applied Logic,137(1–3):147–163,2006.

[3]M.H.Escard′o,A.Jung,and T.Streicher,editors.Special issue in honour of

Klaus Keimel’s65th birthday,2006.Mathematical Structures in Computer Science,volume16,number2.

2005

1

References

[1]M.H.Escard′o and W.K.Ho.Operational domain theory and topology of a

sequential programming language.In Proceedings of the20th Annual IEEE Symposium on Logic in Computer Science,pages427–436.IEEE Computer Society,2005.

[2]N.M¨u ller,M.H.Escard′o,and P.Zimmermann,editors.Practical develop-

ment of exact real number computation,2005.Journal of Logic and Algebraic Programming,volume64,issue1.

2004

References

[1]L.Birkedal,M.H.Escard′o,A.Jung,and G.Rosolini,editors.Recent de-

velopments in domain theory:a collection of papers in honour of Dana S.

Scott,2004.Theoretical Computer Science,vol.316no.1-3.

[2]M.H.Escard′o.Synthetic topology of data types and classical spaces.Elec-

tronic Notes in Theoretical Computer Science,87:21–156,2004.

[3]M.H.Escard′o,M.Hofmann,and T.Streicher.On the non-sequential nature

of the interval-domain model of real-number computation.Mathematical Structures in Computer Science,14(6):803–814,2004.

[4]M.H.Escard′o and A.Jung,editors.Proceedings of the Workshop on Do-

mains VI,volume73of Electronic Notes in Theoretical Computer Science, 2004.

[5]M.H.Escard′o,https://www.wendangku.net/doc/052006810.html,wson,and https://www.wendangku.net/doc/052006810.html,paring Cartesian closed cat-

egories of(core)compactly generated spaces.Topology and its Applications, 143(1-3),2004.

[6]J.R.Marcial-Romero and M.H.Escard′o.Semantics of a sequential language

for exact real-number computation.In Proceedings of the19th Annual IEEE Symposium on Logic In Computer Science,pages426–435.IEEE Computer Society,2004.

2003

References

[1]J.Ad′a mek and M.Hofmann M.H.Escard′o,editors.Category Theory and

Computer Science,2003.Theoretical Computer Science,vol.294,no.1-3.

2

[2]M.H.Escard′o.Injective locales over perfect embeddings and algebras of the

upper powerlocale monad.Applied General Topology,4(1):193–200,2003.

[3]M.H.Escard′o.Joins in the frame of nuclei.Applied Categorical Structures,

11(2):117–124,2003.

2002

References

[1]A.Bauer,M.H.Escard′o,and https://www.wendangku.net/doc/052006810.html,paring functional paradigms

for exact real-number computation.In Automata,languages and pro-gramming,volume2380of Lecture Notes in Comput.Sci.,pages489–500.

Springer,2002.

[2]M.H.Escard′o.Function-space compacti?cations of function spaces.Topology

and its Applications,120(3):441–463,2002.

[3]M.H.Escard′o and R.Heckmann.Topologies on spaces of continuous func-

tions.Topology Proceedings,26(2):545–564,2002.

[4]M.H.Escard′o and Th.Streicher.In domain realizability,not all functionals

on C[-1,1]are continuous.Mathematical Logic Quarterly,48(1):41–44,2002. 2001

References

[1]M.H.Escard′o.The regular-locally-compact core?ection of stably locally

compact locale.Journal of Pure and Applied Algebra,157(1):41–55,2001.

[2]M.H.Escard′o and A.K.Simpson.A universal characterization of the closed

Euclidean interval.In Proceedings of the16th Annual IEEE Symposium on Logic in Computer Science,pages115–128.IEEE Computer Society,2001. 2000

References

[1]A.Edalat and M.H.Escard′o.Integration in Real https://www.wendangku.net/doc/052006810.html,rmation and

Computation,160:128–166,2000.

1999

3

References

[1]M.H.Escard′o.On the compact-regular core?ection of a stably compact

locale.Electronic Notes in Theoretical Computer Science,20,1999.

[2]M.H.Escard′o and R.C.Flagg.Semantic domains,injective spaces and mon-

ads.Electronic Notes in Theoretical Computer Science,20,1999.

[3]M.H.Escard′o and Th.Streicher.Induction and recursion on the partial

real line with applications to Real PCF.Theoretical Computer Science, 210(1):121–157,1999.

1998

References

[1]T.Erker,M.H.Escard′o,and K.Keimel.The way-below relation of function

spaces over semantic domains.Topology and Its Applications,89(1–2):61–74, 1998.

[2]M.H.Escard′o.E?ective and sequential de?nition by cases on the reals via

in?nite signed-digit numerals.Electronic Notes in Theoretical Computer Science,13,1998.

[3]M.H.Escard′o.Injective spaces and the?lter monad.Technical Report ECS-

LFCS-98-383,Department of Computer Science,University of Edinburgh, 1998.

[4]M.H.Escard′o.Introduction to Real PCF.In J.-M.Chesneaux,F.J′e z′e quel,

https://www.wendangku.net/doc/052006810.html,motte,and J.Vignes,editors,Third Real Numbers and Computers Conference(RNC3),pages187–197,Paris,France,April1998.Universit′e Pierre et Marie Curie.Notes for an invited speach.

[5]M.H.Escard′o.A metric model of https://www.wendangku.net/doc/052006810.html,boratory for Foundations of

Computer Science,University of Edinburgh.Presented at the Workshop on Realizability Semantics and Applications,June30-July1,1999(associated to the Federated Logic Conference,held in Trento,June29-July12,1999), April1998.

[6]M.H.Escard′o.Properly injective spaces and function spaces.Topology and

Its Applications,89(1–2):75–120,1998.

[7]D.Pavlovic and M.H.Escard′o.Calculus in coinductive form.In Proceedings

of the13th Annual IEEE Symposium on Logic in Computer Science,pages 408–417.IEEE Computer Society,1998.

1997

4

References

[1]M.H.Escard′o.Injective spaces via the?lter monad.Topology Proceedings,

22(2):97–110,1997.

[2]M.H.Escard′o.PCF extended with real numbers:A domain-theoretic ap-

proach to higher-order exact real number computation.Technical Report ECS-LFCS-97-374,Department of Computer Science,University of Edin-burgh,December1997.PhD thesis at Imperial College of the University of London,1996.

[3]M.H.Escard′o and Th.Streicher.Induction and recursion on the partial

real line via biquotients of bifree algebras.In Proceedings of the12th An-nual IEEE Symposium on Logic in Computer Science,pages376–386.IEEE Computer Society,1997.

[4]D.Pavlovic and M.H.Escard′o.Calculus in coinductive form.Technical

Report97:05,School of Cognitive and Computing Sciences,University of Sussex,1997.

[5]P.J.Potts,A.Edalat,and M.H.Escard′o.Semantics of exact real number

arithmetic.In Proceedings of the12th Annual IEEE Symposium on Logic In Computer Science,pages248–257.IEEE Computer Society,1997.

1996

References

[1]A.Edalat and M.H.Escard′o.Integration in Real PCF(extended abstract).

In Proceedings of the11th Annual IEEE Symposium on Logic In Computer Science,pages382–393,1996.

[2]M.H.Escard′o.PCF extended with real numbers.Theoretical Computer

Science,162(1):79–115,1996.

[3]M.H.Escard′o.Real PCF extended with?is universal.In A.Edalat,S.Jour-

dan,and G.McCusker,editors,Advances in Theory and Formal Methods of Computing:Proceedings of the Third Imperial College Workshop,April 1996,pages13–24,Christ Church,Oxford,1996.IC Press.

1995

References

[1]M.H.Escard′o.Induction and recursion on the real line.In C.Hankin,

I.Mackie,and R.Nagarajan,editors,Theory and Formal Methods1994:

5

Proceedings of the Second Imperial College Workshop on Theory and Formal Methods,pages259–282,M?ller Centre,Cambridge,1995.IC Press.

6