메뉴 건너뛰기




Volumn 11, Issue 1, 2003, Pages 41-67

Quantitative continuous domains

Author keywords

Algebraic dcpo; Domain; Measurement; Partial metric; Quantitative domain theory

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; METRIC SYSTEM; SEMANTICS; THEOREM PROVING; TOPOLOGY;

EID: 0037624891     PISSN: 09272852     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1023012924892     Document Type: Review
Times cited : (49)

References (22)
  • 1
    • 0001847686 scopus 로고
    • Domain theory
    • S. Abramsky, D. M. Gabbay and T. S. E. Maibaum (eds), Clarendon Press
    • Abramsky, S. and Jung, A.: Domain theory, in S. Abramsky, D. M. Gabbay and T. S. E. Maibaum (eds), Handbook of Logic in Computer Science, Vol. 3, Clarendon Press, 1994, pp. 1-168.
    • (1994) Handbook of Logic in Computer Science , vol.3 , pp. 1-168
    • Abramsky, S.1    Jung, A.2
  • 2
    • 0002574415 scopus 로고    scopus 로고
    • A computational model for metric spaces
    • Edalat, A. and Heckmann, R.: A computational model for metric spaces, Theoretical Computer Science 193(1-2) (1998), 53-73.
    • (1998) Theoretical Computer Science , vol.193 , Issue.1-2 , pp. 53-73
    • Edalat, A.1    Heckmann, R.2
  • 4
    • 0031461105 scopus 로고    scopus 로고
    • Quantales and continuity spaces
    • Flagg, R. C.: Quantales and continuity spaces, Algebra Universalis 37(3) (1997), 257-276.
    • (1997) Algebra Universalis , vol.37 , Issue.3 , pp. 257-276
    • Flagg, R.C.1
  • 5
    • 0031125836 scopus 로고    scopus 로고
    • Continuity spaces: Reconciling domains and metric spaces
    • Flagg, B. and Kopperman, R.: Continuity spaces: Reconciling domains and metric spaces, Theoretical Computer Science 177(1) (1997), 111-138.
    • (1997) Theoretical Computer Science , vol.177 , Issue.1 , pp. 111-138
    • Flagg, B.1    Kopperman, R.2
  • 9
    • 0037879732 scopus 로고    scopus 로고
    • Approximation of metric spaces by partial metric spaces
    • Heckmann, R.: Approximation of metric spaces by partial metric spaces, Applied Categorical Structures 7 (1999), 71-83.
    • (1999) Applied Categorical Structures , vol.7 , pp. 71-83
    • Heckmann, R.1
  • 10
    • 0013457461 scopus 로고
    • Local compactness and continuous lattices
    • in B. Banaschewski and R.-E. Hoffmann (eds), Continuous Lattices, Proceedings Bremen, Springer-Verlag
    • Hofmann, K. H. and Mislove, M.: Local compactness and continuous lattices, in B. Banaschewski and R.-E. Hoffmann (eds), Continuous Lattices, Proceedings Bremen 1979, Lecture Notes in Mathematics 871, Springer-Verlag, 1981, pp. 209-248.
    • (1979) Lecture Notes in Mathematics , vol.871 , pp. 209-248
    • Hofmann, K.H.1    Mislove, M.2
  • 13
    • 0041528401 scopus 로고    scopus 로고
    • The regular spaces with countably based models
    • to appear
    • Martin, K.: The regular spaces with countably based models, Theoretical Computer Science, to appear.
    • Theoretical Computer Science
    • Martin, K.1
  • 14
    • 0038555985 scopus 로고    scopus 로고
    • PhD thesis, Department of Mathematics, Tulane University, New Orleans, LA 70118
    • Martin, K.: A foundation for computation, PhD thesis, Department of Mathematics, Tulane University, New Orleans, LA 70118, 2000.
    • (2000) A Foundation for Computation
    • Martin, K.1
  • 16
    • 0038555975 scopus 로고
    • Research Report CS-RR-293, Department of Computer Science, University of Warwick, Coventry, UK, October
    • O'Neill, S. J.: Partial metrics, valuations and domain theory, Research Report CS-RR-293, Department of Computer Science, University of Warwick, Coventry, UK, October 1995.
    • (1995) Partial Metrics, Valuations and Domain Theory
    • O'Neill, S.J.1
  • 17
    • 0038555976 scopus 로고
    • Research Report CS-RR-283, Department of Computer Science, University of Warwick, Coventry, UK, March
    • O'Neill, S. J.: Two topologies are better than one, Research Report CS-RR-283, Department of Computer Science, University of Warwick, Coventry, UK, March 1995.
    • (1995) Two Topologies are Better Than One
    • O'Neill, S.J.1
  • 20
    • 0038217252 scopus 로고    scopus 로고
    • A characterization of partial metrizability
    • Domains are quantifiable, to appear in
    • Schellekens, M. P.: A characterization of partial metrizability. Domains are quantifiable, to appear in Theoretical Computer Science.
    • Theoretical Computer Science
    • Schellekens, M.P.1
  • 21
    • 85034837164 scopus 로고
    • Quasi-uniformities: Reconciling domains and metric spaces
    • M. Main, A. Melton, M. Mislove and D. Schmidt (eds), Proceedings of the Workshop on Mathematical Foundations of Programming Language Semantics, Springer, New York
    • Smyth, M. B.: Quasi-uniformities: Reconciling domains and metric spaces, in M. Main, A. Melton, M. Mislove and D. Schmidt (eds), Proceedings of the Workshop on Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science 298, Springer, New York, 1988, pp. 236-253.
    • (1988) Lecture Notes in Computer Science , vol.298 , pp. 236-253
    • Smyth, M.B.1
  • 22
    • 0037541723 scopus 로고    scopus 로고
    • PhD thesis, School of Computer Science, The University of Birmingham, Edgbaston, B15 2TT, Birmingham, UK, May
    • Waszkiewicz, P.: Quantitative continuous domains, PhD thesis, School of Computer Science, The University of Birmingham, Edgbaston, B15 2TT, Birmingham, UK, May 2002.
    • (2002) Quantitative Continuous Domains
    • Waszkiewicz, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.