A rich hierarchy of functionals of finite types-Reference-Cited by-同舟云学术

A rich hierarchy of functionals of finite types

Published:2009-09-24 Issue:3 Volume:5 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Normann Dag

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference20 articles.

1. S. Abramsky and A. Jung,Domain Theory, in S. Abramsky, D.M. Gabbay and T.S.E. Maibaum (eds.)Handbook of Logic in Computer Science, volume 3, Clarendon Press (1994).

2. R. M. Amadio and P. -L. Curien,Domains and Lambda-Calculi, Cambridge University Press (1998). der and A. Simpson,A Convenient Category of Domains, in L. Cardelli, M. Fiore and G. Winskel (eds.)Computation, Meaning and Logic, Articles dedicated to Gordon Plotkin, Electronic Notes in Computer Science 34 (2007).

3. I. Battenfeld, M. Schröder and A. Simpson,A Convenient Category of Domains, in L. Cardelli, M. Fiore and G. Winskel (eds.)Computation, Meaning and Logic, Articles dedicated to Gordon Plotkin, Electronic Notes in Computer Science 34 (2007).

4. Domain representability of metric spaces

5. Domain representations of topological spaces

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Addendum to ‘The Katětov construction modified for a T0-quasi-metric space’;Mathematical Structures in Computer Science;2014-11-12

2. Banach Spaces as Data Types;Logical Methods in Computer Science;2011-05-17

3. Domain Representable Spaces Defined by Strictly Positive Induction;Logical Methods in Computer Science;2010-08-26

4. Domain representations of spaces of compact subsets;Mathematical Structures in Computer Science;2010-03-25