Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 11
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Altenkirch, Thorsten and Kaposi, Ambrus 2016. Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016. p. 18.

    Altenkirch, Thorsten and Kaposi, Ambrus 2016. Type theory in type theory using quotient inductive types. ACM SIGPLAN Notices, Vol. 51, Issue. 1, p. 18.


    Cai, Yufei Giarrusso, Paolo G. and Ostermann, Klaus 2016. System f-omega with equirecursive types for datatype-generic programming. ACM SIGPLAN Notices, Vol. 51, Issue. 1, p. 30.


    Cai, Yufei Giarrusso, Paolo G. and Ostermann, Klaus 2016. Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - POPL 2016. p. 30.

    Grohne, Helmut and Voigtländer, Janis 2016. Formalizing semantic bidirectionalization and extensions with dependent types. Journal of Logical and Algebraic Methods in Programming,


    Bernardy, Jean-Philippe Coquand, Thierry and Moulin, Guilhem 2015. A Presheaf Model of Parametric Type Theory. Electronic Notes in Theoretical Computer Science, Vol. 319, p. 67.


    Blanchette, Jasmin Christian Popescu, Andrei and Traytel, Dmitriy 2015. Foundational extensible corecursion: a proof assistant perspective. ACM SIGPLAN Notices, Vol. 50, Issue. 9, p. 192.


    Blanchette, Jasmin Christian Popescu, Andrei and Traytel, Dmitriy 2015. Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming - ICFP 2015. p. 192.

    Matsuda, Kazutaka and Wang, Meng 2015. “Bidirectionalization for free” for monomorphic transformations. Science of Computer Programming, Vol. 111, p. 79.


    Rabe, Florian 2015. Lax Theory Morphisms. ACM Transactions on Computational Logic, Vol. 17, Issue. 1, p. 1.


    Lasson, Marc 2014. Canonicity of Weak ω-groupoid Laws Using Parametricity Theory. Electronic Notes in Theoretical Computer Science, Vol. 308, p. 229.


    ×

Proofs for free: Parametricity for dependent types

  • JEAN-PHILIPPE BERNARDY (a1), PATRIK JANSSON (a1) and ROSS PATERSON (a2)
  • DOI: http://dx.doi.org/10.1017/S0956796812000056
  • Published online: 30 March 2012
Abstract
Abstract

Reynolds' abstraction theorem (Reynolds, J. C. (1983) Types, abstraction and parametric polymorphism, Inf. Process.83(1), 513–523) shows how a typing judgement in System F can be translated into a relational statement (in second-order predicate logic) about inhabitants of the type. We obtain a similar result for pure type systems (PTSs): for any PTS used as a programming language, there is a PTS that can be used as a logic for parametricity. Types in the source PTS are translated to relations (expressed as types) in the target. Similarly, values of a given type are translated to proofs that the values satisfy the relational interpretation. We extend the result to inductive families. We also show that the assumption that every term satisfies the parametricity condition generated by its type is consistent with the generated logic.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

M. Abadi , L. Cardelli & P. Curien (1993) Formal parametric polymorphism. In Proceedings of POPL'93 (Charleston, SC). New York: ACM, pp. 157170.

C. Böhm & A. Berarducci (1985) Automatic synthesis of typed lambda-programs on term algebras. Theor. Comp. Sci. 39 (2–3), 135154.

P. Dybjer (1994) Inductive families. Form. Asp. Comput. 6 (4), 440465.

C. Paulin-Mohring (1993) Inductive definitions in the system Coq – rules and properties. In Typed Lambda Calculi and Applications, M. Bezem & J. F. Groote (eds), Berlin, Germany: Springer pp. 328345.

P. Wadler (2007) The Girard–Reynolds isomorphism. Theor. Comp. Sci. 375 (1–3), 201226.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Journal of Functional Programming
  • ISSN: 0956-7968
  • EISSN: 1469-7653
  • URL: /core/journals/journal-of-functional-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×