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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

632 篇 会议
65 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

7 篇 northeastern uni...
7 篇 carnegie mellon ...
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...
5 篇 flatt matthew
5 篇 keller gabriele
5 篇 jones mark p.
5 篇 findler robert b...
4 篇 xi hw
4 篇 mcbride conor
4 篇 vafeiadis viktor
4 篇 weirich stephani...
4 篇 claessen koen
4 篇 jeuring johan
4 篇 chlipala adam
4 篇 peyton jones sim...
4 篇 walker david
3 篇 oliveira bruno c...
3 篇 leshchinskiy rom...
3 篇 watanabe takuo
3 篇 pottier francois
3 篇 devriese dominiq...
3 篇 gibbons phillip ...

语言

631 篇 英文
63 篇 其他
2 篇 法文
2 篇 葡萄牙文
2 篇 中文

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

共 700 条记录，以下是501-510 订阅

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

详细简洁

排序：

Systematic generation of glass-box test cases for functional logic programs 07

Systematic generation of glass-box test cases for functional...

引用

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

作者： Fischer, Sebastian Kuchen, Herbert Department of Computer Science Christian-Albrechts-University of Kiel Germany Department of Information Systems University of Münster Germany

ISBN: (纸本)1595937692

We employ the narrowing-based execution mechanism of the functional logic programming language Curry in order to automatically generate a system of test cases for glass-box testing of Curry programs. the test cases for a given function are computed by narrowing a call to that function with initially uninstantiated arguments. the generated test cases are produced w.r.t. a selected code-coverage criterion such as control-flow coverage. Besides an adaption of the notion of control-flow coverage to functional (logic) programming, we present a novel coverage criterion for this programming paradigm. A particular difficulty of the adaption is the handling of laziness. Copyright © 2007 acm.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Adding delimited and composable control to a production programming environment

Adding delimited and composable control to a production prog...

引用

12th acm sigplan international conference on functional programming

