Proceedings of the 18th ACM SIGPLAN international conference on Functional programming最新文献_第9页

ReCaml: execution state as the cornerstone of reconfigurations ReCaml:作为重新配置基石的执行状态

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2010-09-27 DOI: 10.1145/1863543.1863550

J. Buisson, F. Dagnat

{"title":"ReCaml: execution state as the cornerstone of reconfigurations","authors":"J. Buisson, F. Dagnat","doi":"10.1145/1863543.1863550","DOIUrl":"https://doi.org/10.1145/1863543.1863550","url":null,"abstract":"To fix bugs or to enhance a software system without service disruption, one has to update it dynamically during execution. Most prior dynamic software updating techniques require that the code to be changed is not running at the time of the update. However, this restriction precludes any change to the outermost loops of servers, OS scheduling loops and recursive functions. Permitting a dynamic update to more generally manipulate the program's execution state, including the runtime stack, alleviates this restriction but increases the likelihood of type errors. In this paper we present ReCaml, a language for writing dynamic updates to running programs that views execution state as a delimited continuation. ReCaml includes a novel feature for introspecting continuations called match_cont which is sufficiently powerful to implement a variety of updating policies. We have formalized the core of ReCaml and proved it sound (using the Coq proof assistant), thus ensuring that state-manipulating updates preserve type-safe execution of the updated program. We have implemented ReCaml as an extension to the Caml bytecode interpreter and used it for several examples.","PeriodicalId":20504,"journal":{"name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","volume":"40 1","pages":"27-38"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88891965","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}

引用次数: 10

Functional parallel algorithms 函数并行算法

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2010-09-27 DOI: 10.1145/1863543.1863579

G. Blelloch

{"title":"Functional parallel algorithms","authors":"G. Blelloch","doi":"10.1145/1863543.1863579","DOIUrl":"https://doi.org/10.1145/1863543.1863579","url":null,"abstract":"Functional programming presents several important advantages in the design, analysis and implementation of parallel algorithms: It discourages iteration and encourages decomposition. It supports persistence and hence easy speculation. It encourages higher-order aggregate operations. It is well suited for defining cost models tied to the programming language rather than the machine. Implementations can avoid false sharing. Implementations can use cheaper weak consistency models. And most importantly, it supports safe deterministic parallelism.\u0000 In fact functional programming supports a level of abstraction in which parallel algorithms are often as easy to design and analyze as sequential algorithms. The recent widespread advent of parallel machines therefore presents a great opportunity for functional programming languages. However, any changes will require significant education at all levels and involvement of the functional programming community.\u0000 In this talk I will discuss an approach to designing and analyzing parallel algorithms in a strict functional and fully deterministic setting. Key ideas include a cost model defined in term of analyzing work and span, the use of divide-and-conquer and contraction, the need for arrays (immutable) to achieve asymptotic efficiency, and the power of (deterministic) randomized algorithms. These are all ideas I believe can be taught at any level.","PeriodicalId":20504,"journal":{"name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","volume":"132 1","pages":"247-248"},"PeriodicalIF":0.0,"publicationDate":"2010-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82221489","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}

引用次数: 3

Experience report: Haskell as a reagent: results and observations on the use of Haskell in a python project 经验报告:Haskell作为试剂:在python项目中使用Haskell的结果和观察

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2010-09-27 DOI: 10.1145/1863543.1863595

Iustin Pop

引用次数: 8

Parametricity and dependent types 参数化和依赖类型

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2010-09-27 DOI: 10.1145/1863543.1863592

Jean-Philippe Bernardy, Patrik Jansson, R. Paterson

引用次数: 61

Scrapping your inefficient engine: using partial evaluation to improve domain-specific language implementation 抛弃低效的引擎:使用部分求值来改进特定于领域的语言实现

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2010-09-27 DOI: 10.1145/1863543.1863587

Edwin C. Brady, K. Hammond

引用次数: 26

Abstracting abstract machines 抽象机器

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2010-07-26 DOI: 10.1145/1863543.1863553

David Van Horn, M. Might

引用次数: 89

Experience report: Haskell in the 'real world': writing a commercial application in a lazy functional lanuage 经验报告:“真实世界”中的Haskell:用一种懒惰的函数式语言编写商业应用程序

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2009-08-31 DOI: 10.1145/1596550.1596578

Curt J. Sampson

引用次数: 7

Partial memoization of concurrency and communication 并发性和通信的部分记忆

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2009-08-31 DOI: 10.1145/1596550.1596575

Lukasz Ziarek, K. Sivaramakrishnan, S. Jagannathan

{"title":"Partial memoization of concurrency and communication","authors":"Lukasz Ziarek, K. Sivaramakrishnan, S. Jagannathan","doi":"10.1145/1596550.1596575","DOIUrl":"https://doi.org/10.1145/1596550.1596575","url":null,"abstract":"Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument v yields result r, a subsequent call to f with v can be immediately reduced to r without the need to re-evaluate f's body. Understanding memoization in the presence of concurrency and communication is significantly more challenging. For example, if f communicates with other threads, it is not sufficient to simply record its input/output behavior; we must also track inter-thread dependencies induced by these communication actions. Subsequent calls to f can be elided only if we can identify an interleaving of actions from these call-sites that lead to states in which these dependencies are satisfied. Similar issues arise if f spawns additional threads. In this paper, we consider the memoization problem for a higher-order concurrent language whose threads may communicate through synchronous message-based communication. To avoid the need to perform unbounded state space search that may be necessary to determine if all communication dependencies manifest in an earlier call can be satisfied in a later one, we introduce a weaker notion of memoization called partial memoization that gives implementations the freedom to avoid performing some part, if not all, of a previously memoized call. To validate the effectiveness of our ideas, we consider the benefits of memoization for reducing the overhead of recomputation for streaming, server-based, and transactional applications executed on a multi-core machine. We show that on a variety of workloads, memoization can lead to substantial performance improvements without incurring high memory costs.","PeriodicalId":20504,"journal":{"name":"Proceedings of the 18th ACM SIGPLAN international conference on Functional programming","volume":"129 1","pages":"161-172"},"PeriodicalIF":0.0,"publicationDate":"2009-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76778468","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}

引用次数: 17

Automatically RESTful web applications: marking modular serializable continuations 自动RESTful web应用程序:标记模块化可序列化的延续

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2009-08-31 DOI: 10.1145/1596550.1596594

J. McCarthy

引用次数: 10

Experience report: using objective caml to develop safety-critical embedded tools in a certification framework 经验报告:在认证框架中使用客观的caml开发安全关键的嵌入式工具

Proceedings of the 18th ACM SIGPLAN international conference on Functional programming Pub Date : 2009-08-31 DOI: 10.1145/1596550.1596582

B. Pagano, O. Andrieu, Thomas Moniot, Benjamin Canou, E. Chailloux, Philippe Wang, Pascal Manoury, Jean-Louis Colaço

引用次数: 22