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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

645 篇 会议
75 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

597 篇 工学
- 462 篇 软件工程
- 446 篇 计算机科学与技术...
- 44 篇 控制科学与工程
- 36 篇 电气工程
- 17 篇 信息与通信工程
- 8 篇 建筑学
- 6 篇 电子科学与技术（可...
- 4 篇 材料科学与工程（可...
- 4 篇 动力工程及工程热...
- 4 篇 土木工程
- 4 篇 生物工程
- 3 篇 化学工程与技术
- 2 篇 力学（可授工学、理...
- 2 篇 石油与天然气工程
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
93 篇 理学
- 46 篇 数学
- 36 篇 生物学
- 5 篇 系统科学
- 4 篇 物理学
- 3 篇 化学
- 2 篇 统计学（可授理学、...
29 篇 教育学
- 29 篇 教育学
- 14 篇 心理学(可授教育学...
22 篇 管理学
- 16 篇 图书情报与档案管...
- 8 篇 管理科学与工程(可...
- 7 篇 工商管理
19 篇 法学
- 19 篇 社会学
3 篇 经济学
- 3 篇 应用经济学
2 篇 农学
- 2 篇 作物学
1 篇 医学
1 篇 军事学
1 篇 艺术学

主题

96 篇 functional progr...
74 篇 languages
50 篇 genetic programm...
46 篇 design
45 篇 computer program...
30 篇 haskell
27 篇 computer program...
25 篇 programming
21 篇 theory
20 篇 dependent types
19 篇 performance
16 篇 algorithms
15 篇 parallel program...
15 篇 programming lang...
14 篇 logic programmin...
14 篇 functional react...
13 篇 verification
12 篇 object oriented ...
12 篇 domain-specific ...
11 篇 education

机构

8 篇 northeastern uni...
7 篇 portland state u...
6 篇 carnegie mellon ...
6 篇 microsoft res ca...
5 篇 chalmers univ te...
4 篇 inria
4 篇 univ penn philad...
3 篇 indiana univ blo...
3 篇 delft univ techn...
3 篇 univ edinburgh e...
3 篇 open university ...
3 篇 microsoft res re...
3 篇 univ strathclyde...
3 篇 univ new s wales...
3 篇 carnegie mellon ...
3 篇 univ cambridge c...
3 篇 technion-israel ...
3 篇 univ utah salt l...
3 篇 univ chicago il ...
3 篇 yale univ dept c...

作者

6 篇 findler robert b...
5 篇 flatt matthew
5 篇 jones mark p.
5 篇 krishnaswami nee...
4 篇 o'reilly una-may
4 篇 xi hw
4 篇 mcbride conor
4 篇 devriese dominiq...
4 篇 vafeiadis viktor
4 篇 weirich stephani...
4 篇 spector lee
4 篇 claessen koen
4 篇 jeuring johan
4 篇 wu nicolas
4 篇 chlipala adam
4 篇 dreyer derek
4 篇 keller gabriele
4 篇 walker david
3 篇 dolstra eelco
3 篇 loh andres

语言

652 篇 英文
65 篇 其他
2 篇 葡萄牙文
2 篇 中文

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

共 721 条记录，以下是121-130 订阅

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

详细简洁

排序：

Stream fusion - From lists to streams to nothing at all

Stream fusion - From lists to streams to nothing at all

引用

12th acm sigplan international conference on functional programming

作者： Coutts, Duncan Leshchinskiy, Roman Stewart, Don Univ Oxford Comp Lab Programming Tools Grp Oxford OX1 3QD England Univ New S Wales Kensington NSW 2033 Australia

ISBN: (纸本)9781595938152

this paper presents an automatic deforestation system, stream fusion, based on equational transformations, that fuses a wider range of functions than existing short-cut fusion systems. In particular, stream fusion is able to fuse zips, left folds and functions over nested lists, including list comprehensions. A distinguishing feature of the framework is its simplicity: by transforming list functions to expose their structure, intermediate values are eliminated by general purpose compiler optimisations. We have reimplemented the Haskell standard List library on top of our framework, providing stream fusion for Haskell lists. By allowing a wider range of functions to fuse, we see an increase in the number of occurrences of fusion in typical Haskell programs. We present benchmarks documenting time and space improvements.

关键词： languages algorithms deforestation program optimisation program transformation program fusion functional programming

来源：评论

学校读者我要写书评

暂无评论

programming macro tree transducers

Programming macro tree transducers

引用

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

作者： Bahr, Patrick Day, Laurence E. Department of Computer Science University of Copenhagen Denmark Functional Programming Laboratory University of Nottingham United Kingdom

ISBN: (纸本)9781450323895

A tree transducer is a set of mutually recursive functions transforming an input tree into an output tree. Macro tree transducers extend this recursion scheme by allowing each function to be defined in terms of an arbitrary number of accumulation parameters. In this paper, we show how macro tree transducers can be concisely represented in Haskell, and demonstrate the benefits of utilising such an approach with a number of examples. In particular, tree transducers afford a modular programming style as they can be easily composed and manipulated. Our Haskell representation generalises the original definition of (macro) tree transducers, abolishing a restriction on finite state spaces. However, as we demonstrate, this generalisation does not affect compositionality.

关键词： Transducers

来源：评论

学校读者我要写书评

暂无评论

Query-Based Object-Oriented programming A Declarative Web of Objects 14

Query-Based Object-Oriented Programming A Declarative Web of...

引用

14th acm sigplan international Symposium on Dynamic Languages (DLS)

作者： Seginer, Yoav Vosse, theo Harari, Gil Kolodny, Uri Cdl Lang Org Amsterdam Netherlands Cdl Lang Org Jerusalem Israel

ISBN: (纸本)9781450360302

We present a declarative, object-oriented language in which queries play a central role. Queries are used not only to access data, but also to refer to the application's object members and as a means of program control. the language is fully declarative, with queries and other pure functions defining the relations between the attributes of different objects. A rule-base-like write operation allows state to be updated. Control is achieved by queries selecting the class variants (mixin classes) which are active in each object. the dynamic activation and deactivation of declarative mixin classes allows decomposition of functionality into small reusable classes. the programming style in the language is functional and reactive, with function applications defining object members. Queries are one type of function, which also serves as the glue which puts these functions together, providing them with their input. Since queries describe declaratively what they return, they leave it to the system to implement the how of getting it. Combining this with an organization around objects makes the language highly suitable for complex interactive applications driven by large amounts of data from multiple sources. Our implementation of the language includes a strong display component. It can be seen as a conceptual extension of HTML and CSS in a way which replaces the need for the JavaScript imperative component in web applications. the work described here is not restricted, however, to front-end development and can be applied elsewhere as well.

关键词： query-based declarative dynamic mixin

来源：评论

学校读者我要写书评

暂无评论

An expressive language of signatures 05

An expressive language of signatures

引用

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

作者： Ramsey, N Fisher, K Govereau, P Harvard Univ Div Engn & Appl Sci Cambridge MA 02138 USA

ISBN: (纸本)9781595930644

Current languages allow a programmer to describe an interface only by enumerating its parts, possibly including other interfaces wholesale. Such languages cannot express relationships between interfaces, yet when independently developed software components are combined into a larger system, significant relationships arise, To address this shortcoming, we define, as a conservative extension of ML, a language for manipulating interfaces. Our language includes operations for adding, renaming, and removing components;for changing the type associated with a value;for making manifest types abstract and vice versa;and for combining interfaces. these operations can express useful relationships among interfaces. We have defined a formal semantics in which an interface denotes a group of four sets;we show how these sets determine a subtyping relation, and we sketch the elaboration of an interface into its denotation.

关键词： design languages objective Caml Standard ML signatures interfaces signature manipulation programming in the large

来源：评论

学校读者我要写书评

暂无评论

User-friendly functional programming for web mashups

User-friendly functional programming for web mashups

引用

12th acm sigplan international conference on functional programming

作者： Ennals, Rob Gay, David Intel Res Berkeley Berkeley CA 94704 USA

ISBN: (纸本)9781595938152

MashMaker is a web-based tool that makes it easy for a normal user to create web mashups by browsing around, without needing to type, or plan in advance what they want to do. Like a web browser, Mashmaker allows users to create mashups by browsing, rather than writing code, and allows users to bookmark interesting things they find, forming new widgets-reusable mashup fragments. Like a spreadsheet, MashMaker mixes program and data and allows ad-hoc unstructured editing of programs. MashMaker is also a modern functional programming language with non-side effecting expressions, higher order functions, and lazy evaluation. MashMaker programs can be manipulated either textually, or through an interactive tree representation, in which a program is presented together with the values it produces. In order to cope with this unusual domain, MashMaker contains a number of deviations from normal function languages. the most notable of these is that, in order to allow the programmer to write programs directly on their data, all data is stored in a single tree, and evaluation of an expression always takes place at a specific point in this tree, which also functions as its scope.

关键词： languages human factors design management mashup web end-user programming browser

来源：评论

学校读者我要写书评

暂无评论

HorseIR: Bringing Array programming Languages Together with Database Query Processing 14

HorseIR: Bringing Array Programming Languages Together with ...

引用

14th acm sigplan international Symposium on Dynamic Languages (DLS)

作者： Chen, Hanfeng D'silva, Joseph Vinish Chen, Hongji Kemme, Bettina Hendren, Laurie McGill Univ Montreal PQ Canada

ISBN: (纸本)9781450360302

Relational database management systems (RDBMS) are operationally similar to a dynamic language processor. they take SQL queries as input, dynamically generate an optimized execution plan, and then execute it. In recent decades, the emergence of in-memory databases with columnar storage, which use array-like storage structures, has shifted the focus on optimizations from the traditional I/O bottleneck to CPU and memory. However, database research so far has primarily focused on CPU cache optimizations. the similarity in the computational characteristics of such database workloads and array programming language optimizations are largely unexplored. We believe that these database implementations can benefit from merging database optimizations with dynamic array-based programming language approaches. therefore, in this paper, we propose a novel approach to optimize database query execution using a new array-based intermediate representation, HorseIR, that resides between database queries and compiled code. Furthermore, we provide a translator to generate HorseIR from database execution plans and a compiler that optimizes HorseIR and generates efficient code. We compare HorseIR with the MonetDB RDBMS, by testing standard SQL queries, and show how our approach and compiler optimizations improve the runtime of complex queries.

关键词： IR Compiler optimizations Array programming SQL database queries

来源：评论

学校读者我要写书评

暂无评论

Towards more natural functional programming languages

Towards more natural functional programming languages

引用

7th international conference on functional programming

作者： Myers, BA Carnegie Mellon Univ Human Comp Interact Inst Sch Comp Sci Pittsburgh PA 15213 USA

programming languages are the way for a person to express a mental plan in a way that the computer can understand. therefore, it is appropriate to consider properties of people when designing new programming languages. In our research, we are investigating how people think about algorithms, and how programming languages can be made easier to learn and more effective for people to use. By taking human-productivity aspects of programming languages seriously, designers can more effectively match programming language features with human capabilities and problem solving methods. Human factors methods can be used to measure the effects, so unsubstantiated claims can be avoided. this talk will present a quick summary of new and old results in what is known about people and programming;from areas that are sometimes called "empirical studies of programmers" and "psychology of programming." Much is known about what people find difficult, and what syntax and language features are especially tricky and bug-prone. Our new research has discovered how people naturally think about algorithms and data structures, which can help with making programming languages more closely match people's problem solving techniques.

关键词： design human factors languages end-user programming psychology of programming empirical studies of programming natural programming

来源：评论

学校读者我要写书评

暂无评论

Painless programming combining reduction and search: Design principles for embedding decision procedures in high-level languages 12

Painless programming combining reduction and search: Design ...

引用

17th acm sigplan international conference on functional programming, ICFP 2012

作者： Sheard, Timothy E. Portland State University Portland OR United States

ISBN: (纸本)9781450310543

We describe the Funlogic system which extends a functional language with existentially quantified declarations. An existential declaration introduces a variable and a set of constraints that its value should meet. Existential variables are bound to conforming values by a decision procedure. Funlogic embeds multiple external decision procedures using a common framework. Design principles for embedding decision procedures are developed and illustrated for three different decision procedures from widely varying domains. © 2012 acm.

关键词： High level languages

来源：评论

学校读者我要写书评

暂无评论

Multi-return function call

Multi-return function call

引用

9th international conference on functional programming

作者： Shivers, Olin Fisher, David Georgia Inst Technol Coll Comp Atlanta GA 30332 USA

It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. this turns out to be a surprisingly useful mechanism. this article conducts a fairly wide-ranging tour of such a feature: a formal semantics for a minimal A-calculus capturing the mechanism;motivating examples;monomorphic and parametrically polymorphic static type systems;useful transformations;implementation concerns and experience with an implementation;and comparison to related mechanisms, such as exceptions, sum-types and explicit continuations. We conclude that multiple-return function call is not only a useful and expressive mechanism, at both the source-code and intermediate-representation levels, but also quite inexpensive to implement.

关键词： Compilers Continuations Control structures functional programming Lambda calculus Procedure call programming languages

来源：评论

学校读者我要写书评

暂无评论

Lightweight Monadic programming in ML 11

Lightweight Monadic Programming in ML

引用

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

作者： Swamy, Nikhil Guts, Nataliya Leijen, Daan Hicks, Michael Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450308656

Many useful programming constructions can be expressed as monads. Examples include probabilistic modeling, functional reactive programming, parsing, and information flow tracking, not to mention effectful functionality like state and I/O. In this paper, we present a type-based rewriting algorithm to make programming with arbitrary monads as easy as using ML's built-in support for state and I/O. Developers write programs using monadic values of type m T as if they were of type T, and our algorithm inserts the necessary binds, units, and monad-to-monad morphisms so that the program type checks. Our algorithm, based on Jones' qualified types, produces principal types. But principal types are sometimes problematic: the program's semantics could depend on the choice of instantiation when more than one instantiation is valid. In such situations we are able to simplify the types to remove any ambiguity but without adversely affecting typability;thus we can accept strictly more programs. Moreover, we have proved that this simplification is efficient (linear in the number of constraints) and coherent: while our algorithm induces a particular rewriting, all related rewritings will have the same semantics. We have implemented our approach for a core functional language and applied it successfully to simple examples from the domains listed above, which are used as illustrations throughout the paper.

关键词： monad type rewriting coherence coercion

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共73页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：