Skip to main content
SpringerLink
Log in

Some analogues of partial and mixed computations in the logical programming approach

  • Regular papers
  • Published:
New Generation Computing Aims and scope Submit manuscript

Abstract

The logical approach to programming is the conception of programming based on constructive logics. A program is considered as the active part of a constructive proof. Correspondingly, from this point of view proof and program transformations are closely connected. Some program transformations are considered here, which are in some sense analogues of mixed computations. It is what would be expected that there is a variety of such analogues, here only some of the simplest ones are considered.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chang, C.-L. and Lee, R. C.,Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.

  2. Minc, G. E., “On E-theorems” (in Russian; there exists an English translation), О Етеоремчх. Эалиски научных семинаров ломи.-л.,T. 40, C. 110–118, 1974.

    MATH  MathSciNet  Google Scholar 

  3. Goad, C. A., “Computational uses of the manipulation on formal proofs,”Report N. ATAN-CS-88-819, Stanford, Ca:-122, 1980.

  4. Nepeivoda, N. N., “Semantics of algorithmic languages: a review” (in Russian; there exists an English translation),M.: винити,T. 20, C. 95–166, 1983.

    MathSciNet  Google Scholar 

  5. Nepeivoda, N. N., “Proofs as graphs” (in Russian),M.: винити, вып.26, C. 54–65, 1986.

    Google Scholar 

  6. Prawitz, D.,Natural Deduction, Stockholm, Almquist & Wisgell, -165, 1965.

    MATH  Google Scholar 

  7. Ershov, A. P., “On the essence of translation,”Programming, 5, 1977.

  8. Nepeivoda, N. N. “On constuctive logics” (in Russian),M., ИФAH CCCP, C. 84–86, 1986.

  9. Kaa'yanov, V. N., “Introduction into program optimization theory. Optimizing transformations of programs and their substantiating” (in Russian),Novosibirsk, 26, p. 260, 1985.

    Google Scholar 

  10. Burstall, R. M. and Popplestone, R. J., “POP-2 Reference Manual,”Machine Intelligence, 2, p. 205, 1968.

    MATH  Google Scholar 

  11. Henkin, L., “Some remarks on infinitely-long formulas,”Infinitistic Methods, Warsaw, pp. 167–183, 1961.

Download references

Author information

Authors and Affiliations

  1. Physical-Technical Institute, FTI-UO AN USSR, SU-426001, Izhevsk, USSR

    N. N. Nepeivoda

Authors
  1. N. N. Nepeivoda
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Footnote by the Editorial Board This paper was originally accepted for publication in Vol. 9 No. 2, June 1991. However, inaccessibility with the author during the proofreading of the paper necessitated the suspension of this publication. Although every possible effort was made to communicate with the author, no contact was properly re-established. Therefore, the Editorial Board wishes to present this paper with the full disclosure that special effort and due diligence were performed during the proofreading by its members. We wish to also give full acknowledgment to the author.

About this article

Cite this article

Nepeivoda, N.N. Some analogues of partial and mixed computations in the logical programming approach. NGCO 17, 309–327 (1999). https://doi.org/10.1007/BF03037224

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF03037224

Keywords

Search

Navigation