Skip to main content
SpringerLink
Log in

Predicate Transformers and Linear Logic: Yet Another Denotational Model

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2004)

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

Included in the following conference series:

Abstract

In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a category enjoying many algebraic properties.

We build on this structure to make predicate transformers into a denotational model of full linear logic: all the logical constructions have a natural interpretation in terms of predicate transformers (i.e. in terms of specifications). We then interpret proofs of a formula by a safety property for the corresponding specification.

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. Girard, J.Y.: Linear logic. Theoretical Computer Science 50 (1987)

    Google Scholar 

  2. Ehrhard, T., Regnier, L.: The differential lambda calculus. Theoretical Computer Science 309, 1–41 (2003)

    Article  MathSciNet  Google Scholar 

  3. Ehrhard, T., Regnier, L.: Differential interaction nets. unpublished note (2004)

    Google Scholar 

  4. Gardiner, P.H.B., Martin, C.E., de Moor, O.: An algebraic construction of predicate transformers. Science of Computer Programming 22, 21–44 (1994)

    Article  MathSciNet  Google Scholar 

  5. Back, R.J., von Wright, J.: Refinement Calculus: a systematic introduction. Graduate texts in computer science. Springer, New York (1998)

    Book  Google Scholar 

  6. Ehrhard, T.: Hypercoherences: a strongly stable model of linear logic. Mathematical Structures in Computer Science 3, 365–385 (1993)

    Article  MathSciNet  Google Scholar 

  7. Ehrhard, T.: Finiteness spaces. Mathematical Structures in Computer Science (2004, To appear)

    Google Scholar 

  8. Back, R.J., von Wright, J.: Product in the refinement calculus. Technical Report 235, Turku Center for Computer Science (1999)

    Google Scholar 

  9. Abramsky, S., Gay, S.J., Nagarajan, R.: A specification structure for deadlockfreedom of synchronous processes. Theoretical Computer Science 222, 1–53 (1999)

    Article  MathSciNet  Google Scholar 

  10. Bucciarelli, A., Ehrhard, T.: On phase semantics and denotational semantics: the exponentials. Annals of Pure and Applied Logic 109, 205–241 (2001)

    Article  MathSciNet  Google Scholar 

  11. Boudes, P.: Non-uniform hypercoherences. In: Blute, R., Selinger, P. (eds.) Program Construction, vol. 69, Elsevier, Amsterdam (2003)

    Google Scholar 

  12. Hyvernat, P.: Predicate transformers and linear logic: second order. Unpublished note (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut mathématique de Luminy, Marseille, France

    Pierre Hyvernat

  2. Chalmers Institute of Technology, Göteborg, Sweden

    Pierre Hyvernat

Authors
  1. Pierre Hyvernat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Wroclaw University, Poland

    Jerzy Marcinkowski

  2. Polish Academy of Sciences, Institute of Computer Science, Poland

    Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hyvernat, P. (2004). Predicate Transformers and Linear Logic: Yet Another Denotational Model. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30124-0_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23024-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation