• DocumentCode
    661225
  • Title

    Method Lookup Simulation with a Gradual Typing Language

  • Author

    Allende, Esteban ; Fabry, Johan

  • Author_Institution
    PLEIAD Lab. Comput. Sci. Dept. (DCC), Univ. of Chile, Santiago, Chile
  • fYear
    2012
  • fDate
    12-16 Nov. 2012
  • Firstpage
    1
  • Lastpage
    8
  • Abstract
    Historically, programming languages have taken one of two positions with respect to types: static typing or dynamic typing. However, in recent years, there has been research on a third option: gradual typing. Gradual typing allows a developer to choose what parts of the application are statically typed or dynamically typed. Focusing on the aspect of optimizing applications, there is a particular procedure: method lookup, that is a target for optimization by VM developers when trying to provide better performance. To optimize gradually typed applications, we investigate the use of a hybrid method lookup strategy that separates callsites, i.e. places of method invocation, in two kinds: statically typed and dynamically typed. The goal of our work is to measure its performance in interpreters. To achieve our goal, we have carried out a simulation of method invocation. The simulation consisted of creating the callsites and related objects, simulating the invocations and finally measuring the time taken to accomplish the method lookup.
  • Keywords
    digital simulation; high level languages; program diagnostics; VM developers; application optimization; callsites; dynamic typing; gradual typing language; gradually typed applications; method invocation; method lookup simulation; programming languages; static typing; Computer languages; Optimization; Receivers; Runtime; Time measurement; Transient analysis; gradual typing; method lookup; performance;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Chilean Computer Science Society (SCCC), 2012 31st International Conference of the
  • Conference_Location
    Valparaiso
  • ISSN
    1522-4902
  • Print_ISBN
    978-1-4799-2937-5
  • Type

    conf

  • DOI
    10.1109/SCCC.2012.7
  • Filename
    6694066