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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 临床医学

主题

105 篇 functional progr...
66 篇 languages
64 篇 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
13 篇 domain-specific ...
13 篇 semantics
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

语言

642 篇 英文
55 篇 其他
2 篇 法文
2 篇 葡萄牙文
2 篇 中文

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

共 703 条记录，以下是431-440 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Safe functional Reactive programming through Dependent Types

Safe Functional Reactive Programming through Dependent Types

引用

14th acm sigplan international conference on functional programming

作者： Sculthorpe, Neil Nilsson, Henrik Univ Nottingham Sch Comp Sci Nottingham NG7 2RD England

ISBN: (纸本)9781605583327

functional Reactive programming (FRP) is an approach to reactive programming where systems are structured as networks of functions operating on signals. FRP is based on the synchronous data-flow paradigm and supports both continuous-time and discrete-time signals (hybrid systems). What sets FRP apart from Most other languages for similar applications is its support for systems with dynamic structure and for higher-order reactive constructs. Statically guaranteeing correctness properties of programs is an attractive proposition. this is true in particular for typical application domains for reactive programming such as embedded systems. To that end, many existing reactive languages have type systems or other static checks that guarantee domain-specific properties, such as feedback loops always being well-formed. However, they are limited in their capabilities to support dynamism and higher-order data-flow compared with FRP. thus, the onus of ensuring such properties of FRP programs has so far been on the programmer as established static techniques do not suffice. In this paper, we show how dependent types allow this concern to be addressed. We present an implementation of FRP embedded in the dependently-typed language Agda, leveraging the type system of the host language to craft a domain-specific (dependent) type system for FRP. the implementation constitutes a discrete, operational semantics of FRP, and as it passes the Agda type, coverage, and termination checks, we know the operational semantics is total, which means our type system is safe.

关键词： dependent types domain-specific languages DSELs FRP functional programming reactive programming synchronous data-flow

来源：评论

学校读者我要写书评

暂无评论

Causal Commutative Arrows and their Optimization

Causal Commutative Arrows and Their Optimization

引用

14th acm sigplan international conference on functional programming

作者： Liu, Hai Cheng, Eric Hudak, Paul Yale Univ Dept Comp Sci New Haven CT 06520 USA

ISBN: (纸本)9781605583327

Arrows are a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in particular are a good abstraction for signal processing and dataflow computations. Most notably, arrows form the basis for a domain specific language called Yampa, which has been used in a variety of concrete applications, including animation, robotics, sound synthesis, control systems, and graphical user interfaces. Our primary interest is in better understanding the class of abstract computations captured by Yampa. Unfortunately, arrows are not concrete enough to do this with precision. To remedy this situation we introduce the concept of commutative arrows that capture a kind of non-interference property of concurrent computations. We also add an init operator, and identify a crucial law that captures the causal nature of arrow effects. We call the resulting computational model causal commutative arrows. To study this class of computations in more detail, we define an extension to the simply typed lambda calculus called causal commutative arrows (CCA), and study its properties. Our key contribution is the identification of a normal form for CCA called causal commutative normal form (CCNF). By defining a normalization procedure we have developed an optimization strategy that yields dramatic improvements in performance over conventional implementations of arrows. We have implemented this technique in Haskell, and conducted benchmarks that validate the effectiveness of our approach. When combined with stream fusion, the overall methodology can result in speed-ups of greater than two orders of magnitude.

关键词： Languages Performance theory functional programming Arrows functional Reactive programming Dataflow Language Stream Processing Program Optimization

来源：评论

学校读者我要写书评

暂无评论

Attribute Grammars Fly First-Class How to do Aspect Oriented programming in Haskell

Attribute Grammars Fly First-Class How to do Aspect Oriented...

引用

14th acm sigplan international conference on functional programming

作者： Viera, Marcos Swierstra, S. Doaitse Swierstra, Wouter Univ Republica Inst Computac Montevideo Uruguay

ISBN: (纸本)9781605583327

