Skip to main content
SpringerLink
Log in

An algorithmic approach to p-adic integers

  • Part VI New Directions
  • Conference paper
  • First Online:
Mathematical Foundations of Programming Language Semantics (MFPS 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 298))

Abstract

The ring of p-adic integers can be embedded as the maximal elements in a Scott domain with algebraic structure. We show how definitions and proofs in the mathematical theory of p-adics can be replaced by algorithms on the partial elements and formal programming methods working on the algorithms. Certain types of argument translate naturally into non-deterministic algorithms using the Smyth power domain.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5 Bibliography

  • Abramsky, Samson: Domain Theory in Logical Form, in: Proceedings of LICS '87.

    Google Scholar 

  • Birkhoff, Gareth, and MacLane, Saunders: A Survey of Modern Algebra (4th edition), Macmillan, New York, 1977, 500 pp.

    Google Scholar 

  • Cohn, P M: Algebra, volume 2, Wiley, London, New York, Sydney, Toronto, 1977, 483 pp.

    Google Scholar 

  • Fourman, M P, and Scott, D S: Sheaves and Logic, in: Applications of Sheaves, Lecture Notes in Mathematics 753, Springer-Verlag, Berlin, Heidelberg, New York, 1979, p. 302–401.

    Google Scholar 

  • Gregory, R T, and Krishnamurthy, E V: Methods and Applications of Error-free Computing, Springer-Verlag, Berlin, Heidelberg, New York, 1984.

    Google Scholar 

  • Hennessy, M, and Plotkin, G: Full Abstraction for a Simple Parallel Programming Language, in: J. Becvar, ed., Mathematical Foundations of Computer Science. Proceedings 1979, Lecture Notes in Computer Science 74, Springer-Verlag, Berlin, 1979.

    Google Scholar 

  • MacLane, Saunders: Categories for the Working Mathematician, Graduate Texts in Mathematics 5, Springer-Verlag, New York, Heidelberg, Berlin, 1971, 262 pp.

    Google Scholar 

  • Smyth, Michael: Power Domains, Journal of Computer and System Sciences vol. 16, 1978.

    Google Scholar 

  • Stoltenberg-Hansen, V, and Tucker, J V: Complete Local Rings as Domains, Report 1.85, Centre for Theoretical Computer Science, Leeds University, England, 1985, 31 pp.

    Google Scholar 

  • Vickers, Steven: A Fixpoint Construction of the p-adic Domain, to appear in: Summer Conference on Category Theory and Computer Science. Proceedings 1987, Springer-Verlag, Berlin, Heidelberg, New York, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept of Computing, Imperial College, SW7 2BZ, London

    Steven Vickers

Authors
  1. Steven Vickers
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Main A. Melton M. Mislove D. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vickers, S. (1988). An algorithmic approach to p-adic integers. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Language Semantics. MFPS 1987. Lecture Notes in Computer Science, vol 298. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19020-1_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-19020-1_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19020-2

  • Online ISBN: 978-3-540-38920-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation