Skip to main content
Springer Nature Link
Log in

A Programming Language That Combines the Benefits of Static and Dynamic Typing

  • Conference paper
Software and Data Technologies (ICSOFT 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 170))

Included in the following conference series:

  • 583 Accesses

Abstract

Dynamically typed languages have recently turned out to be suitable for developing specific scenarios where dynamic adaptability or rapid prototyping are important issues. However, statically typed programming languages commonly offer more opportunities for compiler optimizations and earlier type error detection. Due to the benefits of both approaches, some programming languages such as C# 4.0, Boo, Visual Basic or Objective-C provide both static and dynamic typing. We describe the StaDyn programming language that supports both type systems in the very same programming language. The main contribution of StaDyn is that it keeps gathering type information at compile time even over dynamically typed references, obtaining a better runtime performance, earlier type error detection, and an intuitive combination of statically and dynamically typed code.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Pierce, B.C.: Types and Programming Languages. The MIT Press (2002)

    Google Scholar 

  2. Venners, B.: Twitter on Scala. A conversation with Steve Jenson, Alex Payne, and Robey Pointer. Artima Developer (April 2009)

    Google Scholar 

  3. Meijer, E., Drayton, P.: Dynamic typing when needed: The end of the cold war between programming languages. In: Proceedings of the OOPSLA Workshop on Revival of Dynamic Languages (2004)

    Google Scholar 

  4. Abadi, M., Cardelli, L., Pierce, B., Plotkin, G.: Dynamic typing in a statically typed lan-guage. ACM Transactions on Programming Languages and Systems 13(2), 237–268 (1991)

    Article  Google Scholar 

  5. Abadi, M., Cardelli, L., Pierce, B., Rémy, D., Taylor, R.W.: Dynamic typing in polymorphic languages. Journal of Functional Programming 5, 92–103 (1994)

    Google Scholar 

  6. Hürsch, W., Lopes, C.: Separation of concerns. Technical Report UN-CCS-95-03, North-eastern University, Boston, USA (1995)

    Google Scholar 

  7. Tucker, A.B.: Type Systems. The Computer Science and Engineering Handbook. CRC Press (1997)

    Google Scholar 

  8. Ortin, F., Garcia, M.: Union and intersection types to support both dynamic and static typing. Information Processing Letters 111(6), 278–286 (2011)

    Article  MathSciNet  Google Scholar 

  9. Ortin, F., Garcia, M.: Supporting Dynamic and Static Typing by means of Union and Intersection Types. In: International Conference on Progress in Informatics and Computing (PIC), pp. 993–999 (2010)

    Google Scholar 

  10. Cardelli, L.: Basic polymorphic typechecking. Science of Computer Programming (8), 147–172 (1988)

    Google Scholar 

  11. Milner, R.: A theory of type polymorphism in programming. Journal of Computer and System Sciences 17, 348–375 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  12. Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 13(4), 451–490 (1991)

    Article  Google Scholar 

  13. Freeman, T., Pfenning, F.: Refinement types for ML. In: Proceedings of the Conference on Programming Language Design and Implementation (PLDI), pp. 268–277 (1991)

    Google Scholar 

  14. Plevyak, J., Chien, A.: Precise concrete type inference for object-oriented languages. In: Proceeding of the OOPSLA Conference. SIGPLAN Notices, vol. 29(10) (1994)

    Google Scholar 

  15. Pierce, B.C.: Programming with intersection types and bounded polymorphism. Technical Report CMU-CS-91-106, School of Computer Science, Pittsburgh, PA, USA (1992)

    Google Scholar 

  16. Bracha, G.: Pluggable type systems. In: OOPSLA Workshop on Revival of Dynamic Languages (October 2004)

    Google Scholar 

  17. Canning, P., Cook, W., Hill, W., Olthoff, W., Mitchell, J.: F-bounded polymorphism for object-oriented programming. In: Proceedings of the International Conference on Functional Programming Languages and Computer Architecture, pp. 273–280 (1989)

    Google Scholar 

  18. Odersky, M., Sulzmann, M., Wehr, M.: Type inference with constrained types. Theory and Practice of Object Systems 5(1), 35–55 (1999)

    Article  Google Scholar 

  19. Landi, W., Ryder, B.: A safe approximate algorithm for interprocedural pointer aliasing. In: Conference on Programming Language Design and Implementation, pp. 473–489 (1992)

    Google Scholar 

  20. Diwan, A., McKinley, K., Moss, J.: Type-based alias analysis. In: Proceedings of the Conference on Programming Language Design and Implementation (PLDI 1991), pp. 106–117 (1991)

    Google Scholar 

  21. Emami, M., Ghiya, R., Hendren, L.: Context-sensitive inter-procedural points-to analysis in the presence of function pointers. In: Proceedings of Conference on Programming Language Design and Implementation, pp. 224–256 (1994)

    Google Scholar 

  22. Appel, A.: Modern Compiler Implementation in ML. Cambridge University Press (1998)

    Google Scholar 

  23. Parr, T.: The Definitive ANTLR Reference: Building Domain-Specific Languages. Pragmatic Bookshelf (2007)

    Google Scholar 

  24. Ortin, F., Zapico, D., Cueva, J.M.: Design patterns for teaching type checking in a compiler construction course. IEEE Transactions on Education 50(3), 273–283 (2007)

    Article  Google Scholar 

  25. Redondo, J.M., Ortin, F.: Optimizing reflective primitives of dynamic languages. International Journal of Software Engineering and Knowledge Engineering 18(6), 759–783 (2008)

    Article  Google Scholar 

  26. Ortin, F., Zapico, D., Perez-Schofield, J.B.G., Garcia, M.: Including both static and dy-namic typing in the same programming language. IET Software 4(4), 268–282 (2010)

    Article  Google Scholar 

  27. Ortin, F., Redondo, J.M., Perez-Schofield, J.B.G.: Efficient virtual machine support of runtime structural reflection. Science of Computer Programming 74 (2009)

    Google Scholar 

  28. Bracha, G., Griswold, D.: Strongtalk: Typechecking Smalltalk in a production environment. In: Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA), pp. 215–230. ACM, New York (1993)

    Google Scholar 

  29. Shalit, A.: The Dylan reference manual: the definitive guide to the new object-oriented dynamic language. Addison Wesley Longman Publishing Co. (1996)

    Google Scholar 

  30. Codehaus Foundation: Boo, a wrist friendly language for the CLI (2006), http://boo.codehaus.org

  31. Cartwright, R., Fagan, M.: Soft Typing. In: Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation (PLDI 1991), pp. 278–292 (1991)

    Google Scholar 

  32. Thatte, S.: Quasi-static typing. In: Proceedings of the 17th Symposium on Principles of Programming Languages (POPL), pp. 367–381. ACM, New York (1990)

    Google Scholar 

  33. Flanagan, C., Freund, S., Tomb, A.: Hybrid types, invariants, and refinements for imperative objects. In: International Workshop on Foundations and Developments of Object-Oriented Languages, FOOL (2006)

    Google Scholar 

  34. Siek, J.G., Taha, W.: Gradual Typing for Objects. In: Bateni, M. (ed.) ECOOP 2007. LNCS, vol. 4609, pp. 2–27. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  35. Siek, J.G., Vachharajani, M.: Gradual typing with unification-based inference. In: Dynamic Languages Symposium (July 2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Oviedo, Calvo Sotelo s/n, 33007, Oviedo, Spain

    Francisco Ortin & Miguel Garcia

Authors
  1. Francisco Ortin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miguel Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Systems and Informatics, INSTICC / IPS, Rua do Vale de Chaves, Estefanilha, 2910-761, Setúbal, Portugal

    José Cordeiro

  2. Department of Informatics, University of Piraeus, 80 Karaoli & Dimitriou St., 18534, Piraeus, Greece

    Maria Virvou

  3. IICREST, P.O. Box 104, 1618, Sofia, Bulgaria

    Boris Shishkov

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ortin, F., Garcia, M. (2013). A Programming Language That Combines the Benefits of Static and Dynamic Typing. In: Cordeiro, J., Virvou, M., Shishkov, B. (eds) Software and Data Technologies. ICSOFT 2010. Communications in Computer and Information Science, vol 170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29578-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29578-2_5

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics