Skip to main content
SpringerLink
Log in

Proof Nets

  • Chapter
Logic Program Synthesis and Transformation

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

  • 47 Accesses

Abstract

Constructive logic has been proposed as a frame to formalize program synthesis according to the paradigm “constructive proofs = programs”. To obtain a natural interpretation of proofs as programs, adequate representations of proofs are required. In this paper we propose to represent proofs by a kind of Predicate Transition Petri Nets. Net representation gives rise to an immediate reading of the computational aspects of proofs and allows to treat various logics in an uniform way.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bates J., Constable R. - Proofs as programs -ACM Transaction on Programming Languages and Systems, vol. 7, n.l, 1985, pp. 113–136.

    Google Scholar 

  2. Brauer W., Reisig W., Rozenberg G. (ed.) - Petri Nets: Central Models and Their Properties - LNCS n. 254, Springer Verlag, 1987.

    Google Scholar 

  3. Constable R. et al. - Implementing Mathematics with the Nuprl Development System - N. J., Prentice-Hall, 1986.

    Google Scholar 

  4. Goad C. - Computational uses of the manipulation of formal proofs - Rep. STAN-CS-80–819, Stanford University, 1980.

    Google Scholar 

  5. Girard, J.Y.–Linear Logic–Theoretical Computer Science, 50 (1987), pp. 1–102.

    MathSciNet  MATH  Google Scholar 

  6. Hayashi S., Nakano H. - PX: A computational logic - MIT Press, Cambridge, 1988.

    Google Scholar 

  7. Miglioli P., Ornaghi M. - A logically justified model of computation I,II - Fundamenta Informaticae, IV. 1, 2, 1981.

    Google Scholar 

  8. Nelson D. - Constructible falsity -Journalof Symbolic Logic, vol 14, pag. 16–26

    Google Scholar 

  9. Nepejvoda N. - Proofs as Graphs -Semiotics and Informatics, vol. 26, 1986 (known by title)

    Google Scholar 

  10. Nordstrom B., Smith J.M.–Propositions, Types and Specifications of Programs in Martin-Löfs Type Theory–BIT, vol. 24, n. 3, 1984, pp. 288–301.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell’Informazione, Via Comelico 39/41, Milano, Italy

    Mario Ornaghi

Authors
  1. Mario Ornaghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, The University, M13 9PL, Manchester, UK

    Kung-Kiu Lau Bsc, PhD  & Timothy Paul Clement Ma, DPhil  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag London

About this chapter

Cite this chapter

Ornaghi, M. (1993). Proof Nets. In: Lau, KK., Clement, T.P. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3560-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3560-9_5

  • Publisher Name: Springer, London

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

  • Online ISBN: 978-1-4471-3560-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation