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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

631 篇 会议
69 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

581 篇 工学
- 483 篇 软件工程
- 440 篇 计算机科学与技术...
- 30 篇 电气工程
- 27 篇 控制科学与工程
- 16 篇 信息与通信工程
- 6 篇 建筑学
- 5 篇 土木工程
- 5 篇 生物工程
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
- 3 篇 材料科学与工程（可...
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 动力工程及工程热...
- 2 篇 农业工程
60 篇 理学
- 49 篇 数学
- 6 篇 生物学
- 6 篇 统计学（可授理学、...
- 5 篇 物理学
- 4 篇 化学
- 2 篇 系统科学
38 篇 教育学
- 38 篇 教育学
29 篇 管理学
- 18 篇 图书情报与档案管...
- 12 篇 管理科学与工程(可...
- 5 篇 工商管理
6 篇 法学
- 6 篇 社会学
2 篇 经济学
- 2 篇 应用经济学
2 篇 农学
- 2 篇 作物学
2 篇 医学
- 2 篇 临床医学

主题

106 篇 functional progr...
66 篇 languages
63 篇 computer program...
46 篇 design
35 篇 computer program...
32 篇 haskell
30 篇 programming
20 篇 object oriented ...
20 篇 dependent types
18 篇 functional react...
18 篇 theory
18 篇 programming lang...
17 篇 performance
14 篇 semantics
13 篇 domain-specific ...
12 篇 algorithms
12 篇 logic programmin...
11 篇 generic programm...
11 篇 verification
11 篇 continuations

机构

8 篇 carnegie mellon ...
7 篇 northeastern uni...
7 篇 portland state u...
5 篇 univ penn philad...
5 篇 chalmers univ te...
4 篇 inria
4 篇 microsoft res ca...
3 篇 north carolina s...
3 篇 indiana univ blo...
3 篇 georgia inst tec...
3 篇 univ edinburgh e...
3 篇 univ strathclyde...
3 篇 harvard univ cam...
3 篇 univ new s wales...
3 篇 it university of...
3 篇 carnegie mellon ...
3 篇 univ cambridge c...
3 篇 univ utah salt l...
3 篇 yale univ dept c...
3 篇 luca school of a...

作者

7 篇 krishnaswami nee...
6 篇 findler robert b...
5 篇 flatt matthew
5 篇 keller gabriele
5 篇 jones mark p.
4 篇 xi hw
4 篇 mcbride conor
4 篇 vafeiadis viktor
4 篇 weirich stephani...
4 篇 claessen koen
4 篇 jeuring johan
4 篇 chlipala adam
4 篇 dreyer derek
4 篇 peyton jones sim...
4 篇 walker david
3 篇 oliveira bruno c...
3 篇 dolstra eelco
3 篇 loh andres
3 篇 leshchinskiy rom...
3 篇 watanabe takuo

语言

640 篇 英文
57 篇 其他
2 篇 法文
2 篇 葡萄牙文
2 篇 中文

检索条件"任意字段=15th ACM SIGPLAN International Conference on Functional Programming"

共 703 条记录，以下是71-80 订阅

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

详细简洁

排序：

Tangible functional programming

Tangible functional programming

引用

12th acm sigplan international conference on functional programming

作者： Elliott, Conal M. LambdaPix

ISBN: (纸本)9781595938152

We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestations of pure values, including functions. programming happens by gestural composition of TVs. Our goal is to give end-users the ability to create parameterized, composable content without imposing the usual abstract and linguistic working style of programmers. We hope that such a system will put the essence of programming into the hands of many more people, and in particular people with artistic/visual creative style. In realizing this vision, we develop algebras for visual presentation and for "deep" function application, where function and argument may both be nested within a structure of tuples, functions, etc. Composition gestures are translated into chains of combinators that act simultaneously on statically typed values and their visualizations.

关键词： human factors languages theory interactive programming end-user programming gestural composition combinator libraries arrows interactive visualization

来源：评论

学校读者我要写书评

暂无评论

Multi-polymorphic programming in bondi

Multi-polymorphic programming in bondi

引用

2013 9th acm sigplan Workshop on Generic programming, WGP 2013 - Co-located with the 18th acm sigplan international conference on functional programming, ICFP 2013

作者： Given-Wilson, thomas Huang, Freeman Jay, Barry NICTA Australia University of Technology Sydney Australia

ISBN: (纸本)9781450323895

the bondi programming language is multi-polymorphic, in that it supports four polymorphic programming styles within a small core of computation, namely a typed pattern calculus. bondi's expressive power is illustrated by considering the problem of assigning reviewers to a paper. As the context generalises from a committee to a committee with additional reviewers, to a conference, to a federation or confederation, the solution incorporates polymorphism familiar from the functional, generic functional, relational, path-based, and object-oriented programming styles, respectively. these experiments show that multi-polymorphic programming is both practical and desirable. Copyright © 2013 acm.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Staging with Control: Type-Safe Multi-stage programming with Control Operators 2017

Staging with Control: Type-Safe Multi-stage Programming with...

引用

16th acm sigplan international conference on Generative programming - Concepts and Experiences (GPCE) co-located with SPLASH conference

作者： Oishi, Junpei Kameyama, Yukiyoshi Univ Tsukuba Comp Sci Dept1 Tsukuba Ibaraki Japan Univ Tsukuba Dept Comp Sci Tsukuba Ibaraki Japan Yahoo Japan Corp Tokyo Japan

ISBN: (纸本)9781450355247

Staging allows a programmer to write domain-specific, custom code generators. Ideally, a programming language for staging provides all necessary features for staging, and at the same time, gives static guarantee for the safety properties of generated code including well typedness and well scopedness. We address this classic problem for the language with control operators, which allow code optimizations in a modular and compact way. Specifically, we design a staged programming language with the expressive control operators shift0 and reset0, which let us express, for instance, multi-layer let-insertion, while keeping the static guarantee of well typedness and well scopedness. For this purpose, we extend our earlier work on refined environment classifiers which were introduced for the staging language with state. We show that our language is expressive enough to write interesting code generation techniques, and that it enjoys type soundness. We also mention a type inference algorithm for our language under reasonable restriction.

关键词： code generation language design program transformation generative programming staging type system

来源：评论

学校读者我要写书评

暂无评论

Productive Coprogramming with Guarded Recursion 13

Productive Coprogramming with Guarded Recursion

引用

18th acm sigplan international conference on functional programming

作者： Atkey, Robert McBride, Conor Univ Strathclyde Glasgow G1 1XQ Lanark Scotland

ISBN: (纸本)9781450323260

Total functional programming offers the beguiling vision that, just by virtue of the compiler accepting a program, we are guaranteed that it will always terminate. In the case of programs that are not intended to terminate, e. g., servers, we are guaranteed that programs will always be productive. Productivity means that, even if a program generates an infinite amount of data, each piece will be generated in finite time. the theoretical underpinning for productive programming with infinite output is provided by the category theoretic notion of final coalgebras. Hence, we speak of coprogramming with non-well-founded codata, as a dual to programming with well-founded data like finite lists and trees. Systems that offer facilities for productive coprogramming, such as the proof assistants Coq and Agda, currently do so through syntactic guardedness checkers, which ensure that all self-recursive calls are guarded by a use of a constructor. Such a check ensures productivity. Unfortunately, these syntactic checks are not compositional, and severely complicate coprogramming. Guarded recursion, originally due to Nakano, is tantalising as a basis for a flexible and compositional type-based approach to coprogramming. However, as we show, guarded recursion by itself is not suitable for coprogramming due to the fact that there is no way to make finite observations on pieces of infinite data. In this paper, we introduce the concept of clock variables that index Nakano's guarded recursion. Clock variables allow us to "close over" the generation of infinite codata, and to make finite observations, something that is not possible with guarded recursion alone.

关键词： Languages theory Types Recursion coalgebras corecursion guarded recursion total functional programming

来源：评论

学校读者我要写书评

暂无评论

Romeo: a System For More Flexible Binding-Safe programming 14

Romeo: a System For More Flexible Binding-Safe Programming

引用

19th acm sigplan international conference on functional programming (ICFP)

作者： Stansifer, Paul Wand, Mitchell Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9781450328739

Current languages for safely manipulating values with names only support term languages with simple binding syntax. As a result, no tools exist to safely manipulate code written in those languages for which name problems are the most challenging. We address this problem with Romeo, a language that respects alpha-equivalence on its values, and which has access to a rich specification language for binding, inspired by attribute grammars. Our work has the complex-binding support of David Herman's lambda(m), but is a full-fledged binding-safe language like Pure FreshML.

关键词： languages binding alpha-equivalence macros

来源：评论

学校读者我要写书评

暂无评论

Compiling with continuations, continued

Compiling with continuations, continued

引用

12th acm sigplan international conference on functional programming

作者： Kennedy, Andrew Microsoft Research Cambridge

ISBN: (纸本)9781595938152

We present a series of CPS-based intermediate languages suitable for functional language compilation, arguing that they have practical benefits over direct-style languages based on A-normal form (ANF) or monads. Inlining of functions demonstrates the benefits most clearly: in ANF-based languages, inlining involves a re-normalization step that rearranges let expressions and possibly introduces a new 'join point' function, and in monadic languages, commuting conversions must be applied;in contrast, inlining in our CPS language is a simple substitution of variables for variables. We present a contification transformation implemented by simple rewrites on the intermediate language. Exceptions are modelled using so-called 'double-barrelled' CPS. Subtyping on exception constructors then gives a very straightforward effect analysis for exceptions. We also show how a graph-based representation of CPS terms can be implemented extremely efficiently, with linear-time term simplification.

关键词： continuations continuation passing style monads optimizing compilation functional programming languages

来源：评论

学校读者我要写书评

暂无评论

signatr: A Data-Driven Fuzzing Tool for R 15

signatr: A Data-Driven Fuzzing Tool for R

引用

15th international conference on Software Language Engineering (SLE)

作者： Turcotte, Alexi Donat-Bouillud, Pierre Krikava, Filip Vitek, Jan Northeastern Univ Boston MA 02115 USA Czech Tech Univ Prague Czech Republic

ISBN: (纸本)9781450399197

the fast-and-loose, permissive semantics of dynamic programming languages limit the power of static analyses. For that reason, soundness is often traded for precision through dynamic program analysis. Dynamic analysis is only as good as the available runnable code, and relying solely on test suites is fraught as they do not cover the full gamut of possible behaviors. Fuzzing is an approach for automatically exercising code, and could be used to obtain more runnable code. However, the shape of user-defined data in dynamic languages is difficult to intuit, limiting a fuzzer's reach. We propose a feedback-driven blackbox fuzzing approach which draws inputs from a database of values recorded from existing code. We implement this approach in a tool called signatr for the R language. We present the insights of its design and implementation, and assess signatr's ability to uncover new behaviors by fuzzing 4,829 R functions from 100 R packages, revealing 1,195,184 new signatures.

关键词： R fuzzing dynamic program analysis dynamic programming languages

来源：评论

学校读者我要写书评

暂无评论

FranTk - A declarative GUI language for Haskell 00

FranTk - A declarative GUI language for Haskell

引用

5th acm sigplan international conference on functional programming (ICFP)

作者： Sage, M Univ Glasgow Dept Comp Sci Glasgow G12 8QQ Lanark Scotland

ISBN: (纸本)9781581132021

FranTk is a new high level library for programming Graphical User Interfaces (GUIs) in Haskell. It is based on Fran (functional Reactive Animation), and uses the notions of Behaviors and Events to structure code. Behaviors are time-varying, reactive values. they can be used to represent the state of an application. Events are streams of values that occur at discrete points in time. they can be used, for instance, to represent user input. FranTk allows user interfaces to be structured in a more declarative manner than has been possible with previous functional GUI libraries. We demonstrate, through a series of examples, how this is achieved, and why it is important. these examples are elements of a prototype, Air Traffic Control simulator. FranTk uses a binding to the popular Tcl/Tk toolkit to provide a powerful set of platform independent set of widgets. It has been released as a Haskell library that runs under Hugs and GHC.

关键词： Graphical User Interfaces Haskell functional Reactive programming

来源：评论

学校读者我要写书评

暂无评论

Frenetic: A Network programming Language 11

Frenetic: A Network Programming Language

引用

16th acm sigplan international conference on functional programming (ICFP 11)

作者： Foster, Nate Harrison, Rob Freedman, Michael J. Monsanto, Christopher Rexford, Jennifer Story, Alec Walker, David Cornell Univ Ithaca NY 14853 USA Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450308656

Modern networks provide a variety of interrelated services including routing, traffic monitoring, load balancing, and access control. Unfortunately, the languages used to program today's networks lack modern features-they are usually defined at the low level of abstraction supplied by the underlying hardware and they fail to provide even rudimentary support for modular programming. As a result, network programs tend to be complicated, error-prone, and difficult to maintain. this paper presents Frenetic, a high-level language for programming distributed collections of network switches. Frenetic provides a declarative query language for classifying and aggregating network traffic as well as a functional reactive combinator library for describing high-level packet-forwarding policies. Unlike prior work in this domain, these constructs are-by design-fully compositional, which facilitates modular reasoning and enables code reuse. this important property is enabled by Frenetic's novel run-time system which manages all of the details related to installing, uninstalling, and querying low-level packet-processing rules on physical switches. Overall, this paper makes three main contributions: (1) We analyze the state-of-the art in languages for programming networks and identify the key limitations;(2) We present a language design that addresses these limitations, using a series of examples to motivate and validate our choices;(3) We describe an implementation of the language and evaluate its performance on several benchmarks.

关键词： Languages Design Network programming languages domain-specific languages functional reactive programming OpenFlow

来源：评论

学校读者我要写书评

暂无评论

Practical Principled FRP Forget the Past, Change the Future, FRPNow! 2015

Practical Principled FRP Forget the Past, Change the Future,...

引用

20th acm sigplan international conference on functional programming (ICFP)

作者： van der Ploeg, Atze Claessen, Koen Chalmers Univ Technol Gothenburg Sweden

ISBN: (纸本)9781450336697

We present a new interface for practical functional Reactive programming (FRP) that (1) is close in spirit to the original FRP ideas, (2) does not have the original space-leak problems, without using arrows or advanced types, and (3) provides a simple and expressive way for performing I/O actions from FRP code. We also provide a denotational semantics for this new interface, and a technique (using Kripke logical relations) for reasoning about which FRP functions may "forget their past", i.e. which functions do not have an inherent space-leak. Finally, we show how we have implemented this interface as a Haskell library called FRPNow.

关键词： functional Reactive programming Space-leak Purely functional I/O Kripke logical relations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共71页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：