Attribute Grammars (AGs), a general-purpose formalism for describing recursive computations over data types, avoid the trade-off which arises when building software incrementally: should it be easy to add new data types and data type alternatives or to add new operations on existing data types? However, AGs are usually implemented as a pre-processor, leaving e.g. type checking to later processing phases and making interactive development, proper error reporting and debugging difficult. Embedding AG into Haskell as a combinator library solves these problems. Previous attempts at embedding AGs as a domain-specific language were based on extensible records and thus exploiting Haskell's type system to check the well-formedness of the AG, but fell short in compactness and the possibility to abstract over oft occurring AG patterns. Other attempts used a very generic mapping for which the AG well-formedness could not be statically checked. We present a typed embedding of AG in Haskell satisfying all these requirements. the key lies in using HList-like typed heterogeneous collections (extensible polymorphic records) and expressing AG well-formedness conditions as type-level predicates (i.e., type-class constraints). By further type-level programming we can also express common programming patterns, corresponding to the typical use cases of monads such as Reader, Writer and State. the paper presents a realistic example of type-class-based type-level programming in Haskell.

关键词： Attribute Grammars Class system Lazy evaluation Type-level programming Haskell HList

来源：评论

学校读者我要写书评

暂无评论

Effective Interactive Proofs for Higher-Order Imperative Programs

Effective Interactive Proofs for Higher-Order Imperative Pro...

引用

14th acm sigplan international conference on functional programming

作者： Chlipala, Adam Malecha, Gregory Morrisett, Greg Shinnar, Avraham Wisnesky, Ryan Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781605583327

We present a new approach for constructing and verifying higher-order, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is based on Hoare Type theory. that original system was a proof of concept, where every program verification was accomplished via laborious manual proofs, with much code devoted to uninteresting low-level details. In this paper, we present a re-implementation of Ynot which makes it possible to implement fully-verified, higher-order imperative programs with reasonable proof burden. At the same time, our new system is implemented entirely in Coq source files, showcasing the versatility of that proof assistant as a platform for research on language design and verification. Both versions of the system have been evaluated with case studies in the verification of imperative data structures, such as hash tables with higher-order iterators. the verification burden in our new system is reduced by at least an order of magnitude compared to the old system, by replacing manual proof with automation. the core of the automation is a simplification procedure for implications in higher-order separation logic, with hooks that allow programmers to add domain-specific simplification rules. We argue for the effectiveness of our infrastructure by verifying a number of data structures and a packrat parser, and we compare to similar efforts within other projects. Compared to competing approaches to data structure verification, our system includes much less code that must be trusted;namely, about a hundred lines of Coq code defining a program logic. All of our theorems and decision procedures have or build machine-checkable correctness proofs from first principles, removing opportunities for tool bugs to create faulty verifications.

关键词： functional programming interactive proof assistants dependent types separation logic

来源：评论

学校读者我要写书评

暂无评论

Partial Memoization of Concurrency and Communication

Partial Memoization of Concurrency and Communication

引用

14th acm sigplan international conference on functional programming

作者： Ziarek, Lukasz Sivararnakrishnan, K. C. Jagannathan, Suresh Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

ISBN: (纸本)9781605583327

Memoization is a well-known optimization technique used to eliminate redundant calls for pure functions. If a call to a function f with argument 1, yields result r, a subsequent call to f with v can be immediately reduced to r without the need to re-evaluate f's body. Understanding memoization in the presence of concurrency and communication is significantly more challenging. For example, if f communicates with other threads, it is not sufficient to simply record its input/output behavior;we must also track inter-thread dependencies induced by these communication actions. Subsequent calls to f can be elided only if we can identify an interleaving of actions from these call-sites that lead to states in which these dependencies are satisfied. Similar issues arise if f spawns additional threads. In this paper, we consider the memoization problem for a higher-order concurrent language whose threads may communicate through synchronous message-based communication. To avoid the need to perform unbounded state space search that may be necessary to determine if all communication dependencies manifest in an earlier call can be satisfied in a later one, we introduce a weaker notion of memoization called partial memoization that gives implementations the freedom to avoid performing some part, if not all, of a previously memoized call. To validate the effectiveness of our ideas, we consider the benefits of memoization for reducing the overhead of recomputation for streaming, server-based, and transactional applications executed on a multi-core machine. We show that on a variety of workloads, memoization can lead to substantial performance improvements without incurring high memory costs.