作者： Flatt, Matthew Yu, Gang Findler, Robert Bruce Felleisen, Matthias Univ Utah Salt Lake City UT 84112 USA Chinese Acad Sci Inst Software Beijing 100864 Peoples R China Univ Chicago Chicago IL 60637 USA Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9781595938152

Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advantages, how the operators explain each other (or don't), and other aspects of the operators' existence. Production programming languages, however, do not support these operators, partly because their relationship to existing and demonstrably useful constructs-such as exceptions and dynamic binding-remains relatively unexplored. In this paper, we report on our effort of translating the theory of delimited and composable control into a viable implementation for a production system. the report shows how this effort involved a substantial design element, including work with a formal model, as well as significant practical exploration and engineering. the resulting version of PLT Scheme incorporates the expressive combination of delimited and composable control alongside dynamic-wind, dynamic binding, and exception handling. None of the additional operators subvert the intended benefits of existing control operators, so that programmers can freely mix and match control operators.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

Feedback directed implicit parallelism

Feedback directed implicit parallelism

引用

12th acm sigplan international conference on functional programming

作者： Harris, Tim Singh, Satnam Microsoft Res Cambridge England

ISBN: (纸本)9781595938152

In this paper we present an automated way of using spare CPU resources within a shared memory multi-processor or multi-core machine. Our approach is (i) to profile the execution of a program, (ii) from this to identify pieces of work which are promising sources of parallelism, (iii) recompile the program with this work being performed speculatively via a work-stealing system and then (iv) to detect at run-time any attempt to perform operations that would reveal the presence of speculation. We assess the practicality of the approach through an implementation based on GHC 6.6 along with a limit study based on the execution profiles we gathered. We support the full Concurrent Haskell language compiled with traditional optimizations and including I/O operations and synchronization as well as pure computation. We use 20 of the larger programs from the 'nofib' benchmark suite. the limit study shows that programs vary a lot in the parallelism we can identify: some have none, 16 have a potential 2x speed-up, 4 have 32x. In practice, on a 4-core processor, we get 10-80% speed-ups on 7 programs. this is mainly achieved at the addition of a second core rather than beyond this. this approach is therefore not a replacement for manual parallelization, but rather a way of squeezing extra performance out of the threads of an already-parallel program or out of a program that has not yet been parallelized.

关键词： algorithms languages performance implicit parallelism functional programming Haskell

来源：评论

学校读者我要写书评

暂无评论

ICFP'07: Proceedings of the 2007 acm sigplan international Confernece on functional programming

ICFP'07: Proceedings of the 2007 ACM SIGPLAN International C...

引用

ICFP'07: 12th acm sigplan international conference on functional programming

ISBN: (纸本)9781595938152

the proceeding contains 34 papers. the topics discussed include: a type directed translation of MLF to system F;declarative programming for artificial intelligence applications;adding delimited and composable control to a production programming environment;evaluating high-level distributed language constructs;subtyping and intersection types revisited;user-friendly functional programming for web mashups;a generic usage analysis with subeffect qualifiers;feedback directed implicit parallelism;faster laziness using dynamic pointer tagging;a type system for recursive modules;extensible pattern matching via a lightweight language extension;implicit phasing for R6RS libraries;call-pattern specialisation for haskell programs;bidirectionalization transformation based on automatic derivation of view complement functions;tangible functional programming;and termination analysis and call graph construction for higher-order functional programs.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On Barron and Strachey's cartesian product function

On Barron and Strachey's cartesian product function

引用

ICFP'07: 12th acm sigplan international conference on functional programming

作者： Danvy, Olivier Spivey, Michael Department of Computer Science University of Aarhus IT-parken Aabogade 34 DK-8200 Aarhus N Denmark Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD United Kingdom

ISBN: (纸本)9781595938152

Over forty years ago, David Barron and Christopher Strachey published a startlingly elegant program for the Cartesian product of a list of lists, expressing it with a three nested occurrences of the function we now call foldr. this program is remarkable for its time because of its masterful display of higher-order functions and lexical scope, and we put it forward as possibly the first ever functional pearl. We first characterize it as the result of a sequence of program transformations, and then apply similar transformations to a program for the classical power set example. We also show that using a higher-order representation of lists allows a definition of the Cartesian product function where foldr is nested only twice. Copyright © 2007 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Evaluating high-level distributed language constructs

Evaluating high-level distributed language constructs

引用

ICFP'07: 12th acm sigplan international conference on functional programming

作者： Nyström, Jan Trinder, Phil King, David Erlang Consulting Heriot-Watt University Praxis High Integrity System

ISBN: (纸本)9781595938152

the paper investigates the impact of high level distributed programming language constructs on the engineering of realistic software components. Based on reengineering two non-trivial telecoms components, we compare two high-level distributed functional languages, Erlang and GdH, with conventional distributed technologies C++/CORBA and C++/UDP. We investigate several aspects of high-level distributed languages including the impact on code size of high-level constructs. We identify three language constructs that primarily contribute to the reduction in application size and quantify their impact. We provide the first evidence based on analysis of a substantial system to support the widely-held supposition that high-level constructs reduce programming effort associated with specifying distributed coordination. We investigate whether a language with sophisticated high-level fault tolerance can produce suitably robust components, and both measure and analyse the additional programming effort needed to introduce robustness. Finally, we investigate some implications of a range of type systems for engineering distributed software. Copyright © 2007 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Acute: High-level programming language design for distributed computation 05

Acute: High-level programming language design for distribute...

引用

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

作者： Sewell, Peter Leifer, James J. Wansbrough, Keith Nardelli, Francesco Zappa Allen-Williams, Mair Habouzit, Pierre Vafeiadis, Viktor Univ Cambridge Cambridge England INRIA Rocquencourt Le Chesnay France

ISBN: (纸本)9781595930644

Existing languages provide good support for typeful programming of stand-alone programs. In a distributed system, however, there may be interaction between multiple instances of many distinct programs, sharing some (but not necessarily all) of their module structure, and with some instances rebuilt with new versions of certain modules as time goes on. In this paper, we discuss programming-language support for such systems, focussing on their typing and naming issues. We describe an experimental language, Acute, which extends an ML core to support distributed development, deployment, and execution, allowing type-safe interaction between separately built programs. the main features are (1) type-safe marshalling of arbitrary values;(2) type names that are generated (freshly and by hashing) to ensure that type equality tests suffice to protect the invariants of abstract types, across the entire distributed system;(3) expression-level names generated to ensure that name equality tests suffice for type safety of associated values, for example, values carried on named channels;(4) controlled dynamic rebinding of marshalled values to local resources;and (5) thunkification of threads and mutexes to support computation mobility. these features are a large part of what is needed for typeful distributed programming. they are a relatively lightweight extension of ML, should be efficiently implementable, and are expressive enough to enable a wide variety of distributed infrastructure layers to be written as simple library code above the byte-string network and persistent store APIs. this disentangles the language run-time from communication intricacies. this paper highlights the main design choices in Acute. It is supported by a full language definition (of typing, compilation, and operational semantics), by a prototype implementation, and by example distribution libraries.

关键词： modules distributed programming programming languages marshalling version control serialisation ML abstract types type theory rebinding

来源：评论

学校读者我要写书评

暂无评论

McErlang: A model checker for a distributed functional programming language

McErlang: A model checker for a distributed functional progr...

引用

ICFP'07: 12th acm sigplan international conference on functional programming

作者： Fredlund, Lars-Åke Svensson, Hans Facultad de Informática Universidad Politécnica de Madrid Madrid Spain Computer Science and Engineering Chalmers University of Technology Sweden

ISBN: (纸本)9781595938152

We present a model checker for verifying distributed programs written in the Erlang programming language. Providing a model checker for Erlang is especially rewarding since the language is by now being seen as a very capable platform for developing industrial strength distributed applications with excellent failure tolerance characteristics. In contrast to most other Erlang verification attempts, we provide support for a very substantial part of the language. the model checker has full Erlang data type support, support for general process communication, node semantics (inter-process behave subtly different from intra-process communication), fault detection and fault tolerance through process linking, and can verify programs written using the OTP Erlang component library (used by most modern Erlang programs). As the model checking tool is itself implemented in Erlang we benefit from the advantages that a (dynamically typed) functional programming language offers: easy prototyping and experimentation with new verification algorithms, rich executable models that use complex data structures directly programmed in Erlang, the ability to treat executable models interchangeably as programs (to be executed directly by the Erlang interpreter) and data, and not least the possibility to cleanly structure and to cleanly combine various verification sub-tasks. In the paper we discuss the design of the tool and provide early indications on its performance. Copyright © 2007 acm.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Putting declarative programming into the web: Translating curry to JavaScript 07

Putting declarative programming into the web: Translating cu...

引用

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

作者： Hanus, Michael Institut für Informatik CAU Kiel D-24098 Kiel Germany

ISBN: (纸本)1595937692

We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipulate complex data in a type-safe way, i.e., it is ensured that only typecorrect data is accepted by the interface, where types can be specified by standard types of a programming language as well as any computable predicate on the data. the interfaces are web based, i.e., the data can be manipulated with standard web browsers without any specific requirements on the client side. However, if the client's browser has JavaScript enabled, one could also check the correctness of the data on the client side providing immediate feedback to the user. In order to release the application programmer from the tedious details to interact with JavaScript, we propose an approach where the programmer must only provide a declarative description of the requirements of the user interface from which the necessary JavaScript programs and HTML forms are automatically generated. this approach leads to a very concise and maintainable implementation of web-based user interfaces. We demonstrate an implementation of this concept in the declarative multi-paradigm language Curry where the integrated functional and logic features are exploited to enable the high level of abstraction proposed in this paper. Copyright © 2007 acm.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共70页 << < 47 48 49 50 51 52 53 54 55 56 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：