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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

562 篇 会议
64 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

516 篇 工学
- 438 篇 软件工程
- 374 篇 计算机科学与技术...
- 36 篇 电气工程
- 34 篇 控制科学与工程
- 11 篇 信息与通信工程
- 3 篇 建筑学
- 3 篇 农业工程
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 土木工程
- 2 篇 交通运输工程
48 篇 理学
- 41 篇 数学
- 3 篇 物理学
- 3 篇 生物学
- 3 篇 统计学（可授理学、...
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 地质学
30 篇 管理学
- 16 篇 管理科学与工程(可...
- 14 篇 图书情报与档案管...
- 5 篇 工商管理
18 篇 教育学
- 18 篇 教育学
- 1 篇 心理学(可授教育学...
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
3 篇 农学
- 3 篇 作物学

主题

98 篇 functional progr...
83 篇 languages
53 篇 design
49 篇 computer program...
32 篇 haskell
26 篇 programming
25 篇 computer program...
21 篇 performance
20 篇 object oriented ...
19 篇 dependent types
19 篇 theory
17 篇 functional react...
15 篇 programming lang...
14 篇 algorithms
13 篇 parallel program...
12 篇 domain-specific ...
12 篇 generic programm...
12 篇 verification
12 篇 meta-programming
11 篇 continuations

机构

7 篇 portland state u...
7 篇 chalmers univ te...
6 篇 northeastern uni...
6 篇 microsoft res ca...
5 篇 inria
4 篇 carnegie mellon ...
4 篇 univ penn philad...
3 篇 ecole polytech f...
3 篇 indiana univ blo...
3 篇 univ edinburgh e...
3 篇 univ strathclyde...
3 篇 univ new s wales...
3 篇 carnegie mellon ...
3 篇 univ cambridge c...
3 篇 univ british col...
3 篇 univ utah salt l...
3 篇 univ washington ...
3 篇 yale univ dept c...
3 篇 stanford univ st...
3 篇 brown univ provi...

作者

5 篇 flatt matthew
5 篇 jeuring johan
5 篇 jones mark p.
5 篇 krishnaswami nee...
4 篇 xi hw
4 篇 mcbride conor
4 篇 vafeiadis viktor
4 篇 weirich stephani...
4 篇 claessen koen
4 篇 chlipala adam
4 篇 dreyer derek
4 篇 keller gabriele
4 篇 findler robert b...
4 篇 walker david
3 篇 dolstra eelco
3 篇 loh andres
3 篇 leshchinskiy rom...
3 篇 yoshida nobuko
3 篇 pottier francois
3 篇 devriese dominiq...

语言

570 篇 英文
51 篇 其他
3 篇 中文
2 篇 法文
2 篇 葡萄牙文

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

共 628 条记录，以下是101-110 订阅

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

详细简洁

排序：

Combining programming with theorem proving 05

Combining programming with theorem proving

引用

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

作者： Chen, CY Xi, HW Boston Univ Boston MA 02215 USA

ISBN: (纸本)9781595930644

Applied Type System (ATS) is recently proposed as a framework for designing and formalizing (advanced) type systems in support Of practical programming. In ATS, the definition of type equality involves a constraint relation, which may or may not be algorithmically decidable. To support practical programming, we adopted a design in the past that imposes certain restrictions on the syntactic form of constraints so that some effective means can be found for solving constraints automatically. Evidently, this is a rather ad hoc design in its nature. In this paper, we rectify the situation by presenting a fundamentally different design, which we claim to be both novel and practical. Instead of imposing syntactical restrictions on constraints, we provide a means for the programmer to construct proofs that attest to the validity of constraints. In particular, we are to accommodate a programming paradigm that enables the programmer to combine programming with theorem proving. Also we present some concrete examples in support of the practicality of this design.

关键词： languages verification ATS Applied Type System dependent types proof erasure theorem proving

来源：评论

学校读者我要写书评

暂无评论

A language-based approach to functionally correct imperative programming 05

A language-based approach to functionally correct imperative...

引用

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

作者： Westbrook, E Stump, A Wehrman, I Washington Univ St Louis MO 63130 USA

ISBN: (纸本)9781595930644

In this paper a language-based approach to functionally correct imperative programming is proposed. the approach is based on a programming language called RSP1, which combines dependent types, general recursion, and imperative features in a type-safe way, while preserving decidability of type checking. the methodology used is that of internal verification, where programs manipulate programmer-supplied proofs explicitly as data. the fundamental technical idea of RSP1 is to identify problematic operations as impure, and keep them out of dependent types. the resulting language is powerful enough to verify statically non-trivial properties of imperative and functional programs. the paper presents the ideas through the examples of statically verified merge sort, statically verified imperative binary search trees, and statically verified directed acyclic graphs.

关键词： dependent types program verification RSP RSP1

来源：评论

学校读者我要写书评

暂无评论

DSLs in Racket: YouWant It How, Now? 17

DSLs in Racket: YouWant It How, Now?

引用

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

作者： Lee, Yunjeong Gopinathan, Kiran Yang, Ziyi Flatt, Matthew Sergey, Ilya Natl Univ Singapore Singapore Singapore Univ Utah Salt Lake City UT USA

ISBN: (纸本)9798400711800

Domain-Specific Languages (DSLs) are a popular way to simplify and streamline programmatic solutions of commonly occurring yet specialized tasks. While the design of frameworks for implementing DSLs has been a popular topic of study in the research community, significantly less attention has been given to studying how those frameworks end up being used by practitioners and assessing utility of their features for building DSLs "in the wild". In this paper, we conduct such a study focusing on a particular framework for DSL construction: the Racket programming language. We provide (a) a novel taxonomy of language design intents enabled by Racket-embedded DSLs, and (b) a classification of ways to utilize Racket's mechanisms that make the implementation of those intents possible. We substantiate our taxonomy with an analysis of 30 popular Racket-based DSLs, discussing how they make use of the available mechanisms and accordingly achieve their design intents. the taxonomy serves as a reusable measure that can help language designers to systematically develop, compare, and analyze DSLs in Racket as well as other frameworks.

关键词： domain-specific languages meta-programming

来源：评论

学校读者我要写书评

暂无评论

AURA: A programming Language for Authorization and Audit

AURA: A Programming Language for Authorization and Audit

引用

13th acm sigplan international conference on functional programming

作者： Jia, Limin Vaughan, Jeffrey A. Mazurak, Karl Zhao, Jianzhou Zarko, Luke Schorr, Joseph Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781595939197

this paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic constructs (e.g., principals and access control policies) in a uniform way. AURA is based on polymorphic DCC and uses dependent types to permit assertions that refer directly to AURA values while keeping computation out of the assertion level to ensure tractability. the main technical results of this paper include fully mechanically verified proofs of the decidability and soundness for AURA's type system, and a prototype typechecker and interpreter.

关键词： Access control Authorization logic Audit Type systems

来源：评论

学校读者我要写书评

暂无评论

Meta-programming through typeful code representation 03

Meta-programming through typeful code representation

引用

8th international conference on functional programming (ICFP 03)

作者： Chen, CY Xi, HW Boston Univ Comp Sci Dept Boston MA 02215 USA

ISBN: (纸本)9781581137569

By allowing the programmer to write code that can generate code at run-time, meta-programming offers a powerful approach to program construction. For instance, meta-programming can often be employed to enhance program efficiency and facilitate the construction of generic programs. However, meta-programming, especially in an untyped setting, is notoriously error-prone. In this paper, we aim at making meta-programming less error-prone by providing a type system to facilitate the construction of correct meta-programs. We first introduce some code constructors for constructing typeful code representation in which program variables are replaced with deBruijn indices, and then formally demonstrate how such typeful code representation can be used to support meta-programming. the main contribution of the paper lies in recognition and then formalization of a novel approach to typed meta-programming that is practical, general and flexible.

关键词： meta-programming multi-level staged programming typeful code representation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Meta-programming for Cross-Domain Tensor Optimizations 2018

Meta-programming for Cross-Domain Tensor Optimizations

引用

17th acm sigplan international conference on Generative programming - Concepts and Experiences (GPCE) part of the SPLASH Collection of conferences and Workshops

作者： Susungi, Adilla Rink, Norman A. Cohen, Albert Castrillon, Jeronimo Tadonki, Claude PSL Res Univ MINES ParisTech Paris France Tech Univ Dresden Chair Compiler Construct Dresden Germany INRIA Villers Les Nancy France ENS DI Paris France

ISBN: (纸本)9781450360456

Many modern application domains crucially rely on tensor operations. the optimization of programs that operate on tensors poses difficulties that are not adequately addressed by existing languages and tools. Frameworks such as TensorFlow offer good abstractions for tensor operations, but target a specific domain, i.e. machine learning, and their optimization strategies cannot easily be adjusted to other domains. General-purpose optimization tools such as Pluto and existing meta-languages offer more flexibility in applying optimizations but lack abstractions for tensors. this work closes the gap between domain-specific tensor languages and general-purpose optimization tools by proposing the Tensor optimizations Meta-Language (TEML). Ton offers high-level abstractions for both tensor operations and loop transformations, and enables flexible composition of transformations into effective optimization paths. this compositionality is built into TEML's design, as our formal language specification will reveal. We also show that TEML can express tensor computations as comfortably as TensorFlow and that it can reproduce Pluto's optimization paths. thus, optimized programs generated by TEML execute at least as fast as the corresponding Pluto programs. In addition, TEML enables optimization paths that often allow outperforming Pluto.

关键词： tensor algebra meta-programming code generation and optimization denotational semantics

来源：评论

学校读者我要写书评

暂无评论

Applicative Bidirectional programming with Lenses 2015

Applicative Bidirectional Programming with Lenses

引用

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

作者： Matsuda, Kazutaka Wang, Meng Tohoku Univ Sendai Miyagi 980 Japan Univ Kent Canterbury CT2 7NZ Kent England

ISBN: (纸本)9781450336697

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 with respect to some laws. One way to reduce the development and maintenance effort of bidirectional transformations is to have specialized languages in which the resulting programs are bidirectional by construction-giving rise to the paradigm of bidirectional programming. In this paper, we develop a framework for applicative-style and higher-order bidirectional programming, in which we can write bidirectional transformations as unidirectional programs in standard functional languages, opening up access to the bundle of language features previously only available to conventional unidirectional languages. Our framework essentially bridges two very different approaches of bidirectional programming, namely the lens framework and Voigtlander's semantic bidirectionalization, creating a new programming style that is able to bag benefits from both.

关键词： Bidirectional programming Lens Bidirectionalization Free theorem functional programming Haskell Languages

来源：评论

学校读者我要写书评

暂无评论

A functional I/O System or, Fun for Freshman Kids

A Functional I/O System or, Fun for Freshman Kids

引用

14th acm sigplan international conference on functional programming

作者： Felleisen, Matthias Findler, Robert Bruce Flatt, Matthew Krishnamurthi, Shriram Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9781605583327

functional programming languages ought to play a central role in mathematics education for middle schools (age range: 10-14). After all, functional programming is a form of algebra and programming is a creative activity about problem solving. Introducing it into mathematics courses would make pre-algebra course come alive. If input and output were invisible, students could implement fun simulations, animations, and even interactive and distributed games all while using nothing more than plain mathematics. We have implemented this vision with a simple framework for purely functional I/O. Using this framework, students design, implement, and test plain mathematical functions over numbers, booleans, string, and images. then the framework wires them up to devices and performs all the translation from external information to internal data (and vice versa) just like every other operating system. Once middle school students are hooked on this form of programming, our curriculum provides a smooth path for them from pre-algebra to freshman courses in college on object-oriented design and theorem proving.

关键词： Introductory programming

来源：评论

学校读者我要写书评

暂无评论

Experience report: Playing the DSL card - A domain specific language for component configuration

Experience report: Playing the DSL card - A domain specific ...

引用

13th acm sigplan international conference on functional programming

作者： Jones, Mark P. Portland State Univ Portland OR 97207 USA

ISBN: (纸本)9781595939197

this paper describes our experience using a functional language, Haskell, to build an embedded, domain-specific language (DSL) for component configuration in large-scale, real-time, embedded systems. Prior to the introduction of the DSL, engineers would describe the steps needed to configure a particular system in a handwritten XML document. In this paper, we outline the application domain, give a brief overview of the DSL that we developed, and provide concrete data to demonstrate its effectiveness. In particular, we show that the DSL has several significant benefits over the original, XML-based approach including reduced code size, increased modularity and scalability, and detection and prevention of common defects. For example, using the DSL, we were able to produce clear and intuitive descriptions of component configurations that were sometimes less than 1/30 of the size of the original XML.

关键词： design languages domain-specific languages functional programming Haskell component configuration Timber

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共63页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：