Skip to main content
Springer Nature Link
Log in

Polarized Subtyping for Sized Types

  • Conference paper
Computer Science – Theory and Applications (CSR 2006)

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

Included in the following conference series:

Abstract

We present an algorithm for deciding polarized higher-order subtyping without bounded quantification. Constructors are identified not only modulo β, but also η. We give a direct proof of completeness, without constructing a model or establishing a strong normalization theorem. Inductive and coinductive types are enriched with a notion of size and the subtyping calculus is extended to account for the arising inclusions between the sized types.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abel, A.: Weak normalization for the simply-typed lambda-calculus in Twelf. In: Logical Frameworks and Metalanguages (LFM 2004). IJCAR, Cork, Ireland (2004)

    Google Scholar 

  2. Abel, A., Matthes, R.: Fixed points of type constructors and primitive recursion. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol. 3210, pp. 190–204. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Abel, A., Matthes, R., Uustalu, T.: Iteration schemes for higher-order and nested datatypes. Theoretical Computer Science 333(1–2), 3–66 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Adams, R.: A Modular Hierarchy of Logical Frameworks. Ph.D. thesis, University of Manchester (2005)

    Google Scholar 

  5. Altenkirch, T., Reus, B.: Monadic presentations of lambda terms using generalized inductive types. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 453–468. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Barthe, G., Frade, M.J., Giménez, E., Pinto, L., Uustalu, T.: Type-based termination of recursive definitions. Mathematical Structures in Computer Science 14(1), 1–45 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bird, R.S., Paterson, R.: De Bruijn notation as a nested datatype. J. of Funct. Program. 9(1), 77–91 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Compagnoni, A., Goguen, H.: Anti-symmetry of higher-order subtyping and equality by subtyping (submitted, 2005)

    Google Scholar 

  9. Compagnoni, A.B., Goguen, H.: Anti-symmetry of higher-order subtyping. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 420–438. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Compagnoni, A.B., Goguen, H.: Typed operational semantics for higher-order subtyping. Inf. Comput. 184(2), 242–297 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  11. Coquand, T.: An algorithm for testing conversion in type theory. In: Huet, G., Plotkin, G. (eds.) Logical Frameworks, pp. 255–279. Cambridge University Press, Cambridge (1991)

    Chapter  Google Scholar 

  12. Duggan, D., Compagnoni, A.: Subtyping for object type constructors (1998), Presented at FOOL 6

    Google Scholar 

  13. Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol. 7. Cambridge University Press, Cambridge (1989)

    MATH  Google Scholar 

  14. Goguen, H.: Typed operational semantics. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol. 902, pp. 186–200. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  15. Goguen, H.: Soundness of the logical framework for its typed operational semantics. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 177–197. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  16. Goguen, H.: Justifying algorithms for βη conversion. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 410–424. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Harper, R., Pfenning, F.: On equivalence and canonical forms in the LF type theory. ACM Transactions on Computational Logic 6(1), 61–101 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  18. Hinze, R.: Generalizing generalized tries. J. of Funct. Program. 10(4), 327–351 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  19. Hughes, J., Pareto, L., Sabry, A.: Proving the correctness of reactive systems using sized types. In: Symposium on Principles of Programming Languages, pp. 410–423 (1996)

    Google Scholar 

  20. Joachimski, F., Matthes, R.: Short proofs of normalization. Archive of Mathematical Logic 42(1), 59–87 (2003)

    Article  MATH  Google Scholar 

  21. Mendler, N.P.: Recursive types and type constraints in second-order lambda calculus. In: Logic in Computer Science (LICS 1987), Ithaca, N.Y, pp. 30–36. IEEE Computer Society Press, Los Alamitos (1987)

    Google Scholar 

  22. Okasaki, C.: From Fast Exponentiation to Square Matrices: An Adventure in Types. In: International Conference on Functional Programming, pp. 28–35 (1999)

    Google Scholar 

  23. Pierce, B.C.: Types and Programming Languages. MIT Press, Cambridge (2002)

    MATH  Google Scholar 

  24. Pierce, B.C., Steffen, M.: Higher order subtyping. Theor. Comput. Sci. 176(1,2), 235–282 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  25. Steffen, M.: Polarized Higher-Order Subtyping. Ph.D. thesis, Technische Fakultät, Universität Erlangen (1998)

    Google Scholar 

  26. Watkins, K., Cervesato, I., Pfenning, F., Walker, D.: A concurrent logical framework I: Judgements and properties. Tech. rep., School of Computer Science, Carnegie Mellon University, Pittsburgh (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Munich, Oettingenstr.67, D-80538, München, Germany

    Andreas Abel

Authors
  1. Andreas Abel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IRMAR, Université de Rennes, Campus de Beaulieu, 35042, Rennes Cedex, France

    Dima Grigoriev

  2. Intel Corporation, JF1-13, 2111 NE 25th Avenue, 97124, Hillsboro, OR, USA

    John Harrison

  3. Steklov Institute of Mathematics at St. Petersburg, 27 Fontanka, St., 191023, Petersburg, Russia

    Edward A. Hirsch

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abel, A. (2006). Polarized Subtyping for Sized Types. In: Grigoriev, D., Harrison, J., Hirsch, E.A. (eds) Computer Science – Theory and Applications. CSR 2006. Lecture Notes in Computer Science, vol 3967. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753728_39

Download citation

  • DOI: https://doi.org/10.1007/11753728_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34166-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation