skip to main content
keynote

Interactive programming with dependent types

Published:25 September 2013Publication History
Skip Abstract Section

Abstract

In dependently typed languages run-time values can appear in types, making it possible to give programs more precise types than in languages without dependent types. This can range from keeping track of simple invariants like the length of a list, to full functional correctness. In addition to having some correctness guarantees on the final program, assigning more precise types to programs means that you can get more assistance from the type checker while writing them. This is what I focus on here, demonstrating how the programming environment of Agda can help you when developing dependently typed programs.

References

  1. E. Brady. Idris-systems programming meets full dependent types. In Proc. of 5th ACM Workshop on Programming Languages Meets Program Verification, PLPV '11, pp. 1--2. ACM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. McBride and J. McKinna. The view from the left. J. of Funct. Program., 14(1):69--111, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers U. of Techn., 2007.Google ScholarGoogle Scholar
  4. S. Peyton Jones, D. Vytiniotis, S. Weirich, and G. Washburn. Simple unification-based type inference for GADTs. In Proc. of 11th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '06, pp. 50--61. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Schrijvers, S. Peyton Jones, M. Chakravarty, and M. Sulzmann. Type checking with open type functions. In Proc. of 13th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '08, pp. 51--62. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Sozeau. PROGRAM-ing finger trees in Coq. In Proc. of 12th ACM SIGPLAN Int. Conf. on Functional Programming, ICFP '07, pp. 13--24. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. }yorgey:datakindsB. A. Yorgey, S. Weirich, J. Cretin, S. Peyton Jones, D. Vytiniotis, and J. P. Magalhaes. Giving Haskell a promotion. In Proc. of 8th ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI '12, pp. 53--66. ACM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Interactive programming with dependent types

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM SIGPLAN Notices
          ACM SIGPLAN Notices  Volume 48, Issue 9
          ICFP '13
          September 2013
          457 pages
          ISSN:0362-1340
          EISSN:1558-1160
          DOI:10.1145/2544174
          Issue’s Table of Contents
          • cover image ACM Conferences
            ICFP '13: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
            September 2013
            484 pages
            ISBN:9781450323260
            DOI:10.1145/2500365

          Copyright © 2013 Copyright is held by the owner/author(s)

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 25 September 2013

          Check for updates

          Author Tags

          Qualifiers

          • keynote

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!