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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

主题

106 篇 functional progr...
66 篇 languages
63 篇 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
14 篇 semantics
13 篇 domain-specific ...
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

语言

640 篇 英文
57 篇 其他
2 篇 法文
2 篇 葡萄牙文
2 篇 中文

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

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

CLOP: A Multi-stage Compiler to Seamlessly Embed Heterogeneous Code 2015

CLOP: A Multi-stage Compiler to Seamlessly Embed Heterogeneo...

引用

14th acm sigplan international conference on Generative-programming - Concepts and Experiences (GPCE) co-located with SPLASH conference

作者： Makarov, Dmitri Hauswirth, Matthias Univ Svizzera Italiana Lugano Switzerland

ISBN: (纸本)9781450336871

Heterogeneous programming complicates software development. We present CLOP, a platform that embeds code targeting heterogeneous compute devices in a convenient and clean way, allowing unobstructed data flow between the host code and the devices, reducing the amount of source code by an order of magnitude. the CLOP compiler uses the standard facilities of the D programming language to generate code strictly at compile-time. In this paper we describe the CLOP language and the CLOP compiler implementation.

关键词： Heterogeneous programming Embedded Languages Staging

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Developing a Monadic Type Checker for an Object-Oriented Language: An Experience Report 12

Developing a Monadic Type Checker for an Object-Oriented Lan...

引用

12th acm sigplan international conference on Software Language Engineering (SLE)

作者： Castegren, Elias Fernandez-Reyes, Kiko KTH Royal Inst Technol Software & Comp Syst Stockholm Sweden Uppsala Univ Informat Technol Uppsala Sweden

ISBN: (纸本)9781450369817

functional programming languages are well-suited for developing compilers, and compilers for functional languages are often themselves written in a functional language. functional abstractions, such as monads, allow abstracting away some of the repetitive structure of a compiler, removing boilerplate code and making extensions simpler. Even so, functional languages are rarely used to implement compilers for languages of other paradigms. this paper reports on the experience of a four-year long project where we developed a compiler for a concurrent, object-oriented language using the functional language Haskell. the focus of the paper is the implementation of the type checker, but the design works well in static analysis tools, such as tracking uniqueness of variables to ensure data-race freedom. the paper starts from a simple type checker to which we add more complex features, such as type state, with minimal changes to the overall initial design.

关键词： functional programming object-oriented languages type systems compilers

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Facets of Dynamic Policies 38

Design and Implementation of Facets of Dynamic Policies

引用

38th international conference on Systems, programming, Languages, and Applications: Software for Humanity (SPLASH)

作者： Zegarelli, Antonio IMDEA Software Inst Madrid Spain

ISBN: (纸本)9798400703843

Information Flow Control (IFC) in dynamic contexts is challenging due to different interpretations of security that arise. this paper introduces a modular framework to address this challenge. We present a dynamic floating-label enforcement mechanism that can be instantiated based on the intended security. Our approach formalizes a simply typed lambda-calculus, extended with IFC operations, and adopts an epistemic perspective on security definition.

关键词： Information flowcontrol dynamic policies facets of dynamic policies security haskell functional programming

来源：评论

学校读者我要写书评

暂无评论

functional automatic differentiation with Dirac impulses 03

Functional automatic differentiation with Dirac impulses

引用

8th international conference on functional programming (ICFP 03)

作者： Nilsson, H Yale Univ Dept Comp Sci New Haven CT 06520 USA

ISBN: (纸本)9781581137569

functional Reactive programming (FRP) is a framework for reactive programming in a functional setting. FRP has been applied to a number of domains, such as graphical animation, graphical user interfaces, robotics, and computer vision. Recently, we have been interested in applying FRP-like principles to hybrid modeling and simulation of physical systems. As a step in that direction, we have extended an existing FRP implementation, Yampa, in two new ways that make it possible to express certain models in a very natural way, and reduces the amount of work needed to put modeling equations into a suitable form for simulation. First, we have added Dirac impulses that allow certain types of discontinuities to be handled in an easy yet rigorous manner. Second, we have adapted automatic differentiation to the setting of Yampa, and generalized it to work correctly with Dirac impulses. this allows derivatives of piecewise continuous signals to be well-defined at all points. this paper reviews the basic ideas behind automatic differentiation, in particular Jerzy Karczmarczuk's elegant version for a lazy functional language with overloading, and then considers the integration with Yampa and the addition of Dirac impulses.

关键词： FRP Haskell functional programming synchronous dataflow languages modeling languages hybrid modeling automatic differentiation distribution theory Dirac impulses

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Dependent type providers

Dependent type providers

引用

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

作者： Christiansen, David Raymond IT University of Copenhagen Denmark

ISBN: (纸本)9781450323895

Type providers [16], pioneered in the F# programming language, are a practical and powerful means of gaining the benefits of a modern static type system when working with data schemas that are defined outside of the programming language, such as relational databases. F# type providers are implemented using a form of compile-time code generation, which requires the compiler to expose an internal API and can undermine type safety. We show that with dependent types it is possible to define a type provider mechanism that does not rely on code generation. Using this mechanism, a type provider becomes a kind of generic program that is instantiated for a particular external schema, which can be represented using an ordinary datatype. Because these dependent type providers use the ordinary abstraction mechanisms of the type system, they preserve its safety properties. We evaluate the practicality of this technique and explore future extensions.

关键词： Ada (programming language)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：