检索结果-内蒙古大学图书馆

9th international conference on functional programming

作者： Hinze, Ralf Univ Bonn Inst Informat 3 D-53117 Bonn Germany

A generic function is a function that can be instantiated on many data types to obtain data type specific functionality. Examples of generic functions are the functions that can be derived in Haskell, such as show, read, and '=='. the recent years have seen a number of proposals that support the definition of generic functions. Some of the proposals define new languages, some define extensions to existing languages. As a common characteristic none of the proposals can be made to work within Haskell 98: they all require something extra, either a more sophisticated type system or an additional language construct. the purpose of this paper is to show that one can, in fact, program generically within Haskell 98 obviating to some extent the need for fancy type systems or separate tools. Haskell's type classes are at the heart of this approach: they ensure that generic functions can be defined succinctly and, in particular, that they can be used painlessly. We detail three different implementations of generics both from a practical and from a theoretical perspective.

关键词： Generic programming Haskell 98 Type classes

来源：评论

学校读者我要写书评

暂无评论

Down with Emacs Lisp: Dynamic scope analysis 01

Down with Emacs Lisp: Dynamic scope analysis

引用

6th international conference on functional programming (ICFP 2001)

作者： Neubauer, M Sperber, M Univ Freiburg Inst Informat D-7800 Freiburg Germany Univ Tubingen Wilhelm Schickard Inst Informat D-72074 Tubingen Germany

ISBN: (纸本)9781581134155

It is possible to translate code written in Emacs Lisp or another Lisp dialect which uses dynamic scoping to a more modern programming language with lexical scoping while largely preserving structure and readability of the code. the biggest obstacle to such an idiomatic translation from Emacs Lisp is the translation of dynamic binding into suitable instances of lexical binding: Many binding constructs in real programs in fact exhibit identical behavior under both dynamic and lexical binding. An idiomatic translation needs to detect as many of these binding constructs as possible and convert them into lexical binding constructs in the target language to achieve readability and efficiency of the target code. the basic prerequisite for such an idiomatic translation is thus a dynamic scope analysis which associates variable occurrences with binding constructs. We present such an analysis. It is an application of the Nielson/Nielson framework for flow analysis to a semantics for dynamic binding akin to Moreau's. Its implementation handles a substantial portion of Emacs Lisp, has been applied to realistic Emacs Lisp code, and is highly accurate and reasonably efficient in practice.

关键词： LISP (programming language)

来源：评论

学校读者我要写书评

暂无评论

Experience report: Using functional programming to manage a Linux distribution

引用

acm sigplan NOTICES 2007年第9期42卷 213-218页

作者： Beshers, Clifford Fox, David Shaw, Jeremy Linspire Inc.

We report on our experience using functional programming languages in the development of a commercial GNU/Linux distribution, discussing features of several significant systems: hardware detection and system configuration;OS installer CD creation;package compilation and management. Static typing helps compensate for the lack of a complete testing lab and helps us be effective with a very small team. Most importantly, we believe that going beyond merely using functional languages to using purely functional designs really helps to create simple, effective tools. © 2007 acm.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Forge: Generating a High Performance DSL Implementation from a Declarative Specification 13

Forge: Generating a High Performance DSL Implementation from...

引用

12th international conference on Generative programming: Concepts and Experiences

作者： Sujeeth, Arvind K. Gibbons, Austin Brown, Kevin J. Lee, HyoukJoong Rompf, Tiark Odersky, Martin Olukotun, Kunle Stanford Univ Stanford CA 94305 USA Oracle Labs Columbus OH USA Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781450323734

Domain-specific languages provide a promising path to automatically compile high-level code to parallel, heterogeneous, and distributed hardware. However, in practice high performance DSLs still require considerable software expertise to develop and force users into tool-chains that hinder prototyping and debugging. To address these problems, we present Forge, a new meta DSL for declaratively specifying high performance embedded DSLs. Forge provides DSL authors with high-level abstractions (e.g., data structures, parallel patterns, effects) for specifying their DSL in a way that permits high performance. From this high-level specification, Forge automatically generates both a naive Scala library implementation of the DSL and a high performance version using the Delite DSL framework. Users of a Forge-generated DSL can prototype their application using the library version, and then switch to the Delite version to run on multicore CPUs, GPUs, and clusters without changing the application code. Forge-generated Delite DSLs perform within 2x of hand-optimized C++ and up to 40x better than Spark, an alternative high-level distributed programming environment. Compared to a manually implemented Delite DSL, Forge provides a factor of 3-6x reduction in lines of code and does not sacrifice any performance. Furthermore, Forge specifications can be generated from existing Scala libraries, are easy to maintain, shield DSL developers from changes in the Delite framework, and enable DSLs to be retargeted to other frameworks transparently.

关键词： Code Generation Multi-Stage programming Domain-Specific Languages Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Rhine: FRP with Type-Level Clocks 11

Rhine: FRP with Type-Level Clocks

引用

Haskell conference

作者： Baerenz, Manuel Perez, Ivan Univ Wien Math Fak Vienna Austria NIA Hampton VA USA

ISBN: (纸本)9781450358354

Processing data at different rates is generally a hard problem in reactive programming. Buffering problems, lags, and concurrency issues often occur. Many of these problems are clock errors, where data at different rates is combined incorrectly. Techniques to avoid clock errors, such as type-level clocks and deterministic scheduling, exist in the field of synchronous programming, but are not implemented in general-purpose languages like Haskell. Rhine is a clock-safe library for synchronous and asynchronous functional Reactive programming (FRP). It separates the aspects of clocking, scheduling and resampling from each other, and ensures clock-safety at the type level. Concurrent communication is encapsulated safely. Diverse reactive subsystems can be combined in a coherent, declarative data-flow framework, while correct interoperability of data at different rates is guaranteed by type-level clocks. this provides a general-purpose framework that simplifies multi-rate FRP systems and can be used for game development, media applications, GUIs and embedded systems, through a flexible API with many reusable components.

