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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是371-380 订阅

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

详细简洁

排序：

Incremental Updates for Efficient Bidirectional Transformations 11

Incremental Updates for Efficient Bidirectional Transformati...

引用

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

作者： Wang, Meng Gibbons, Jeremy Wu, Nicolas Chalmers Univ Technol S-41296 Gothenburg Sweden

ISBN: (纸本)9781450308656

A bidirectional transformation is a pair of mappings between source and view data objects, one in each direction. When the view is modified, the source is updated accordingly. the key to handling large data objects that are subject to relatively small modifications is to process the updates incrementally. Incrementality has been explored in the semi-structured settings of relational databases and graph transformations;this flexibility in structure makes it relatively easy to divide the data into separate parts that can be transformed and updated independently. the same is not true if the data is to be encoded with more general-purpose algebraic datatypes, with transformations defined as functions: dividing data into well-typed separate parts is tricky, and recursions typically create inter-dependencies. In this paper, we study transformations that support incremental updates, and devise a constructive process to achieve this incrementality.

关键词： functional programming Bidirectional programming Incremental Computing Program Transformation View-update Problem

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

functional Modelling of Musical Harmony An experience report 11

Functional Modelling of Musical Harmony An experience report

引用

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

作者： Magalhaes, Jose Pedro de Haas, W. Bas Univ Utrecht Dept Informat & Comp Sci NL-3508 TB Utrecht Netherlands

ISBN: (纸本)9781450308656

Music theory has been essential in composing and performing music for centuries. Within Western tonal music, from the early Baroque on to modern-day jazz and pop music, the function of chords within a chord sequence can be explained by harmony theory. Although Western tonal harmony theory is a thoroughly studied area, formalising this theory is a hard problem. We present a formalisation of the rules of tonal harmony as a Haskell (generalized) algebraic datatype. Given a sequence of chord labels, the harmonic function of a chord in its tonal context is automatically derived. For this, we use several advanced functional programming techniques, such as type-level computations, datatype-generic programming, and error-correcting parsers. As a detailed example, we show how our model can be used to improve content-based retrieval of jazz songs. We explain why Haskell is the perfect match for these tasks, and compare our implementation to an earlier solution in Java. We also point out shortcomings of the language and libraries that limit our work, and discuss future developments which may ameliorate our solution.

关键词： haskell music tonal harmony datatype-generic programming modelling

来源：评论

学校读者我要写书评

暂无评论

Binders Unbound 11

Binders Unbound

引用

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

作者： Weirich, Stephanie Yorgey, Brent A. Sheard, Tim Univ Penn Philadelphia PA 19104 USA Portland State Univ Portland OR 97207 USA

ISBN: (纸本)9781450308656

Implementors of compilers, program refactorers, theorem provers, proof checkers, and other systems that manipulate syntax know that dealing with name binding is difficult to do well. Operations such as alpha-equivalence and capture-avoiding substitution seem simple, yet subtle bugs often go undetected. Furthermore, their implementations are tedious, requiring "boilerplate" code that must be updated whenever the object language definition changes. Many researchers have therefore sought to specify binding syntax declaratively, so that tools can correctly handle the details behind the scenes. this idea has been the inspiration for many new systems (such as Beluga, Delphin, FreshML, FreshOCaml, C alpha ml, FreshLib, and Ott) but there is still room for improvement in expressivity, simplicity and convenience. In this paper, we present a new domain-specific language, UNBOUND, for specifying binding structure. Our language is particularly expressive-it supports multiple atom types, pattern binders, type annotations, recursive binders, and nested binding (necessary for telescopes, a feature found in dependently-typed languages). However, our specification language is also simple, consisting of just five basic combinators. We provide a formal semantics for this language derived from a locally nameless representation and prove that it satisfies a number of desirable properties. We also present an implementation of our binding specification language as a GHC Haskell library implementing an embedded domain specific language (EDSL). By using Haskell type constructors to represent binding combinators, we implement the EDSL succinctly using datatype-generic programming. Our implementation supports a number of features necessary for practical programming, including flexibility in the treatment of user-defined types, best-effort name preservation (for error messages), and integration with Haskell's monad transformer library.

关键词： Algorithms Languages generic programming Haskell name binding patterns

来源：评论

学校读者我要写书评

暂无评论

Temporal Higher-Order Contracts 11

Temporal Higher-Order Contracts

引用

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

作者： Disney, Tim Flanagan, Cormac McCarthy, Jay Univ Calif Santa Cruz Santa Cruz CA 95064 USA

ISBN: (纸本)9781450308656

Behavioral contracts are embraced by software engineers because they document module interfaces, detect interface violations, and help identify faulty modules (packages, classes, functions, etc). this paper extends prior higher-order contract systems to also express and enforce temporal properties, which are common in software systems with imperative state, but which are mostly left implicit or are at best informally specified. the paper presents both a programmatic contract API as well as a temporal contract language, and reports on experience and performance results from implementing these contracts in Racket. Our development formalizes module behavior as a trace of events such as function calls and returns. Our contract system provides both non-interference (where contracts cannot influence correct executions) and also a notion of completeness (where contracts can enforce any decidable, prefix-closed predicate *** traces).

关键词： Higher-order programming Temporal Contracts

来源：评论

学校读者我要写书评

暂无评论

Making Standard ML a Practical Database programming Language 11

Making Standard ML a Practical Database Programming Language

引用

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

作者： Ohori, Atsushi Ueno, Katsuhiro Tohoku Univ Elect Commun Res Inst Sendai Miyagi 980 Japan

ISBN: (纸本)9781450308656

Integrating a database query language into a programming language is becoming increasingly important in recently emerging high-level cloud computing and other applications, where efficient and sophisticated data manipulation is required during computation. this paper reports on seamless integration of SQL into SML# - an extension of Standard ML. In the integrated language, the type system always infers a principal type for any type consistent SQL expression. this makes SQL queries first-class citizens, which can be freely combined with any other language constructs definable in Standard ML. For a program involving SQL queries, the compiler separates SQL queries and delegates their evaluation to a database server, e.g. PostgreSQL or MySQL in the currently implemented version. the type system of our language is largely based on Machiavelli, which demonstrates that ML with record polymorphism can represent type structure of SQL. In order to develop a practical language, however, a number of technical challenges have to be overcome, including static enforcement of server connection consistency, proper treatment of overloaded SQL primitives, query compilation, and runtime connection management. this paper describes the necessary extensions to the type system and compilation, and reports on the details of its implementation.

关键词： SQL Polymorphism Type System Interoperability SML#

来源：评论

学校读者我要写书评

暂无评论

Forest: A Language and Toolkit for programming with Filestores 11

Forest: A Language and Toolkit for Programming with Filestor...

引用

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

作者： Fisher, Kathleen Foster, Nate Walker, David Zhu, Kenny Q. Tufts Univ Medford MA 02155 USA

ISBN: (纸本)9781450308656

A filestore is a structured collection of data files housed in a conventional hierarchical file system. Many applications use filestores as a poor-man's database, and the correct execution of these applications requires that the collection of files, directories, and symbolic links stored on disk satisfy a variety of precise invariants. Moreover, all of these structures must have acceptable ownership, permission, and timestamp attributes. Unfortunately, current programming languages do not provide support for documenting assumptions about filestores, detecting errors in them, or safely loading from and storing to them. this paper describes the design, implementation, and semantics of Forest, a new domain-specific language for describing filestores. the language uses a type-based metaphor to specify the expected structure, attributes, and invariants of filestores. Forest generates loading and storing functions that make it easy to connect data on disk to an isomorphic representation in memory that can be manipulated as if it were any other data structure. Forest also generates metadata that describes the degree to which the structures on the disk conform to the specification, making error detection easy. In a nutshell, Forest extends the rigorous discipline of typed programming languages to the untyped world of file systems. We have implemented Forest as an embedded domain-specific language in Haskell. In addition to generating infrastructure for reading, writing and checking file systems, our implementation generates type class instances that make it easy to build generic tools that operate over arbitrary filestores. We illustrate the utility of this infrastructure by building a file system visualizer, a file access checker, a generic query interface, description-directed variants of several standard UNIX shell tools and (circularly) a simple Forest description inference engine. Finally, we formalize a core fragment of Forest in a semantics inspired by classical tree

关键词： Data description languages file systems filestores domain-specific languages ad hoc data Haskell bidirectional transformations generic programming

