Skip to main content

Logical and computational invariants of programs

  • Conference paper
  • First Online:
Extensions of Logic Programming (ELP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 596))

Included in the following conference series:

  • 113 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Aronsson et. al. The programming language GCLA; a definitional approach to logic programming New Generation Computing, 4, 1990.

    Google Scholar 

  2. M.Aronsson et.al. A survey of GCLA: A definitional approach to logic programming, in: P. Schroeder-Heister (ed.), Extensions of Logic Programming: Proceedings of a workshop held at the SNS, Universität Tübingen, 1989, Springer Lecture Notes in Artificial Intelligence.

    Google Scholar 

  3. D.Fredholm, S.Serafimovski, Partial inductive definitions as type systems for λ-terms, in: Dybjer et.al. (ed.), Proceedings of the 1989 workshop on programming logic in Båstad, Chalmers 1990. (To appear in BIT.)

    Google Scholar 

  4. D. Fredholm, On function definitions I. Basic notions and primitive recursive function definitions, Licentiate thesis Chalmers 1990.

    Google Scholar 

  5. L. Hallnäs, Partial inductive definitions, TCS 87,1991.

    Google Scholar 

  6. L. Hallnäs, B. Nordström, A definitional view of functional programming in: Dybjer et.al. (ed.), Proceedings of the 1989 workshop on programming logic in Båstad, Chalmers 1990.

    Google Scholar 

  7. L. Hallnäs, P. Schroeder-Heister, A proof theoretic approach to logic programming I,II Journal of logic and computation 1990–91

    Google Scholar 

  8. P. Schroeder-Heister, Hypothetical reasoning and definitional reflection in logic programming, in: P. Schroeder-Heister (ed.), Extensions of Logic Programming: Proceedings of a workshop held at the SNS, Universität Tübingen, 1989, Springer Lecture Notes in Artificial Intelligence.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

L. -H. Eriksson L. Hallnäs P. Schroeder-Heister

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hallnäs, L. (1992). Logical and computational invariants of programs. In: Eriksson, L.H., Hallnäs, L., Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1991. Lecture Notes in Computer Science, vol 596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013608

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47114-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics