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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

685 篇 会议
67 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

584 篇 工学
- 500 篇 软件工程
- 440 篇 计算机科学与技术...
- 38 篇 控制科学与工程
- 34 篇 电气工程
- 20 篇 信息与通信工程
- 10 篇 生物工程
- 8 篇 建筑学
- 6 篇 机械工程
- 6 篇 材料科学与工程（可...
- 6 篇 电子科学与技术（可...
- 6 篇 土木工程
- 6 篇 生物医学工程（可授...
- 4 篇 动力工程及工程热...
- 4 篇 化学工程与技术
85 篇 理学
- 61 篇 数学
- 16 篇 生物学
- 8 篇 物理学
- 6 篇 统计学（可授理学、...
- 5 篇 化学
36 篇 管理学
- 21 篇 图书情报与档案管...
- 16 篇 管理科学与工程(可...
- 11 篇 工商管理
26 篇 教育学
- 26 篇 教育学
8 篇 法学
- 8 篇 社会学
6 篇 医学
- 5 篇 临床医学
- 3 篇 基础医学(可授医学...
6 篇 艺术学
- 6 篇 音乐与舞蹈学
- 4 篇 艺术学理论
5 篇 农学
- 5 篇 作物学
3 篇 经济学
- 3 篇 应用经济学

主题

102 篇 functional progr...
66 篇 languages
52 篇 computer program...
42 篇 design
31 篇 haskell
30 篇 object oriented ...
26 篇 computer program...
25 篇 programming
20 篇 dependent types
19 篇 logic programmin...
19 篇 theory
17 篇 functional react...
16 篇 parallel program...
16 篇 dynamic programm...
15 篇 aspect oriented ...
14 篇 performance
13 篇 generic programm...
13 篇 semantics
13 篇 verification
13 篇 programming lang...

机构

7 篇 portland state u...
6 篇 northeastern uni...
6 篇 microsoft res ca...
5 篇 univ penn philad...
5 篇 chalmers univ te...
4 篇 inria
4 篇 indiana univ blo...
4 篇 university of ch...
4 篇 carnegie mellon ...
3 篇 department of pr...
3 篇 ecole polytech f...
3 篇 univ edinburgh e...
3 篇 univ cambridge c...
3 篇 univ strathclyde...
3 篇 carnegie mellon ...
3 篇 univ new s wales...
3 篇 microsoft resear...
3 篇 ibm research
3 篇 carnegie mellon ...
3 篇 univ cambridge c...

作者

6 篇 figueroa ismael
6 篇 krishnaswami nee...
5 篇 claessen koen
5 篇 tabareau nicolas
5 篇 jones mark p.
5 篇 tanter éric
4 篇 flatt matthew
4 篇 xi hw
4 篇 mcbride conor
4 篇 sheeran mary
4 篇 vafeiadis viktor
4 篇 weirich stephani...
4 篇 jeuring johan
4 篇 chlipala adam
4 篇 hudak paul
4 篇 keller gabriele
4 篇 findler robert b...
4 篇 walker david
3 篇 o'connor liam
3 篇 leshchinskiy rom...

语言

695 篇 英文
58 篇 其他
2 篇 葡萄牙文
2 篇 中文

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

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

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

详细简洁

排序：

OXenstored An Efficient Hierarchical and Transactional Database using functional programming with Reference Cell Comparisons

OXenstored An Efficient Hierarchical and Transactional Datab...

引用

14th acm sigplan international conference on functional programming

作者： Gazagnaire, thomas Hanquez, Vincent Citrix Syst Cambridge CB4 0FY England

ISBN: (纸本)9781605583327

We describe in this paper our implementation of the Xenstored service which is part of the XEN architecture. Xenstored maintains a hierarchical and transactional database, used for storing and managing configuration values. We demonstrate in this paper that mixing functional data-structures together with reference cell comparison, which is a limited form of pointer comparison, is: (i) safe;and (ii) efficient. this demonstration is based, first, on an axiomatization of operations on the treelike structure we used to represent the Xenstored database. From this axiomatization, we then derive an efficient algorithm for coalescing concurrent transactions modifying that structure. Finally, we experimentally compare the performance of our implementation, that we called OXenstored, and the C implementation of the Xenstored service distributed with the XEN hypervisor sources: the results show that OXenstored is much more efficient than its C counterpart. As a direct result of this work, OXenstored will be included in future releases of XENSERVER, the virtualization product distributed by Citrix Systems, where it will replace the current implementation of the Xenstored service.

关键词： Algorithms Design Performance Databases Transactions Concurrency Prefix Trees

来源：评论

学校读者我要写书评

暂无评论

Agda-curious? An exploration of programming with dependent types 12

Agda-curious? An exploration of programming with dependent t...

引用

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

作者： McBride, Conor thomas University of Strathclyde Glasgow United Kingdom

ISBN: (纸本)9781450310543

I explore programming with the dependently typed functional language, AGDA. I present the progress which AGDA has made, demonstrate its usage in a small development, reflect critically on the state of the art, and speculate about the way ahead. I do not seek to persuade you to adopt AGDA as your primary tool for systems development, but argue that AGDA stimulates new useful ways to think about programming problems and deserves not just curiosity but interest, support and contribution. © 2012 Author.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

An Optimizing Compiler for a Purely functional Web-Application Language 2015

An Optimizing Compiler for a Purely Functional Web-Applicati...

引用

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

作者： Chlipala, Adam MIT CSAIL Cambridge MA 02139 USA

ISBN: (纸本)9781450336697

High-level scripting languages have become tremendously popular for development of dynamic Web applications. Many programmers appreciate the productivity benefits of automatic storage management, freedom from verbose type annotations, and so on. While it is often possible to improve performance substantially by rewriting an application in C or a similar language, very few programmers bother to do so, because of the consequences for human development effort. this paper describes a compiler that makes it possible to have most of the best of both worlds, coding Web applications in a high-level language but compiling to native code with performance comparable to handwritten C code. the source language is Ur/Web, a domain-specific, purely functional, statically typed language for the Web. through a coordinated suite of relatively straightforward program analyses and algebraic optimizations, we transform Ur/Web programs into almost-idiomatic C code, with no garbage collection, little unnecessary memory allocation for intermediate values, etc. Our compiler is in production use for commercial Web sites supporting thousands of users, and microbenchmarks demonstrate very competitive performance versus mainstream tools.

关键词： Web programming languages pure functional programming whole-program optimization

来源：评论

学校读者我要写书评

暂无评论

Defunctionalized interpreters for programming languages 08

Defunctionalized interpreters for programming languages

引用

13th acm sigplan international conference on functional programming

作者： Danvy, Olivier Univ Aarhus Dept Comp Sci DK-8200 Aarhus N Denmark

ISBN: (纸本)9781595939197

this document illustrates how functional implementations of formal semantics ( structural operational semantics, reduction semantics, small-step and big-step abstract machines, natural semantics, and denotational semantics) can be transformed into each other. these transformations were foreshadowed by Reynolds in "Definitional Interpreters for Higher-Order programming Languages" for functional implementations of denotational semantics, natural semantics, and big-step abstract machines using closure conversion, CPS transformation, and defunctionalization. Over the last few years, the author and his students have further observed that functional implementations of small-step and of big-step abstract machines are related using fusion by fixed-point promotion and that functional implementations of reduction semantics and of small-step abstract machines are related using refocusing and transition compression. It furthermore appears that functional implementations of structural operational semantics and of reduction semantics are related as well, also using CPS transformation and defunctionalization. this further relation provides an element of answer to Felleisen's conjecture that any structural operational semantics can be expressed as a reduction semantics: for deterministic languages, a reduction semantics is a structural operational semantics in continuation style, where the reduction context is a defunctionalized continuation. As the defunctionalized counterpart of the continuation of a one-step reduction function, a reduction context represents the rest of the reduction, just as an evaluation context represents the rest of the evaluation since it is the defunctionalized counterpart of the continuation of an evaluation function.

关键词： relations between models big-step abstract machines context-sensitive reduction semantics continuations CPS transformation defunctionalization

来源：评论

学校读者我要写书评

暂无评论

Flask: Staged functional programming for sensor networks

Flask: Staged functional programming for sensor networks

引用

13th acm sigplan international conference on functional programming

作者： Mainland, Geoffrey Morrisett, Greg Welsh, Matt Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA

ISBN: (纸本)9781595939197

Severely resource-constrained devices present a confounding challenge to the functional programmer: we are used to having powerful abstraction facilities at our fingertips, but how can we make use of these tools on a device with an 8-or 16-bit CPU and at most tens of kilobytes of RAM? Motivated by this challenge, we have developed Flask, a domain specific language embedded in Haskell that brings the power of functional programming to sensor networks, collections of highly resource-constrained devices. Flask consists of a staging mechanism that cleanly separates node-level code from the meta-language used to generate node-level code fragments;syntactic support for embedding standard sensor network code;a restricted subset of Haskell that runs on sensor networks and constrains program space and time consumption;a higher-level "data stream" combinator library for quickly constructing sensor network programs;and an extensible runtime that provides commonly-used services. We demonstrate Flask through several small code examples as well as a compiler that generates node-level code to execute a network-wide query specified in a SQL-like language. We show how using Flask ensures constraints on space and time behavior. through microbenchmarks and measurements on physical hardware, we demonstrate that Flask produces programs that are efficient in terms of CPU and memory usage and that can run effectively on existing sensor network hardware.

关键词： languages design meta programming

来源：评论

学校读者我要写书评

暂无评论

Software is discrete mathematics 03

Software is discrete mathematics

引用

8th international conference on functional programming (ICFP 03)

作者： Page, RL Univ Oklahoma Sch Comp Sci Norman OK 73019 USA

ISBN: (纸本)9781581137569

A three-year study collected information bearing on the question of whether studying mathematics improves programming skills. An analysis of the data revealed significant differences in the programming effectiveness of two populations of students: (1) those who studied discrete mathematics through examples focused on reasoning about software and (2) those who studied the same mathematical topics illustrated with more traditional examples. functional programming played a central role in the study because it provides a straightforward framework for the presentation of concepts such as predicate logic and proof by induction. Such topics can be covered in depth, staying almost entirely within the context of reasoning about software. the intricate complexities in logic that mutable variables carry with them need not arise, early on, to confuse novices struggling to understand new ideas. In addition, because functional languages provide useful and compact ways to express mathematical concepts, and because the choice of notation in mathematics courses is often at the discretion of the instructor (in contrast to the notational restrictions often fiercely guarded by the faculty in programming courses), discrete mathematics courses, as they are found in most computer science programs, provide an easy opportunity to enhance the education of students by exposing them to functional programming concepts.

关键词： functional programming discrete mathematics predicate logic correctness proofs formal methods software engineering

来源：评论

学校读者我要写书评

暂无评论

Generic programming with Fixed Points for Mutually Recursive Datatypes

Generic Programming with Fixed Points for Mutually Recursive...

引用

14th acm sigplan international conference on functional programming

作者： Yakushev, Alexey Rodriguez Holderrnans, Stefan Loh, Andres Jeuring, Johan Vector Fabr BV NL-5611 KN Eindhoven Netherlands

ISBN: (纸本)9781605583327

Many datatype-generic functions need access to the recursive positions in the structure of the datatype, and therefore adopt a fixed point view on datatypes. Examples include variants of fold that traverse the data following the recursive structure, or the Zipper data structure that enables navigation along the recursive positions. However, Hindley-Milner-inspired type systems with algebraic datatypes make it difficult to express fixed points for anything but regular datatypes. Many real-life examples such as abstract syntax trees are in fact systems of mutually recursive datatypes and therefore excluded. Using Haskell's GADTs and type families, we describe a technique that allows a fixed-point view for systems of mutually recursive datatypes. We demonstrate that our approach is widely applicable by giving several examples of generic functions for this view, most prominently the Zipper.

关键词： Design Languages

来源：评论

学校读者我要写书评

暂无评论

Understanding aspects (extended abstract)

Understanding aspects (extended abstract)

引用

8th international conference on functional programming (ICFP 03)

作者： Wand, M Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA

To the extent that modular reasoning forms the conceptual foundation for good software engineering principles, the failure of modular reasoning in current aspect-oriented programming (AOP) systems is cause for concern. this paper discusses a reconceptualization of AOP that will allow an eventual reconciliation between AOP and modular reasoning.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：