来源：评论

学校读者我要写书评

暂无评论

Secure Distributed programming with Value-Dependent Types 11

Secure Distributed Programming with Value-Dependent Types

引用

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

作者： Swamy, Nikhil Chen, Juan Fournet, Cedric Strub, Pierre-Yves Bhargavan, Karthikeyan Yang, Jean Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781450308656

Distributed applications are difficult to program reliably and securely. Dependently typed functional languages promise to prevent broad classes of errors and vulnerabilities, and to enable program verification to proceed side-by-side with development. However, as recursion, effects, and rich libraries are added, using types to reason about programs, specifications, and proofs becomes challenging. We present F-star, a full-fledged design and implementation of a new dependently typed language for secure distributed programming. Unlike prior languages, F-star provides arbitrary recursion while maintaining a logically consistent core;it enables modular reasoning about state and other effects using affine types;and it supports proofs of refinement properties using a mixture of cryptographic evidence and logical proof terms. the key mechanism is a new kind system that tracks several sub-languages within F-star and controls their interaction. F-star subsumes two previous languages, F7 and Fine. We prove type soundness (with proofs mechanized in Coq) and logical consistency for F-star. We have implemented a compiler that translates F-star to NET bytecode, based on a prototype for Fine. F-star provides access to libraries for concurrency, networking, cryptography, and interoperability with C#, F#, and the other .NET languages. the compiler produces verifiable binaries with 60% code size overhead for proofs and types, as much as a 45x improvement over the Fine compiler, while still enabling efficient bytecode verification. To date, we have programmed and verified more than 20,000 lines of F-star including (1) new schemes for multi-party sessions;(2) a zero-knowledge privacy-preserving payment protocol;(3) a provenance-aware curated database;(4) a suite of 17 web-browser extensions verified for authorization properties;and (5) a cloud-hosted multi-tier web application with a verified reference monitor.

关键词： Security type systems refinement types

来源：评论

学校读者我要写书评

暂无评论

Using Aspect-Orientation to Simplify Concurrent programming 11

Using Aspect-Orientation to Simplify Concurrent Programming

引用

10th international conference on Aspect-Oriented Software Development (AOSD)

作者： Hohenstein, Uwe Gleim, Urs Siemens AG CT T DE IT 1 Otto Hahn Ring 6 D-81730 Munich Germany

ISBN: (纸本)9781450305563

the Java programming language offers several basic constructs for concurrent programming. Despite covering everything needed from a functional point of view, the constructs are difficult to use since they require a lot of infrastructural statements besides the real logic. this makes concurrent programming error-prone and difficult to reuse. It seems that abstractions are needed to ease the pain and to better support reusability. this paper explores how to use and benefit from aspect-orientation (AO), particularly the AspectJ language, in this respect. AO promises a high potential for reuse due to a higher level of modularization since crosscutting concerns can better be modularized in aspects. this paper confirms higher reuse by presenting a collection of reusable aspects for solving specific problems in concurrent programming. Having AspectJ-based implementations for recurring problems, this paper also summarizes some interesting experiences and takes the chance to present an industrial view on some criticisms of aspect-orientation.

关键词： Aspect-Orientation AspectJ Crosscutting Concern Case Study Concurrent programming Modularity

来源：评论

学校读者我要写书评

暂无评论

StoryTrek: Experiencing stories in the real world

StoryTrek: Experiencing stories in the real world

引用

15th international Academic MindTrek conference: Envisioning Future Media Environments, MindTrek 2011

作者： Khaled, Rilla Barr, Pippin Greenspan, Brian Biddle, Robert Vist, Elise IT University of Copenhagen Copenhagen Denmark Carleton University Ottawa ON Canada

ISBN: (纸本)9781450308168

In this paper we introduce StoryTrek, a locative hypernarrative system developed to generate stories based on a reader's location and specific movements in the real world. this creates, for readers, an interplay between navigation, narrative, and agency, as well as between the fictional and real world experience. In early tests we observed the emergence of a number of recurrent themes in participants' experiences which are characteristic of the StoryTrek system, but which also help us to understand locative media storytelling affordances more generally. In this paper we present the system itself, along with initial thematic observations concerning agency, role play, reflection, and shared experience. © 2011 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共71页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：