关键词： functional reactive programming haskell reactive programming asynchronous programming

来源：评论

学校读者我要写书评

暂无评论

***: Declarative HTML 21

***: Declarative HTML

引用

5th international conference on the Art, Science, and Engineering of programming (programming)

作者： Reynders, Bob Choi, Kwanghoon Chonnam Natl Univ Gwangju South Korea

ISBN: (纸本)9781450389860

Interactive user experiences on the web are becoming the norm. Client-side programs are becoming more complicated and have to deal with event handling, reading HTML document state and updating the interface. In this paper we propose a declarative language that supports these three facets of client-side browser development declaratively and provides a programming model where complex interfaces can be written using simple programming techniques such as records, functions and recursion.

关键词： Web programming functional programming HTML DSL

来源：评论

学校读者我要写书评

暂无评论

Computing with subspaces 07

Computing with subspaces

引用

9th international acm sigplan conference on Principles and Practice of Declarative programming, PPDP'07

作者： Antoy, Sergio Braßel, Bernd Computer Science Department Portland State University P.O. Box 751 Portland OR 97207 United States Institute of Computer Science Christian-Albrechts-University of Kiel Olshausenstr. 40 D-24098 Kiel Germany

ISBN: (纸本)1595937692

We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restricts the validity of the argument of getAllValues. this restriction ensures that essential language features like the call-time choice semantics, the independence of the order of evaluation, and the referential transparency of the language are preserved when getAllValues is executed. Up to now, conflicts between these language features and primitives like getAllValues have been seen as one of the main problems for employing such primitives in functional logic languages. Copyright © 2007 acm.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Iterative-free program analysis

Iterative-free program analysis

引用

8th international conference on functional programming (ICFP 03)

作者： Ogawa, M Hu, ZJ Sasano, I Japan Adv. Inst. of Sci. and Technol Ishikawa Japan The University of Tokyo Tokyo Japan Japan Science and Technology Corp. PRESTO Saitama Japan

Program analysis is the heart of modem compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed point is commonly computed through an iterative procedure that repeats tracing until convergence. this paper proposes a new method to analyze programs through recursive graph traversals instead of iterative procedures, based on the fact that most programs (without spaghetti GOTO) have well-structured control flow graphs, graphs with bounded tree width. Our main techniques are;an algebraic construction of a control flow graph, called SP Term, which enables control flow analysis to be defined in a natural recursive form, and the Optimization theorem, which enables us to compute optimal solution by dynamic programming. We illustrate our method with two examples;dead code detection and register allocation. Different from the traditional standard iterative solution, our dead code detection is described as a simple combination of bottom-up and top-down traversals on SP Term. Register allocation is more interesting, as it further requires optimality of the result. We show how the Optimization theorem on SP Terms works to find an optimal register allocation as a certain dynamic programming.

关键词： program analysis control flow graph register allocation tree width SP term dynamic programming catamorphism

来源：评论

学校读者我要写书评

暂无评论

Leveling up dependent types generic programming over a predicative hierarchy of universes

Leveling up dependent types generic programming over a predi...

引用

2013 acm sigplan Workshop on Dependently-Typed programming, DTP 2013, Co-located with the 18th international conference on functional programming, ICFP 2013

作者： Diehl, Larry Sheard, Tim Portland State University United States

ISBN: (纸本)9781450323840

Generic programming is about writing a single function that does something different for each type. In most languages one cannot case over the structure of types. So in such languages generic programming is accomplished by defining a universe, a data structure isomorphic to some subset of the types supported by the language, and performing a case analysis over this datatype instead. Such functions support a limitied level of genericity, limited to the subset of types that the universe encodes. the key to full genericity is defining a rich enough universe to encode all types in the language. In this paper we show how to define a universe with a predicative hierarchy of types, encoding a finite set of base types (including dependent products and sums), and an infinite set of user defined datatypes. We demonstrate that such a system supports a much broader notion of generic programming, along with a serendipitous extension to the usefulness of user defined datatypes with existential arguments. © 2013 by the Association for Computing Machinery, Inc. (acm).

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Space profiling for parallel functional programs

引用

JOURNAL OF functional programming 2010年第5-6期20卷 417-461页

作者： Spoonhower, Daniel Blelloch, Guy E. Harper, Robert Gibbons, Phillip B. Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA Intel Labs Pittsburgh Pittsburgh PA 15213 USA

We present a semantic space profiler for parallel functional programs. Building on previous work in sequential profiling, our tools help programmers to relate runtime resource use back to program source code. Unlike many profiling tools, our profiler is based on a cost semantics. this provides a means to reason about performance without requiring a detailed understanding of the compiler or runtime system. It also provides a specification for language implementers. this is critical in that it enables us to separate cleanly the performance of the application from that of the language implementation. Some aspects of the implementation can have significant effects on performance. Our cost semantics enables programmers to understand the impact of different scheduling policies while hiding many of the details of their implementations. We show applications where the choice of scheduling policy has asymptotic effects on space use. We explain these use patterns through a demonstration of our tools. We also validate our methodology by observing similar performance in our implementation of a parallel extension of Standard ML.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：