关键词： Concurrent programming Partial Memoization Software Transactions Concurrent ML Multicore Systems

来源：评论

学校读者我要写书评

暂无评论

引用

15th acm SIGKDD international conference on Knowledge Discovery and Data Mining

作者： Nijssen, Siegfried Guns, Tias De Raedt, Luc Katholieke Univ Leuven Louvain Belgium

ISBN: (纸本)9781605584959

Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting correlation measures in ROC space and formulating correlated itemset mining as a constraint programming problem, we obtain new theoretical insights with practical benefits. More specifically, we contribute 1) an improved bound for correlated itemset miners, 2) a novel iterative pruning algorithm to exploit the bound, and 3) an adaptation of this algorithm to mine all itemsets on the convex hull in ROC space. the algorithm does not depend on a minimal frequency threshold and is shown to outperform several alternative approaches by orders of magnitude, both in runtime and in memory requirements.

关键词： Itemset Mining Constraint programming ROC Analysis

来源：评论

学校读者我要写书评

暂无评论

A Type System for functional Traversal-Based Aspects

A Type System for Functional Traversal-Based Aspects

引用

8th international conference on Aspect-Oriented Software Development

作者： Chadwick, Bryan Lieberherr, Karl Northeastern Univ Coll Comp & Informat Sci Boston MA 02115 USA

ISBN: (纸本)9781605584423

We present a programming language model of the ideas behind functional Adaptive programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in sets of functions that implement a fold over a data structure with the help of a generic traversal. In this paper we define the syntax, semantics, and typing rules of a simple AP-F model, together with a proof of soundness that guarantees that traversal expressions result in a value of the expected type. Applying a function set to a different structure can then be statically checked to eliminate some runtime tests and sources of program errors.

关键词： Adaptive programming functional Aspects Traversals Type Soundness

来源：评论

学校读者我要写书评

暂无评论

Response Time Analysis for the Abort-and-Restart Event Handlers of the Priority-Based functional Reactive programming (P-FRP) Paradigm

Response Time Analysis for the Abort-and-Restart Event Handl...

引用

15th IEEE international conference on Embedded and Real-Time Computing Systems and Applications

作者： Ras, J. Cheng, Albert M. K. Univ Houston Dept Comp Sci Houston TX 77004 USA

ISBN: (纸本)9780769537870

programming microcontrollers is a different paradigm from microprocessor programming. the traditional way to program microcontrollers is to write the program in C or an assembly language, but modern embedded systems are more complex. the Priority-based functional Reactive programming (P-FRP) paradigm could make microcontroller programming better P-FRP makes it possible to treat programs as functions (stateless) and amenable to proofs and type-safety. In this paper we focus on the abort-and-restart event handler semantics of P-FRP, which is neither a concurrency control policy nor a true scheduling policy. Instead, it is a policy in which the most important task is scheduled first. this paper alines the response time analysis for the abort-and-restart model on single-core systems.*

关键词： Concurrency control

来源：评论

学校读者我要写书评

暂无评论

Computational Error Handling as Aspects: A Case Study

Computational Error Handling as Aspects: A Case Study

引用

Practices of Linking Aspect Technology and Evolution Workshop held at the 8th international conference on Aspect-Oriented Software Development

作者： Cui, Zhanqi Wang, Linzhang Liu, Huigen Li, Xuandong Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Jiangsu Peoples R China

ISBN: (纸本)9781605584423

Computational error handling is vitally important in scientific computing programs. Traditional approaches tangle the error handling concerns with the primary functional codes. this paper describes our empirical study of using AspectJ to refactor a real-world Satellite Orbit Forecasting (SOF) system, and assesses the experiences gained from applying aspect-oriented techniques. the result shows that the AspectJ version improves the modularity and maintainability of the program by encapsulating computational error handling polices as aspects without noticeable compromise in performance.

关键词： aspect-oriented programming computational error handling scientific computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共71页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：