Skip to main content
SpringerLink
Log in

Embedding a Proof System in Haskell

  • Chapter
Central European Functional Programming School (CEFP 2009)

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

Included in the following conference series:

Abstract

This article reports about a work-in-progress project that aims at embedding a proof system [4] in the Haskell programming language. The goal of the system is to create formally verified software using the correctness by construction principle. Using Haskell as the host language provides a powerful and flexible environment so that programming language tools can be used to build proofs.

The main contribution of this paper is the systematic analysis of different techniques for language embedding. We present design decisions by pointing out which techniques are applicable and which ones are inappropriate or inconvenient to use when embedding a proof system like the our one. We also point out the advantages of the embedding compared to a previous implementation of the same system.

This work is supported by ELTE IKKK (KMOP-1.1.2-08).

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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. Home of Feldspar: http://feldspar.sourceforge.net

  2. Home of ForSyDe, http://www.ict.kth.se/forsyde

  3. Home of HackageDB, http://hackage.haskell.org

  4. Home of LaCert, http://deva.web.elte.hu/LaCert

  5. Abrial, J.-R.: The B-book: assigning programs to meanings. Cambridge University Press, New York (1996)

    Book  MATH  Google Scholar 

  6. Beckert, B., Hähnle, R., Schmitt, P.H. (eds.): Verification of Object-Oriented Software. LNCS (LNAI), vol. 4334. Springer, Heidelberg (2007)

    Google Scholar 

  7. Claessen, K., Sands, D.: Observable sharing for functional circuit description. In: Thiagarajan, P.S., Yap, R.H.C. (eds.) ASIAN 1999. LNCS, vol. 1742, pp. 62–73. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Cok, D.R., Kiniry, J.R.: ESC/Java2: Uniting ESC/Java and JML. In: Barthe, G., Burdy, L., Huisman, M., Lanet, J.-L., Muntean, T. (eds.) CASSIS 2004. LNCS, vol. 3362, pp. 108–128. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  9. de Mol, M., van Eekelen, M., Plasmeijer, R.: Theorem proving for functional programmers, Sparkle: A functional theorem prover. In: Arts, T., Mohnen, M. (eds.) IFL 2002. LNCS, vol. 2312, pp. 55–72. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Dévai, G.: Programming language elements for proof construction. In: Volume of abstracts of the 6th Joint Conference on Mathematics and Computer Science (2006)

    Google Scholar 

  11. Dévai, G.: Programming language elements for correctness proofs. Acta Cybernetica (accepted for publication 2007)

    Google Scholar 

  12. Dévai, G.: Meta programming on the proof level. Acta Universitatis Sapientiae, Informatica 1(1), 15–34 (2009)

    MATH  Google Scholar 

  13. Dévai, G., Csörnyei, Z.: Separation logic style reasoning in a refinement based language. In: Proceedings of the 7th International Conference on Applied Informatics (2007) (to appeare)

    Google Scholar 

  14. Dévai, G., Pataki, N.: A tool for formally specifying the C++ standard template library. Annales Universitatis Scientiarum Budapestinensis de Rolando Eötvös Nominatae, Sectio Computatorica 31, 147–166 (2009)

    MATH  Google Scholar 

  15. Horváth, Z., Kozsik, T., Tejfel, M.: Extending the Sparkle core language with object abstraction. Acta Cybernetica 17, 419–445 (2005)

    MATH  Google Scholar 

  16. Peyton Jones, S., Vytiniotis, D., Weirich, S., Washburn, G.: Simple unification-based type inference for GADTs. In: ICFP 2006: Proceedings of the eleventh ACM SIGPLAN International Conference on Functional Programming, pp. 50–61. ACM Press, New York (2006)

    Chapter  Google Scholar 

  17. Kozsik, T.: Proving Program Properties Specified with Subtype Marks. In: Horváth, Z., Zsók, V., Butterfield, A. (eds.) IFL 2006. LNCS, vol. 4449, pp. 163–180. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  18. McBride, C.: Faking it: Simulating dependent types in Haskell. Journal of Functional Programming 12(5), 375–392 (2002)

    MathSciNet  MATH  Google Scholar 

  19. McBride, C.: Epigram: Practical programming with dependent types. In: Advanced Functional Programming, pp. 130–170 (2004)

    Google Scholar 

  20. Morgan, C.: Programming from specifications, 2nd edn. Prentice Hall International (UK) Ltd. Englewood Cliffs (1994)

    MATH  Google Scholar 

  21. Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology (2007)

    Google Scholar 

  22. Schreiner, W.: The RISC ProofNavigator: A proving assistant for program verification in the classroom. Formal Aspects of Computing 21(3) (2009)

    Google Scholar 

  23. Winkler, J.: The frege program prover FPP. Internationales Wissenschaftliches Kolloquium 42, 116–121 (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Informatics, Dept. of Programming Languages and Compilers, Eötvös Loránd University, Pázmány Péter sétány 1/C, H-1117, Budapest, Hungary

    Gergely Dévai

Authors
  1. Gergely Dévai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Department of Programming Languages and Compilers, Eötvös Loránd University, Pázmány Péter Sétány 1/C, 1117, Budapest, Hungary

    Zoltán Horváth  & Viktória Zsók  & 

  2. Institute for Computing and Information Sciences, Radboud University Nijmegen, P.O. Box 9010, 6500, Nijmegen, GL, The Netherlands

    Rinus Plasmeijer

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dévai, G. (2010). Embedding a Proof System in Haskell. In: Horváth, Z., Plasmeijer, R., Zsók, V. (eds) Central European Functional Programming School. CEFP 2009. Lecture Notes in Computer Science, vol 6299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17685-2_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17685-2_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17684-5

  • Online ISBN: 978-3-642-17685-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation