Proceedings of the 10th ACM Symposium on Dynamic languages最新文献_第2页

Why do we know so little about programming languages, and what would have happened if we had known more? 为什么我们对编程语言了解得如此之少?如果我们了解得更多，又会发生什么呢?

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

Stefan Hanenberg

{"title":"Why do we know so little about programming languages, and what would have happened if we had known more?","authors":"Stefan Hanenberg","doi":"10.1145/2775052.2661102","DOIUrl":"https://doi.org/10.1145/2775052.2661102","url":null,"abstract":"Programming language research in the last decades was mainly driven by mathematical methods (such as formal semantics, correctness proofs, type soundness proofs, etc.) or run-time arguments based on benchmark tests. This happened despite the frequent discussion over programming language usability. We have now been through decade after decade of one language after another domainating the field, forcing companies to switch languages and migrate libraries. Now that Javascript seems to be the next language to dominate, people start to ask old questions anew. The first goal of this talk is to discuss why the application of empirical methods is (still) relatively rare in PL research, and to discuss what could be done in empirical methods to make them a substantial part of PL research. The second goal is to speculate about the possible effects that concrete empirical knowledge could have had on the programming language community. For example, what would have happened to programming languages if current knowledge would have been available 30 years ago? What if knowledge about programming languages from the year 2050 would be available today?","PeriodicalId":244838,"journal":{"name":"Proceedings of the 10th ACM Symposium on Dynamic languages","volume":"104 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":"115318112","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}

引用次数: 2

Scriptable operating systems with Lua 使用Lua编写脚本的操作系统

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

Lourival Vieira Neto, R. Ierusalimschy, A. Moura, M. Balmer

引用次数: 8

Object versioning to support recovery needs: using proxies to preserve previous development states in lively 支持恢复需求的对象版本控制:使用代理保存以前的动态开发状态

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

Bastian Steinert, L. Thamsen, T. Felgentreff, R. Hirschfeld

引用次数: 4

Sweeten your JavaScript: hygienic macros for ES5 为ES5添加JavaScript:卫生宏

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

Tim Disney, Nathan Faubion, David Herman, C. Flanagan

引用次数: 17

Abstracting abstract control 抽象控制

Proceedings of the 10th ACM Symposium on Dynamic languages Pub Date : 2013-05-14 DOI: 10.1145/2661088.2661098

Dionna Glaze, David Van Horn

{"title":"Abstracting abstract control","authors":"Dionna Glaze, David Van Horn","doi":"10.1145/2661088.2661098","DOIUrl":"https://doi.org/10.1145/2661088.2661098","url":null,"abstract":"The strength of a dynamic language is also its weakness: run-time flexibility comes at the cost of compile-time predictability. Many of the hallmarks of dynamic languages such as closures, continuations, various forms of reflection, and a lack of static types make many programmers rejoice, while compiler writers, tool developers, and verification engineers lament. The dynamism of these features simply confounds statically reasoning about programs that use them. Consequently, static analyses for dynamic languages are few, far between, and seldom sound. The \"abstracting abstract machines\" (AAM) approach to constructing static analyses has recently been proposed as a method to ameliorate the difficulty of designing analyses for such language features. The approach, so called because it derives a function for the sound and computable approximation of program behavior starting from the abstract machine semantics of a language, provides a viable approach to dynamic language analysis since all that is required is a machine description of the interpreter. The AAM recipe as originally described produces finite state abstractions: the behavior of a program is approximated as a finite state machine. Such a model is inherently imprecise when it comes to reasoning about the control stack of the interpreter: a finite state machine cannot faithfully represent a stack. Recent advances have shown that higher-order programs can be approximated with pushdown systems. However, such models, founded in automata theory, either breakdown or require significant engineering in the face of dynamic language features that inspect or modify the control stack. In this paper, we tackle the problem of bringing pushdown flow analysis to the domain of dynamic language features. We revise the abstracting abstract machines technique to target the stronger computational model of pushdown systems. In place of automata theory, we use only abstract machines and memoization. As case studies, we show the technique applies to a language with closures, garbage collection, stack-inspection, and first-class composable continuations.","PeriodicalId":244838,"journal":{"name":"Proceedings of the 10th ACM Symposium on Dynamic languages","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129500316","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}

引用次数: 34