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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

7 篇 会议
1 册 图书

馆藏范围

8 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

7 篇 工学
- 6 篇 计算机科学与技术...
- 5 篇 软件工程
- 1 篇 力学（可授工学、理...
- 1 篇 土木工程
- 1 篇 轻工技术与工程
2 篇 理学
- 2 篇 数学
- 1 篇 物理学

主题

2 篇 functional progr...
1 篇 vector spaces
1 篇 parallel program...
1 篇 logic programmin...
1 篇 functional progr...
1 篇 program compiler...
1 篇 differentiation ...
1 篇 congresses.

机构

1 篇 university of no...
1 篇 cwi
1 篇 department of co...
1 篇 universidad naci...
1 篇 department of co...
1 篇 heriot-watt univ...
1 篇 eötvös loránd un...
1 篇 faculty of mathe...
1 篇 institute for co...
1 篇 university of ke...

作者

1 篇 scholz sven-bodo
1 篇 vandenbroucke al...
1 篇 stutterheim jurr...
1 篇 thomsen michael ...
1 篇 díaz-caro alejan...
1 篇 plasmeijer rinus
1 篇 griffioen p.r.
1 篇 axelsen holger b...
1 篇 nilsson henrik
1 篇 piessens frank
1 篇 bracker jan
1 篇 gordon stuart
1 篇 achten peter
1 篇 schrijvers tom
1 篇 martínez lópez p...
1 篇 olaf chitil

语言

7 篇 英文
1 篇 中文

检索条件"任意字段=27th Symposium on the Implementation and Application of Functional Programming Languages, IFL 2015"

共 8 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Type inference for array programming with dimensioned vector spaces 15

Type inference for array programming with dimensioned vector...

引用

27th symposium on the implementation and application of functional programming languages, ifl 2015

作者： Griffioen, P.R. CWI Amsterdam Netherlands

ISBN: (纸本)9781450342735

Linear algebra operations are a typical application for array programming, but arrays are a more general data structure and not just used for numbers. this generality gives a lot of flexibility, but when numerical data structures like vectors and matrices are build from arrays, it is hard to infer properties like the shape statically, requiring costly out of bound checks to be done at runtime. We extend arrays with units of measurement, and Hindley-Milner typing with a matrix type based on the algebraic structure of units of measurement in matrices that allows type inference up to dimensioned vector spaces. the inference is sound and complete and gives the most general type of any linear algebra expression. Experiments show that the explicit support for linear algebra increases type safety, and that it leads to a more functional and index-free style of programming. It refines the types for linear algebra operators significantly, while the use of arrays as general containers has to be replaced by other data structures. As validation the matrix type system is implemented in the functional matrix language Pacioli. © 2015 ACM.

关键词： Vector spaces

来源：评论

学校读者我要写书评

暂无评论

Isomorphisms considered as equalities: Projecting functions and enhancing partial application through an implementation of λ+ 15

Isomorphisms considered as equalities: Projecting functions ...

引用

27th symposium on the implementation and application of functional programming languages, ifl 2015

作者： Díaz-Caro, Alejandro Martínez López, Pablo E. Universidad Nacional de Quilmes Roque Sáenz Peña 352 BernalBuenos Aires Argentina

ISBN: (纸本)9781450342735

We propose an implementation of λ+, a recently introduced simply typed lambda-calculus with pairs where isomorphic types are made equal. the rewrite system of λ+ is a rewrite system modulo an equivalence relation, which makes its implementation non-trivial. We also extend λ+ with natural numbers and general recursion and use Bekić's theorem to split mutual recursions. this splitting, together with the features of λ+, allows for a novel way of program transformation by reduction, by projecting a function before it is applied in order to simplify it. Also, currying together with the associativity and commutativity of pairs gives an enhanced form of partial application. © 2015, Association for Computing Machinery. All rights reserved.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

Polymonad programming in Haskell 15

Polymonad programming in Haskell

引用

27th symposium on the implementation and application of functional programming languages, ifl 2015

作者： Bracker, Jan Nilsson, Henrik University of Nottingham Nottingham United Kingdom

ISBN: (纸本)9781450342735

Polymonads were recently introduced by Hicks et al. as a unified approach to programming with different notions of monads. their work was mainly focused on foundational aspects of the approach. In this article, we show how to incorporate the notion of polymonads into Haskell, which is the first time this has been done in a full-scale language. In particular, we show how polymonads can be represented in Haskell, give a justification of the representation through proofs in Agda, and provide a plugin for the Glasgow Haskell Compiler (GHC) that enables their use in practice. Finally, we demonstrate the utility of our system by means of examples concerned with session types and the parameterized effect monad. this work provides a common representation of a number of existing approaches to generalized monads in Haskell. © 2015 ACM.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Fixing non-determinism 15

Fixing non-determinism

引用

27th symposium on the implementation and application of functional programming languages, ifl 2015

作者： Vandenbroucke, Alexander Schrijvers, Tom Piessens, Frank Department of Computer Science KU Leuven Belgium

ISBN: (纸本)9781450342735

