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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

8 篇 会议

馆藏范围

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

日期分布

学科分类号

8 篇 工学
- 8 篇 计算机科学与技术...
- 8 篇 软件工程
- 1 篇 信息与通信工程
3 篇 理学
- 3 篇 数学
- 1 篇 统计学（可授理学、...

主题

3 篇 functional progr...
1 篇 logic programmin...
1 篇 static analysis
1 篇 computer softwar...
1 篇 computer program...
1 篇 virtual machine

机构

1 篇 functional progr...
1 篇 department of co...
1 篇 university of ox...
1 篇 faculty of milit...
1 篇 irif umr 8243 cn...
1 篇 northeastern uni...
1 篇 dtu compute tech...
1 篇 institute for co...
1 篇 flow robotics co...
1 篇 university of ke...
1 篇 elte eötvös lorá...
1 篇 cifasis-conicet ...

作者

1 篇 papavasileiou va...
1 篇 tolpin david
1 篇 chitil olaf
1 篇 van groningen jo...
1 篇 kasting patrick
1 篇 balat vincent
1 篇 tóth melinda
1 篇 vandenbroucke al...
1 篇 van de meent jan...
1 篇 hansen michael r...
1 篇 bozó istván
1 篇 runciman colin
1 篇 wood frank
1 篇 jaskelioff mauro
1 篇 piessens frank
1 篇 kozsik tamás
1 篇 vester steen
1 篇 faddegon maarten
1 篇 radanne gabriel
1 篇 hutton graham

语言

8 篇 英文

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

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

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

详细简洁

排序：

Patern candidate discovery and parallelization techniques 29

Patern candidate discovery and parallelization techniques

引用

29th symposium on the implementation and application of functional programming languages, ifl 2017

作者： Tóth, Melinda Bozó, István Kozsik, Tamás ELTE Eötvös Loránd University Budapest Hungary

ISBN: (纸本)9781450363433

Parallel computations in a program can be expressed conveniently, at a high level of abstraction, using parallel patterns such as task farm, pipeline or divide-and-conquer. In order to transform a sequential program into a pattern-based parallel one, the software developer may want to apply refactoring transformations on it. this tutorial explains a methodology to perform tool supported parallelization of programs by presenting how to use a specific static source code analysis and transformation system for Erlang. A key element of the approach is pattern candidate discovery, a static analysis technique to identify code fragments that can be refactored into a parallel pattern. © 2017 Copyright held by the owner/author(s).

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of probabilistic programming language anglican 28

Design and implementation of probabilistic programming langu...

引用

28th symposium on the implementation and application of functional programming languages, ifl 2016

作者： Tolpin, David Van De Meent, Jan-Willem Yang, Hongseok Wood, Frank University of Oxford United Kingdom Northeastern University United States

ISBN: (纸本)9781450347679

Anglican is a probabilistic programming system designed to interoperate with Clojure and other JVM languages. We introduce the programming language Anglican, outline our design choices, and discuss in depth the implementation of the Anglican language and runtime, including macro-based compilation, extended CPS-based evaluation model, and functional representations for probabilistic paradigms, such as a distribution, a random process, and an inference algorithm. We show that a probabilistic functional language can be implemented efficiently and integrated tightly with a conventional functional language with only moderate computational overhead. We also demonstrate how advanced probabilistic modelling concepts are mapped naturally to the functional foundation. © 2016 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

A lightweight hat: Simple type-preserving instrumentation for self-tracing lazy functional programs 28

A lightweight hat: Simple type-preserving instrumentation fo...

引用

28th symposium on the implementation and application of functional programming languages, ifl 2016

作者： Chitil, Olaf Faddegon, Maarten Runciman, Colin University of Kent United Kingdom

ISBN: (纸本)9781450347679

Existing methods for generating a detailed trace of a computation of a lazy functional program are complex. these complications limit the use of tracing in practice. However, such a detailed trace is desirable for understanding and debugging a lazy functional program. Here we present a lightweight method that instruments a program to generate such a trace, namely the augmented redex trail introduced by the Haskell tracer Hat. the new method is a major step towards an omniscient debugger for real-world Haskell programs. © 2016 ACM.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

A portable VM-based implementation platform for non-strict functional programming languages 28

A portable VM-based implementation platform for non-strict f...

引用

28th symposium on the implementation and application of functional programming languages, ifl 2016

作者： Jansen, Jan Martin Van Groningen, John Faculty of Military Sciences Netherlands Defence Academy P.O. Box 10000 CA Den Helder1780 Netherlands Institute for Computing and Information Sciences Radboud University Nijmegen P.O. Box 9010 GL Nijmegen6500 Netherlands

