Skip to main content

Writing Portable Programs

  • Chapter
  • 126 Accesses

Abstract

The purpose of this chapter is to introduce some methodology to help write portable programs easily.

Keywords

  • Simple Rule
  • Parent Node
  • Current Database
  • Ground Term
  • Duplicate Variable

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-642-61411-8_10
  • Chapter length: 6 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-642-61411-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and Permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Deransart, P., Ed-Dbali, A., Cervoni, L. (1996). Writing Portable Programs. In: Prolog: The Standard. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-61411-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-61411-8_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59304-1

  • Online ISBN: 978-3-642-61411-8

  • eBook Packages: Springer Book Archive