Proceedings of the 10th ACM Symposium on Dynamic languages最新文献

Proceedings of the 10th ACM Symposium on Dynamic languages 第10届美国计算机学会动态语言研讨会论文集

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-20 DOI: 10.1145/2661088

A. Black, L. Tratt

{"title":"Proceedings of the 10th ACM Symposium on Dynamic languages","authors":"A. Black, L. Tratt","doi":"10.1145/2661088","DOIUrl":"https://doi.org/10.1145/2661088","url":null,"abstract":"The 10th Dynamic Languages Symposium (DLS) at SPLASH 2014 is the premier forum for researchers and practitioners to share knowledge and research on dynamic languages, their implementation, and applications. The influence of dynamic languages -- from Lisp to Smalltalk to Python to Javascript -- on real-world practice and research continues to grow. \u0000 \u0000This year DLS received 28 high quality submissions, of which 13 have been accepted for presentation. The Program Committee were active in their discussions, not only selecting good papers but helping those papers improve via the two-round process employed this year. We believe many papers benefited from this process. However, that this year's DLS has accepted more papers than any previous year is more directly a consequence of the high quality submissions we received. Research in this area is at its most active for many years, and the volume and quality of outputs reflects that. \u0000 \u0000We are lucky this year to have an intriguing invited talk from Stefan Hanenberg, which will be followed by technical sessions. There is surely something in the list of accepted papers for everyone with an interest in dynamic languages!","PeriodicalId":244838,"journal":{"name":"Proceedings of the 10th ACM Symposium on Dynamic languages","volume":"30 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127056875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Dynamic detection of object capability violations through model checking 通过模型检查动态检测对象能力违例

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661099

Dustin Rhodes, Tim Disney, C. Flanagan

引用次数: 3

Using JavaScript and WebCL for numerical computations: a comparative study of native and web technologies 使用JavaScript和WebCL进行数值计算:原生技术和web技术的比较研究

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661090

Faiz Khan, Vincent Foley-Bourgon, Sujay Kathrotia, Erick Lavoie, L. Hendren

引用次数: 35

On the use of type predicates in object-oriented software: the case of smalltalk 论面向对象软件中类型谓词的使用:以smalltalk为例

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661091

Oscar Callaú, R. Robbes, É. Tanter, David Röthlisberger, Alexandre Bergel

{"title":"On the use of type predicates in object-oriented software: the case of smalltalk","authors":"Oscar Callaú, R. Robbes, É. Tanter, David Röthlisberger, Alexandre Bergel","doi":"10.1145/2661088.2661091","DOIUrl":"https://doi.org/10.1145/2661088.2661091","url":null,"abstract":"Object-orientation relies on polymorphism to express behavioral variants. As opposed to traditional procedural design, explicit type-based conditionals should be avoided. This message is conveyed in introductory material on object orientation, as well as in object-oriented reengineering patterns. Is this principle followed in practice? In other words, are type predicates actually used in object-oriented software, and if so, to which extent? Answering these questions will assist practitioners and researchers with providing information about the state of the practice, and informing the active research program of retrofitting type systems, clarifying whether complex flow-sensitive typing approaches are necessary. Other areas, such as refactoring and teaching object orientation, can also benefit from empirical evidence on the matter. We report on a study of the use of type predicates in a large base of over 4 million lines of Smalltalk code. Our study shows that type predicates are in fact widely used to do explicit type dispatch, suggesting that flow-sensitive typing approaches are necessary for a type system retrofitted for a dynamic object-oriented language.","PeriodicalId":244838,"journal":{"name":"Proceedings of the 10th ACM Symposium on Dynamic languages","volume":"130 17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132702951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

SqueakJS: a modern and practical smalltalk that runs in any browser SqueakJS:一个现代和实用的聊天工具，可以在任何浏览器中运行

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661100

B. Freudenberg, D. Ingalls, T. Felgentreff, Tobias Pape, R. Hirschfeld

引用次数: 13

Dynamic page sharing optimization for the R language R语言的动态页面共享优化

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661094

Helena Kotthaus, Ingo Korb, M. Engel, P. Marwedel

{"title":"Dynamic page sharing optimization for the R language","authors":"Helena Kotthaus, Ingo Korb, M. Engel, P. Marwedel","doi":"10.1145/2661088.2661094","DOIUrl":"https://doi.org/10.1145/2661088.2661094","url":null,"abstract":"Dynamic languages such as R are increasingly used to process .large data sets. Here, the R interpreter induces a large memory overhead due to wasteful memory allocation policies. If an application's working set exceeds the available physical memory, the OS starts to swap, resulting in slowdowns of a several orders of magnitude. Thus, memory optimizations for R will be beneficial to many applications. Existing R optimizations are mostly based on dynamic compilation or native libraries. Both methods are futile when the OS starts to page out memory. So far, only a few, data-type or application specific memory optimizations for R exist. To remedy this situation, we present a low-overhead page sharing approach for R that significantly reduces the interpreter's memory overhead. Concentrating on the most rewarding optimizations avoids the high runtime overhead of existing generic approaches for memory deduplication or compression. In addition, by applying knowledge of interpreter data structures and memory allocation patterns, our approach is not constrained to specific R applications and is transparent to the R interpreter. Our page sharing optimization enables us to reduce the memory consumption by up to 53.5% with an average of 18.0% for a set of real-world R benchmarks with a runtime overhead of only 5.3% on average. In cases where page I/O can be avoided, significant speedups are achieved.","PeriodicalId":244838,"journal":{"name":"Proceedings of the 10th ACM Symposium on Dynamic languages","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115517524","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

ACDC-JS: explorative benchmarking of javascript memory management ACDC-JS: javascript内存管理的探索性基准测试

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661089

M. Aigner, Thomas Hütter, C. Kirsch, Alexander Miller, H. Payer, M. Preishuber

引用次数: 7

Design and evaluation of gradual typing for python python渐进式类型的设计与评价

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661101

Michael M. Vitousek, A. Kent, Jeremy G. Siek, J. Baker

{"title":"Design and evaluation of gradual typing for python","authors":"Michael M. Vitousek, A. Kent, Jeremy G. Siek, J. Baker","doi":"10.1145/2661088.2661101","DOIUrl":"https://doi.org/10.1145/2661088.2661101","url":null,"abstract":"Combining static and dynamic typing within the same language offers clear benefits to programmers. It provides dynamic typing in situations that require rapid prototyping, heterogeneous data structures, and reflection, while supporting static typing when safety, modularity, and efficiency are primary concerns. Siek and Taha (2006) introduced an approach to combining static and dynamic typing in a fine-grained manner through the notion of type consistency in the static semantics and run-time casts in the dynamic semantics. However, many open questions remain regarding the semantics of gradually typed languages. In this paper we present Reticulated Python, a system for experimenting with gradual-typed dialects of Python. The dialects are syntactically identical to Python 3 but give static and dynamic semantics to the type annotations already present in Python 3. Reticulated Python consists of a typechecker and a source-to-source translator from Reticulated Python to Python 3. Using Reticulated Python, we evaluate a gradual type system and three approaches to the dynamic semantics of mutable objects: the traditional semantics based on Siek and Taha (2007) and Herman et al. (2007) and two new designs. We evaluate these designs in the context of several third-party Python programs.","PeriodicalId":244838,"journal":{"name":"Proceedings of the 10th ACM Symposium on Dynamic languages","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116422021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 129

Contracts for domain-specific languages in Ruby Ruby中特定领域语言的契约

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661092

T. Stephen Strickland, Brianna M. Ren, Jeffrey S. Foster

{"title":"Contracts for domain-specific languages in Ruby","authors":"T. Stephen Strickland, Brianna M. Ren, Jeffrey S. Foster","doi":"10.1145/2661088.2661092","DOIUrl":"https://doi.org/10.1145/2661088.2661092","url":null,"abstract":"This paper concerns object-oriented embedded DSLs, which are popular in the Ruby community but have received little attention in the research literature. Ruby DSLs implement language keywords as implicit method calls to self; language structure is enforced by adjusting which object is bound to self in different scopes. While Ruby DSLs are powerful and elegant, they suffer from a lack of specification. In this paper, we introduce contracts for Ruby DSLs, which allow us to attribute blame appropriately when there are inconsistencies between an implementation and client. We formalize Ruby DSL contract checking in DSL, a core calculus that uses premethods with instance evaluation to enforce contracts. We then describe RDL, an implementation of Ruby DSL contracts. Finally, we present two tools that automatically infer RDL contracts: TypeInfer infers simple, type-like contracts based on observed method calls, and DSLInfer infers DSL keyword scopes and nesting by generating and testing candidate DSL usages based on initial examples. The type contracts generated by TypeInfer work well enough, though they are limited in precision by the small number of tests, while DSLInfer finds almost all DSL structure. Our goal is to help users understand a DSL from example programs.","PeriodicalId":244838,"journal":{"name":"Proceedings of the 10th ACM Symposium on Dynamic languages","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132685602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Typed objects in JavaScript JavaScript中的类型化对象

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2014-10-14 DOI: 10.1145/2661088.2661095

Nicholas D. Matsakis, David Herman, Dmitry Lomov

引用次数: 2