The Informatic Derivative at a Compact Element

  • Keye Martin
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2303)

Abstract

We extend the informatic derivative to compact elements in domains. This allows one to quantitatively analyze processes which manipulate both continuous and discrete data in a uniform manner.

Download to read the full conference paper text

References

  1. 1.
    S. Abramsky and A. Jung, Domain theory. In S. Abramsky, D. M. Gabbay, T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, vol. III. Oxford University Press, 1994.Google Scholar
  2. 2.
    K. Martin, A foundation for computation. Ph.D. Thesis, Department of Mathematics, Tulane University, 2000. http://web.comlab.ox.ac.uk/oucl/work/keye.martin
  3. 3.
    K. Martin, A principle of induction. Lecture Notes in Computer Science, vol. 2142, Springer-Verlag, 2001.Google Scholar
  4. 4.
    K. Martin, A renee equation for algorithmic complexity. Lecture Notes in Computer Science, vol. 2215, Springer-Verlag, 2001.Google Scholar
  5. 5.
    K. Martin, The measurement process in domain theory. Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, vol. 1853, Springer-Verlag, 2000.CrossRefGoogle Scholar
  6. 6.
    K. Martin, Powerdomains and zero finding. Electronic Notes in Theoretical Computer Science, vol 59.3, 2001, to appear.Google Scholar
  7. 7.
    K. Martin, Unique fixed points in domain theory. Proceedings of MFPS XVII, Electronic Notes in Theoretical Computer Science, vol. 45, 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Keye Martin
    • 1
  1. 1.Oxford University Computing LaboratoryOxford

Personalised recommendations