ISBN: (纸本)9781450347679

the Web has become a paramount deployment platform for computer applications. Modern Web applications require execution of code on both server-and client-side. For the client-side JavaScript is the more-or-less default platform for execution of code. Users of functional programming languages like Haskell and Clean, who want to develop their software completely in these languages, are forced to rely on dedicated methods to transform their code to something that can be executed on top of JavaScript. In this paper we introduce a Virtual Machine that is capable of effcient execution of bytecode generated by a compiler for a non-strict intermediate functional language. the virtual machine has several implementations supporting the same bytecode, including JavaScript and *** versions. In this way we obtain a portable execution platform for non-strict functional languages with a better client-side performance than existing client-side execution platforms. © 2016 ACM.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Eliom: Tierless Web programming from the ground up 28

Eliom: Tierless Web programming from the ground up

引用

28th symposium on the implementation and application of functional programming languages, ifl 2016

作者： Radanne, Gabriel Papavasileiou, Vasilis Vouillon, Jérôme Balat, Vincent IRIF UMR 8243 CNRS Univ Paris Diderot Sorbonne Paris Cité France

ISBN: (纸本)9781450347679

Eliom is a dialect of OCaml for Web programming. It can be used both server and client-side. Server and client sections can also be mixed in the same file using syntactic annotations. this allows one to build a whole application as a single program, in which it is possible to define in a composable way reusable widgets with both server and client behaviors. Our language also enables simple typesafe communication. Eliom matches the specificities of the Web by allowing the programmer to interleave client and server code while maintaining eficient one-way server-to-client communication. We present how the language extensions introduced by Eliom enable a new paradigm for Web programming, and how this paradigm allows building complex libraries easily, safely, and in a composable manner. © 2016 ACM.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Contractive functions on infinite data structures 28

Contractive functions on infinite data structures

引用

28th symposium on the implementation and application of functional programming languages, ifl 2016

作者： Capretta, Venanzio Hutton, Graham Jaskelioff, Mauro Functional Programming Lab University of Nottingham United Kingdom CIFASIS-CONICET Universidad Nacional de Rosario Argentina

ISBN: (纸本)9781450347679

Coinductive data structures, such as streams or infinite trees, have many applications in functional programming and type theory, and are naturally defined using recursive equations. But how do we ensure that such equations make sense, i.e. that they actually generate a productive infinite object? A standard means to achieve productivity is to use Banach's fixed-point theorem, which guarantees the unique existence of solutions to recursive equations on metric spaces under certain conditions. Functions satisfying these conditions are called contractions. In this article, we give a new characterization of contractions on streams in the form of a sound and complete representation theorem, and generalize this result to a wide class of non-well-founded structures, first to infinite binary trees, then to final coalgebras of container functors. these results have important potential applications in functional programming, where coinduction and corecursion are successfully deployed to model continuous reactive systems, dynamic interactivity, signal processing, and other tasks that require exible manipulation of non-well-founded data. Our representation theorems provide a definition paradigm to compactly compute with such data and easily reason about them. © 2016 ACM.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Synthesis of railway-signaling plans using reachability games 28

Synthesis of railway-signaling plans using reachability game...

引用

28th symposium on the implementation and application of functional programming languages, ifl 2016

作者： Kasting, Patrick Hansen, Michael R. Vester, Steen DTU Compute Technical University of Denmark LyngbyDK-2800 Denmark Flow Robotics CopenhagenDK-2300 Denmark

ISBN: (纸本)9781450347679

In this work, we show the feasibility of using functional programming (more specifically F#) in connection with gamebased methods for synthesis of correct-by-construction controllers (also called signaling plans) for railway networks. this is a massively resource-demanding application. A model for railway networks comprising trains, signals, linear sections, and points is established together with a domain-specific language capturing the important concepts in the model. A translation from railway network models to two-player reachability games is provided. In these games, the existential player (the control system) controls signals and points and the universal player (the antagonistic environment) controls movement of trains. A winning strategy for the existential player provides a signaling plan that will safely guide trains through the network. the concepts from the railway network model and the twoplayer reachability game are captured, in a natural manner, by type declarations in F#. Furthermore, the F# translation functions are formulated in a manner that is close to the mathematical formulations. this increases confidence in the correctness of the implementation and it decreases the development time. Imperative features of F# proved useful in two places: Hash tables and arrays were used in the representations of the railway network model and the reachability game. this allowed for more compact representations and a more efficient game solver (providing the winning strategy). Experiments show that we are able to synthesize signaling plans for real railway networks of substantial size. © 2016 ACM.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：