Non-deterministic computations are conventionally modelled by lists of their outcomes. this approach provides a concise declarative description of certain problems, as well as a way of generically solving such problems. However, the traditional approach falls short when the non-deterministic problem is allowed to be recursive: the recursive problem may have infinitely many outcomes, giving rise to an infinite list. Yet there are usually only finitely many distinct relevant results. this paper shows that this set of interesting results corresponds to a least fixed point. We provide an implementation based on algebraic effect handlers to compute such least fixed points in a finite amount of time, thereby allowing non-determinism and recursion to meaningfully co-occur in a single program. © 2016 ACM.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Interpretation and programming of the reversible functional language RFUN 15

Interpretation and programming of the reversible functional ...

引用

27th symposium on the implementation and application of functional programming languages, ifl 2015

作者： thomsen, Michael Kirkedal Axelsen, Holger Bock Faculty of Mathematics and Computer Science University of Bremen Germany Department of Computer Science University of Copenhagen Denmark

ISBN: (纸本)9781450342735

RFUN is a small first-order reversible functional language introduced by Yokoyama et al. in 2012. the present paper aims to further the understanding of reversible functional programming (and RFUN in particular) by describing implementations in, and of, the RFUN language. After briefly summarizing RFUN in terms of syntax and semantics, we first (informally) describe a transformation from the simple irreversible first-order language FUN to RFUN. this highlights how irreversibility is avoided in RFUN, such as in the use of the so-called first-match policy. It also emphasizes the fact that RFUN is traceless, while also showing how the standard reversible (trace-full) embeddings of Landauer and Bennett can be implemented. Second, we outline (by examples) a number of the reversible functions that have been implemented in RFUN. the programming examples given here focus on Peano arithmetic and list functions, and are intended to show various useful programming techniques of the reversible functional programming paradigm. Finally, we discuss the implementation of RFUN. this is twofold as we relate a Haskell implementation of an RFUN interpreter, to an implementation of a self-interpreter, i.e., an RFUN interpreter implemented in RFUN. Although RFUN does not have the rich and expressive syntax of Haskell - which makes programming the selfinterpreter more cumbersome in some aspects - the built-in support for reverse execution greatly reduces the code base and makes the RFUN-based self-interpreter implementation follow the formal semantics of RFUN more directly than the Haskell-based interpreter. © 2015 Copyright held by the owner/author(s).

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Static and dynamic visualisations of monadic programs 15

Static and dynamic visualisations of monadic programs

引用

27th symposium on the implementation and application of functional programming languages, ifl 2015

作者： Stutterheim, Jurriën Achten, Peter Plasmeijer, Rinus Institute for Computing and Information Sciences Radboud University Nijmegen P.O. Box 9010 Nijmegen6500 GL Netherlands

ISBN: (纸本)9781450342735

iTasks is a shallowly embedded monadic domain-specific language written in the lazy, functional programming language Clean. It implements the Task-Oriented programming (TOP) paradigm. In TOP one describes, on a high level of abstraction, the tasks distributed collaborative systems and end users have to do. It results in a web application that is able to coordinate the work thus described. Even though iTasks is defined in the common notion of "tasks", for stake holders without programming experience, textual source code remains too difficult to understand. In previous work, we introduced Tonic (Task-Oriented Notation Inferred from Code) to graphically represent iTasks programs using blueprints. Blueprints are designed to bridge the gap between domain-expert and programmer. In this paper, we add the capability to graphically trace the dynamic behaviour of an iTasks program at run-time. this enables domain experts, managers, end users and programmers to follow and inspect the work as it is being executed. Using dynamic blueprints we can show, in real-time, who is working on what, which tasks are finished, which tasks are active, and what their parameters and results are. Under certain conditions we can predict which future tasks are reachable and which not. In a way, we have created a graphical tracing and debugging system for the TOP domain and have created the foundation for a tracing and debugging system for monads in general. Tracing and debugging is known to be hard to realize for lazy functional languages. In monadic contexts, however, the order of evaluation is well-defined, reducing the challenges Tonic needs to overcome. © 2015 ACM.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic adaptation of functional runtime systems through external control 15

Dynamic adaptation of functional runtime systems through ext...

引用

27th symposium on the implementation and application of functional programming languages, ifl 2015

作者： Gordon, Stuart Scholz, Sven-Bodo Heriot-Watt University United Kingdom

ISBN: (纸本)9781450342735

In this paper, we present a novel approach towards providing compiler generated runtime means for dynamic adaptation. the key novelty of the proposed solution is a complete separation between the runtime adaptation mechanism itself and the control mechanism of the adaptation. this strict separation has various benefits including experimentation with adaptation control mechanisms without modifying the runtime system itself, and opening up the possibility for control mechanisms that control several applications possibly even across different runtime systems. the paper does not only present the basic principles of the approach taken, it also describes our prototypical implementation in the context of the functional array programming language SaC. the dynamic adaptation we are concerned with in the context of this paper is an adaptation in the number of computing cores utilised during parallel execution on multiple cores. We show how this adaptation mechanism can be leveraged to deal with changes in the background load generated from other applications running concurrently with the application whose parallelism we want to control. © 2015 ACM.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

implementation and application of functional languages 2008

引用

丛书名： Lecture Notes in Computer Science

2008年

作者： Olaf Chitil

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共1页 << < 1 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：