Proceedings of the 31st Symposium on Implementation and Application of Functional Languages最新文献

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages 第31届函数式语言实现与应用学术研讨会论文集

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932

引用次数: 0

A symbolic execution semantics for TopHat TopHat的符号执行语义

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412933

N. Naus, Tim Steenvoorden, M. Klinik

引用次数: 5

A trustworthy framework for resource-aware embedded programming 一个值得信赖的框架，用于资源感知嵌入式编程

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412944

Adam D. Barwell, Christopher Brown

{"title":"A trustworthy framework for resource-aware embedded programming","authors":"Adam D. Barwell, Christopher Brown","doi":"10.1145/3412932.3412944","DOIUrl":"https://doi.org/10.1145/3412932.3412944","url":null,"abstract":"Systems with non-functional requirements, such as Energy, Time and Security (ETS), are of increasing importance due to the proliferation of embedded devices with limited resources such as drones, wireless sensors, and tablet computers. Currently, however, there are little to no programmer supported methodologies or frameworks to allow them to reason about ETS properties in their source code. Drive is one such existing framework supporting the developer by lifting non-functional properties to the source-level through the Contract Specification Language (CSL), allowing non-functional properties to be first-class citizens, and supporting programmer-written code-level contracts to guarantee the non-functional specifications of the program are met. In this paper, we extend the Drive system by providing rigorous implementations of the underlying proof-engine, modeling the specification of the annotations and assertions from CSL for a representative subset of C, called Imp. We define both an improved abstract interpretation that automatically derives proofs of assertions, and define inference algorithms for the derivation of both abstract interpretations and the context over which the interpretation is indexed. We use the dependently-typed programming language, Idris, to give a formal definition, and implementation, of our abstract interpretation. Finally, we show our well-formed abstract interpretation over some representative exemplars demonstrating provable assertions of ETS.","PeriodicalId":235054,"journal":{"name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134057135","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

A space-efficient call-by-value virtual machine for gradual set-theoretic types 渐进集合论类型的空间高效按值调用虚拟机

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412940

Giuseppe Castagna, G. Duboc, V. Lanvin, Jeremy G. Siek

引用次数: 3

Deriving compositional random generators 生成组合随机生成器

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412943

Agustín Mista, Alejandro Russo

引用次数: 3

Mystery functions: making specifications, unit tests, and implementations coexist in the mind of undergraduate students 神秘的功能:制定规范、单元测试和实现在本科生的脑海中共存

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412934

O. Danvy

{"title":"Mystery functions: making specifications, unit tests, and implementations coexist in the mind of undergraduate students","authors":"O. Danvy","doi":"10.1145/3412932.3412934","DOIUrl":"https://doi.org/10.1145/3412932.3412934","url":null,"abstract":"This article documents how to make the concepts of specification, properties of specifications, unit tests, soundness of unit tests, implementation, and satisfaction coexist correctly, harmoniously, and effectively in the mind of undergraduate students, using an off-the-shelf proof assistant. The concepts are instilled through a family of puzzles: given the specification of a mystery function (i.e., conditions this function should satisfy), which functions---if any---satisfy this specification? Each puzzle is solved using a combination of informal induction (as in machine learning), structural recursion (to implement the function), and formal induction (to prove satisfaction), and in a consolidating way such that each concept has a place that makes sense, instead of being perceived as vague, alien, arbitrary, and irreproducible. The eureka moment that concludes each informal induction and the subsequent formal induction that confirms that the student was right make mystery functions rewarding, and repetition makes them addictive. Mystery functions can also be used as a vector for expansion as well as for reflection.","PeriodicalId":235054,"journal":{"name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125991078","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}

引用次数: 1

A new view on parser combinators 解析器组合子的新视图

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412938

P. Koopman, M. J. Plasmeijer

{"title":"A new view on parser combinators","authors":"P. Koopman, M. J. Plasmeijer","doi":"10.1145/3412932.3412938","DOIUrl":"https://doi.org/10.1145/3412932.3412938","url":null,"abstract":"Parser combinators offer a concise and fast way to produce reasonably efficient parsers. The combinator libraries themselves can be small and provide an elegant application of functional programming techniques. They are one of the success stories in functional programming that are also ported to many other languages. In this paper, we illustrate that we can make the parser combinators more general by modeling them as a tagless domain specific language. The idea is to replace the ordinary combinators by a set of type constructor classes. By making different implementations of this class we can assign various interpretations of one and the same grammar specification. The set of type classes makes the DSL type-safe and extendable without needing to change existing parts and implementations. This enables us to make multiple interpretations, views, of the specified grammar. In this paper we show views for deterministic parsing, nondeterministic parsing, generating possible parse trees produced by the grammar without needing the corresponding input, generating inputs accepted by the grammar, adapting the grammar rules such that the parser combinators can handle left-recursion and so on. This makes our multi-view parser combinators more powerful than the existing approaches.","PeriodicalId":235054,"journal":{"name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127562677","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

Type debugging with counter-factual type error messages using an existing type checker 使用现有类型检查器进行带有反事实类型错误消息的类型调试

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412939

Kanae Tsushima, O. Chitil, Joanna Sharrad

引用次数: 4

Lazy interworking of compiled and interpreted code for sandboxing and distributed systems 沙盒和分布式系统中编译和解释代码的惰性交互

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412941

Camil Staps, John H. G. van Groningen, M. J. Plasmeijer

{"title":"Lazy interworking of compiled and interpreted code for sandboxing and distributed systems","authors":"Camil Staps, John H. G. van Groningen, M. J. Plasmeijer","doi":"10.1145/3412932.3412941","DOIUrl":"https://doi.org/10.1145/3412932.3412941","url":null,"abstract":"More and more applications rely on the safe execution of code unknown at compile-time, for example in the implementation of web browsers and plugin systems. Furthermore, these applications usually require some form of communication between the added code and its embedder, and hence a communication channel must be set up in which values are serialized and deserialized. This paper shows that in a functional programming language we can solve these two problems at once, if we realize that the execution of extra code is nothing more than the deserialization of a value which happens to be a function. To demonstrate this, we describe the implementation of a serialization library for the language Clean, which internally uses an interpreter to evaluate added code in a separate, sandboxed environment. Remarkable is that despite the conceptual asymmetry between \"host\" and \"interpreter\", lazy interworking must be implemented in a highly symmetric fashion, much akin to distributed systems. The library interworks on a low level with the native Clean program, but has been implemented without any changes to the native runtime system. It can therefore easily be ported to other programming languages. We can use the same technique in the context of the web, where we want to be able to share possibly lazy values between a server and a client. In this case the interpreter runs in WebAssembly in the browser and communicates seamlessly with the server, written in Clean. We use this in the iTasks web framework to handle communication and offload computations to the client to reduce stress on the server-side. Previously, this framework cross-compiled the Clean source code to JavaScript and used JSON for communication. The interpreter has a more predictable and better performance, and integration is much simpler because it interworks on a lower level with the web server.","PeriodicalId":235054,"journal":{"name":"Proceedings of the 31st Symposium on Implementation and Application of Functional Languages","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125298510","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

Attribute grammars fly first-class... safer!: dealing with DSL errors in type-level programming 属性语法是一流的……更安全!:处理类型级编程中的DSL错误

Proceedings of the 31st Symposium on Implementation and Application of Functional Languages Pub Date : 2019-09-25 DOI: 10.1145/3412932.3412942

Juan García-Garland, Alberto Pardo, Marcos Viera

引用次数: 0