Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Dependent type system with subtyping (I) type level transitivity elimination

  • Special Section Papers
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Dependent type systems are the basis of many proof development environments. In Aspinall and Compagnoni's paper, a system λP ≤ is proposed as a subtyping extension of the first order dependent type system λP (also called λΠ). λP ≤, has nice meta-theoretic properties including subject reduction and decidability. In this article, we give a reformulation of λP ≤, called λΠ≤. The advantages of λΠ≤ include: type level transitivity elimination property and pretype-based subtyping system. These features considerably facilitate the meta-theoretical study and further extensions of this system.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Pfenning F. Refinement types for logical frameworks. InInformal Proceedings of the 1993 Workshop on Types for Proofs and Programs, May 1993.

  2. Coquand T. Pattern matching with dependent types. InProceedings on Types for Proofs and Programs, 1992, pp. 71–83.

  3. Luo Zhaohui. Coercive subtyping in type theory. InCSL'96, the 1996 Annual Conference of the European Association for Computer Science Logic, Utrecht, volume 1258, 1996.

  4. Aspinall D, Compagnoni A. Subtyping dependent types. In11th Annual Synposium on Logic in Computer Science, IEEE, 1996, pp.86–97.

  5. Judicaelë Courant. Rapport de magistère, November 1995.

  6. Anthony Bailey. Lego with implicit coercions, 1996. Unpublished draft.

  7. Gilles Barthe. Implicit coercions in type systems. InProc. TYPES'95, LNCS 1128, pp.1–15.

  8. Saibi A. Typing algorithm in type theory with inheritance. Inthe 24th Annual SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 1997, Paris, France.

  9. Castagna G, Ghelli G, Longo G. A calculus for overloaded functions with sub-typing. InACM Conference on LISP and Functional Programming, 1992, pp.182–192. Extended and Revised Version inInformation and Computation, 1995, 117(1): 115–135.

  10. Giuseppe Longo, Kathleen Milsted, Sergei Soloviev. A logic of subtyping, extended abstract. InLogic in Computer Science (LICS), IEEE, San Diego, 1995, pp.292–300. Complete version available on ftp.ens.fr/pub/dmi/users/longo/.

    Google Scholar 

  11. Pierce B, Steffen M. Higher-order subtyping. InIFIP Working Conference on Programming Concepts, Methods and Calculi (PROCOMET) 1994. Full version inTheoretical Computer Science, 1997, 176(1–2): 235–282, (with a corrigendum in TCS vol. 184 (1997), p. 247).

  12. Compagnoni A B. Subtyping inF ωΛ is decidable. Technical Report ECS-LFCS-94-281, LFCS University of Edinburgh, January 1994, and in CSL'94.

  13. Harper R, Honsell F, Plotkin G. A framework for defining logics.Journal of the Association for Computing Machinery, January 1993, 40(1): 143–184.

    MATH  MathSciNet  Google Scholar 

  14. Dowek G. Type theories, 1995. Notes de cours de DEA.

  15. Hickey J J. Formal abstract data types, December 1995. Unpublished draft.

  16. Curien P L, Ghelli G. Coherence of subsumption, minimum typing and the type checking inF≤.Mathematical Structures in Computer Science, 1992, 2(1): 55–91.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DMI-LIENS, Ecole Normale Supérieure, 45, rue d'Ulm, 75230, Paris, France

    Chen Gang

Authors
  1. Chen Gang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chen Gang.

Additional information

This work is supported by Programme PRA M4, Association Franco-Chinoise pour la Recherche Scientifique et Technique, and Bourse du Ministère des Affaires Etrangères du Gouvernment Français.

Due to the limitation of the pages of the journal, this paper has been splited into two parts. This is the first part of the paper. The second part will appear on Vol. 14, No. 2 or No.3 of this journal.

Chen Gang received the B.S. degree from Department of Mathematics, Zhejiang University; the M.S. degree from Department of Computer Science, Peking University. He is presently a Ph.D. candidate in computer science at University Paris 7 and Ecole Normale Supérieure, Paris. His research interests include type theory, subtyping, proof assistant, object-oriented programming language and artificial intelligence.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, G. Dependent type system with subtyping (I) type level transitivity elimination. J. of Comput. Sci. & Technol. 13, 564–578 (1998). https://doi.org/10.1007/BF02946500

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02946500

Keywords

Search

Navigation