ACM SIGPLAN Symposium/Workshop on Haskell最新文献_第10页

Running the manual: an approach to high-assurance microkernel development 运行手册:一种高保证微内核开发的方法

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159850

Philip Derrin, Kevin Elphinstone, G. Klein, David A. Cock, M. Chakravarty

引用次数: 50

A generic recursion toolbox for Haskell or: scrap your boilerplate systematically 用于Haskell的通用递归工具箱:系统地废弃您的样板文件

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159845

Deling Ren, Martin Erwig

{"title":"A generic recursion toolbox for Haskell or: scrap your boilerplate systematically","authors":"Deling Ren, Martin Erwig","doi":"10.1145/1159842.1159845","DOIUrl":"https://doi.org/10.1145/1159842.1159845","url":null,"abstract":"Haskell programmers who deal with complex data types often need to apply functions to specific nodes deeply nested inside of terms. Typically, implementations for those applications require so-called boilerplate code, which recursively visits the nodes and carries the functions to the places where they need to be applied. The scrap-your-boilerplate approach proposed by Lämmel and Peyton Jones tries to solve this problem by defining a general traversal design pattern that performs the traversal automatically so that the programmers can focus on the code that performs the actual transformation.In practice we often encounter applications that require variations of the recursion schema and call for more sophisticated generic traversals. Defining such traversals from scratch requires a profound understanding of the underlying mechanism and is everything but trivial.In this paper we analyze the problem domain of recursive traversal strategies, by integrating and extending previous approaches. We then extend the scrap-your-boilerplate approach by rich traversal strategies and by a combination of transformations and accumulations, which leads to a comprehensive recursive traversal library Reclib in a statically typed framework.We define a two-layer library targeted at general programmers and programmers with knowledge in traversal strategies. The highlevel interface defines a universal combinator that can be customized to different one-pass traversal strategies with different coverage and different traversal order. The lower-layer interface provides a set of primitives that can be used for defining more sophisticated traversal strategies such as fixpoint traversals. The interfaceis simple and succinct. Like the original scrap-your-boilerplate approach, it makes use of rank-2 polymorphism and functional dependencies, implemented in GHC.","PeriodicalId":188691,"journal":{"name":"ACM SIGPLAN Symposium/Workshop on Haskell","volume":"556 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116398953","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

User-level transactional programming in Haskell Haskell中的用户级事务编程

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159853

Peter Thiemann

引用次数: 0

Interactive debugging with GHCi 使用GHCi进行交互调试

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159855

David Himmelstrup

引用次数: 5

RepLib: a library for derivable type classes 一个可派生类型类的库

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159844

Stephanie Weirich

引用次数: 57

Extended static checking for haskell 扩展了haskell的静态检查

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159849

Dana N. Xu

引用次数: 39

An extensible dynamically-typed hierarchy of exceptions 一个可扩展的动态类型异常层次结构

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159854

S. Marlow

引用次数: 17

Strongly typed memory areas programming systems-level data structures in a functional language 用函数式语言编写系统级数据结构的强类型内存区域

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159851

Iavor S. Diatchki, Mark P. Jones

{"title":"Strongly typed memory areas programming systems-level data structures in a functional language","authors":"Iavor S. Diatchki, Mark P. Jones","doi":"10.1145/1159842.1159851","DOIUrl":"https://doi.org/10.1145/1159842.1159851","url":null,"abstract":"Modern functional languages offer several attractive features to support development of reliable and secure software. However, in our efforts to use Haskell for systems programming tasks-including device driver and operating system construction-we have also encountered some significant gaps in functionality. As a result, we have been forced, either to code some non-trivial components in more traditional but unsafe languages like C or assembler, or else to adopt aspects of the foreign function interface that compromise on strong typing and type safety.In this paper, we describe how we have filled one of these gaps by extending a Haskell-like language with facilities for working directly with low-level, memory-based data structures. Using this extension, we are able to program a wide range of examples, including hardware interfaces, kernel data structures, and operating system APIs. Our design allows us to address concerns about representation, alignment, and placement (in virtual or physical address spaces) that are critical in some systems applications, but clearly beyond the scope of most existing functional languages.Our approach leverages type system features that are wellknown and widely supported in existing Haskell implementations, including kinds, multiple parameter type classes, functional dependencies, and improvement. One interesting feature is the use of a syntactic abbreviation that makes it easy to define and work with functions at the type level.","PeriodicalId":188691,"journal":{"name":"ACM SIGPLAN Symposium/Workshop on Haskell","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114217662","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}

引用次数: 23

GenI: natural language generation in Haskell GenI: Haskell中的自然语言生成

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159858

Eric Kow

引用次数: 6

Strong types for relational databases 关系数据库的强类型

ACM SIGPLAN Symposium/Workshop on Haskell Pub Date : 2006-09-17 DOI: 10.1145/1159842.1159846

Alexandra Silva, Joost Visser

{"title":"Strong types for relational databases","authors":"Alexandra Silva, Joost Visser","doi":"10.1145/1159842.1159846","DOIUrl":"https://doi.org/10.1145/1159842.1159846","url":null,"abstract":"Haskell's type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the level of types. This emergent capability has been exploited for instance to model arbitrary-length tuples (heterogeneous lists), extensible records, functions with variable length argument lists, and (homogenous) lists of statically fixed length (vectors).We explain how type-level programming can be exploited to define a strongly-typed model of relational databases and operations on them. In particular, we present a strongly typed embedding of a significant subset of SQL in Haskell. In this model, meta-data is represented by type-level entities that guard the semantic correctness of database operations at compile time.Apart from the standard relational database operations, such as selection and join, we model functional dependencies (among table attributes), normal forms, and operations for database transformation. We show how functional dependency information can be represented at the type level, and can be transported through operations. This means that type inference statically computes functional dependencies on the result from those on the arguments.Our model shows that Haskell can be used to design and prototype typed languages for designing, programming, and transforming relational databases.","PeriodicalId":188691,"journal":{"name":"ACM SIGPLAN Symposium/Workshop on Haskell","volume":"327 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114963210","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}

引用次数: 15