Skip to main content
SpringerLink
Log in

Relative Hilbert-Post Completeness for Exceptions

  • Conference paper
  • First Online:
Mathematical Aspects of Computer and Information Sciences (MACIS 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9582))

Abstract

A theory is complete if it does not contain a contradiction, while all of its proper extensions do. In this paper, first we introduce a relative notion of syntactic completeness; then we prove that adding exceptions to a programming language can be done in such a way that the completeness of the language is not made worse. These proofs are formalized in a logical system which is close to the usual syntax for exceptions, and they have been checked with the proof assistant Coq.

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 EPUB and 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

Notes

  1. 1.

    For instance, a denotational semantics of our framework for exceptions, which relies on the common semantics of exceptions in these languages, was given in [8, Sect. 4].

References

  1. Bauer, A., Pretnar, M.: Programming with algebraic effects and handlers. J. Log. Algebr. Methods Program. 84, 108–123 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. Benton, N., Hughes, J., Moggi, E.: Monads and effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 42–122. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. C++ Working Draft: Standard for Programming Language C++. ISO/IEC JTC1/SC22/WG21 standard 14882:2011

    Google Scholar 

  4. Domínguez, C., Duval, D.: Diagrammatic logic applied to a parameterisation process. Math. Struct. Comput. Sci. 20, 639–654 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  5. Dumas, J.-G., Duval, D., Fousse, L., Reynaud, J.-C.: Decorated proofs for computational effects: states. In: ACCAT 2012, Electronic Proceedings in Theoretical Computer Science 93, pp. 45–59 (2012)

    Google Scholar 

  6. Dumas, J.-G., Duval, D., Fousse, L., Reynaud, J.-C.: A duality between exceptions and states. Math. Struct. Comput. Sci. 22, 719–722 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Dumas, J.-G., Duval, D., Reynaud, J.-C.: Cartesian effect categories are Freyd-categories. J. Symb. Comput. 46, 272–293 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Dumas, J.-G., Duval, D., Ekici, B., Reynaud, J.-C.: Certified proofs in programs involving exceptions. In: CICM 2014, CEUR Workshop Proceedings 1186 (2014)

    Google Scholar 

  9. Dumas, J.-G., Duval, D., Ekici, B., Pous, D.: Formal verification in Coq of program properties involving the global state. In: JFLA 2014, pp. 1–15 (2014)

    Google Scholar 

  10. Dumas, J.-G., Duval, D., Ekici, B., Pous, D., Reynaud, J.-C.: Hilbert-post completeness for the state and the exception effects (2015). arXiv:1503.00948 [v3]

  11. Gosling, J., Joy, B., Steele, G., Bracha, G.: The Java Language Specification, 3rd edn. Addison-Wesley (2005)

    Google Scholar 

  12. Idris. The Effects Tutorial

    Google Scholar 

  13. Lucassen, J.M., Gifford, D.K.: Polymorphic effect systems. In: POPL. ACM Press, pp. 47–57 (1988)

    Google Scholar 

  14. Moggi, E.: Notions of computation and monads. Inf. Comput. 93(1), 55–92 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mossakowski, T., Schröder, L., Goncharov, S.: A generic complete dynamic logic for reasoning about purity and effects. Form. Asp. Comput. 22, 363–384 (2010)

    Article  MATH  Google Scholar 

  16. Petricek, T., Orchard, D.A., Mycroft, A.: Coeffects: a calculus of context-dependent computation. In: Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming, pp. 123–135 (2014)

    Google Scholar 

  17. Pretnar, M.: The logic and handling of algebraic effects. Ph.D. University of Edinburgh (2010)

    Google Scholar 

  18. Plotkin, G., Power, J.: Notions of computation determine monads. In: Engberg, U., Nielsen, M. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 342–356. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Plotkin, G., Pretnar, M.: Handlers of algebraic effects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 80–94. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  20. Staton, S.: Completeness for algebraic theories of local state. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol. 6014, pp. 48–63. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  21. Tarski, A.: III On some fundamental concepts in mathematics. In: Logic, Semantics, Metamathematics: Papers from 1923 to 1938 by Alfred Tarski, pp. 30–37. Oxford University Press (1956)

    Google Scholar 

  22. Uustalu, T., Vene, V.: Comonadic notions of computation. Electr. Notes Theor. Comput. Sci. 203, 263–284 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  23. Ynot. The Ynot Project

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire J. Kuntzmann, Université Grenoble Alpes, 51, rue des Mathématiques, UMR CNRS 5224, bp 53X, 38041, Grenoble, France

    Jean-Guillaume Dumas, Dominique Duval & Burak Ekici

  2. Plume Team, CNRS, ENS Lyon, Université de Lyon, INRIA, UMR 5668, Lyon, France

    Damien Pous

  3. Reynaud Consulting (RC), Claix, France

    Jean-Claude Reynaud

Authors
  1. Jean-Guillaume Dumas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominique Duval
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Burak Ekici
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Damien Pous
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Jean-Claude Reynaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jean-Guillaume Dumas .

Editor information

Editors and Affiliations

  1. Wilfrid Laurier University, Waterloo, Ontario, Canada

    Ilias S. Kotsireas

  2. Hamburg University of Technology, Hamburg, Germany

    Siegfried M. Rump

  3. New York University, New York, New York, USA

    Chee K. Yap

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Dumas, JG., Duval, D., Ekici, B., Pous, D., Reynaud, JC. (2016). Relative Hilbert-Post Completeness for Exceptions. In: Kotsireas, I., Rump, S., Yap, C. (eds) Mathematical Aspects of Computer and Information Sciences. MACIS 2015. Lecture Notes in Computer Science(), vol 9582. Springer, Cham. https://doi.org/10.1007/978-3-319-32859-1_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32859-1_51

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32858-4

  • Online ISBN: 978-3-319-32859-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation