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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

280 篇 会议
40 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

275 篇 工学
- 269 篇 软件工程
- 141 篇 计算机科学与技术...
- 7 篇 电气工程
- 2 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
- 1 篇 生物工程
12 篇 理学
- 10 篇 数学
- 1 篇 化学
- 1 篇 地质学
- 1 篇 生物学
- 1 篇 系统科学
6 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
3 篇 教育学
- 3 篇 教育学

主题

82 篇 design
76 篇 languages
34 篇 performance
17 篇 algorithms
17 篇 verification
15 篇 functional progr...
14 篇 reliability
14 篇 probabilistic pr...
13 篇 object oriented ...
13 篇 program synthesi...
13 篇 domain-specific ...
11 篇 experimentation
11 篇 java
10 篇 programming lang...
9 篇 type systems
9 篇 theory
9 篇 concurrency
7 篇 compilers
7 篇 optimization
6 篇 modules

机构

9 篇 carnegie mellon ...
8 篇 purdue univ w la...
6 篇 princeton univ p...
5 篇 northeastern uni...
5 篇 yale univ new ha...
5 篇 harvard univ cam...
5 篇 cornell univ ith...
5 篇 univ washington ...
5 篇 univ calif berke...
4 篇 univ wisconsin m...
4 篇 univ calif davis...
4 篇 univ utah salt l...
4 篇 univ penn philad...
4 篇 rice univ housto...
4 篇 univ chicago il ...
4 篇 stanford univ st...
4 篇 univ texas austi...
3 篇 mit csail cambri...
3 篇 univ cambridge c...
3 篇 microsoft res re...

作者

7 篇 walker david
6 篇 foster nate
6 篇 shao zhong
5 篇 gulwani sumit
5 篇 dillig isil
4 篇 rainey mike
4 篇 gu ronghui
4 篇 rompf tiark
4 篇 solar-lezama arm...
4 篇 chaudhuri swarat
4 篇 myers andrew c.
4 篇 wansbrough keith
3 篇 hirschfeld rober...
3 篇 flatt matthew
3 篇 rajamani sriram
3 篇 seshia sanjit a.
3 篇 rajan hridesh
3 篇 huang jeff
3 篇 vechev martin
3 篇 olukotun kunle

语言

286 篇 英文
33 篇 其他
1 篇 中文

检索条件"任意字段=36th ACM SIGPLAN Conference on Programming Language Design and Implementation"

共 320 条记录，以下是141-150 订阅

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

详细简洁

排序：

It's alive! Continuous feedback in UI programming

It's alive! Continuous feedback in UI programming

引用

34th acm sigplan conference on programming language design and implementation, PLDI 2013

作者： Burckhardt, Sebastian De Halleux, Peli Moskal, Michal Fähndrich, Manuel McDirmid, Sean Tillmann, Nikolai Kato, Jun Microsoft Research United States University of Tokyo Japan

ISBN: (纸本)9781450320146

Live programming allows programmers to edit the code of a running program and immediately see the effect of the code changes. this tightening of the traditional edit-compile-run cycle reduces the cognitive gap between program code and execution, improving the learning experience of beginning programmers while boosting the productivity of seasoned ones. Unfortunately, live programming is difficult to realize in practice as imperative languages lack well-defined abstraction boundaries that make live programming responsive or its feedback comprehensible. this paper enables live programming for user interface programming by cleanly separating the rendering and non-rendering aspects of a UI program, allowing the display to be refreshed on a code change without restarting the program. A type and effect system formalizes this separation and provides an evaluation model that incorporates the code update step. By putting live programming on a more formal footing, we hope to enable critical and technical discussion of live programming systems. Copyright © 2013 acm.

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

A Play on Regular Expressions Functional Pearl 10

A Play on Regular Expressions Functional Pearl

引用

15th acm sigplan International conference on Functional programming

作者： Fischer, Sebastian Huch, Frank Wilke, thomas Univ Kiel D-24098 Kiel Germany

ISBN: (纸本)9781605587943

Cody, Hazel, and theo, two experienced Haskell programmers and an expert in automata theory, develop an elegant Haskell program for matching regular expressions: (i) the program is purely functional;(ii) it is overloaded over arbitrary semirings, which not only allows to solve the ordinary matching problem but also supports other applications like computing leftmost longest matchings or the number of matchings, all with a single algorithm;(iii) it is more powerful than other matchers, as it can be used for parsing every context-free language by taking advantage of laziness. the developed program is based on an old technique to turn regular expressions into finite automata which makes it efficient both in terms of worst-case time and space bounds and actual performance: despite its simplicity, the Haskell implementation can compete with a recently published professional C++ program for the same problem.

关键词： Algorithms design regular expressions finite automata Glushkov construction purely functional programming

来源：评论

学校读者我要写书评

暂无评论

A Domain-Specific language for Microservices 9

A Domain-Specific Language for Microservices

引用

9th acm sigplan International Symposium on Scala (Scala) as part of the acm sigplan International conference on Functional programming (ICFP)

作者： Donham, Jacob Twitter Inc San Francisco CA 94103 USA

ISBN: (纸本)9781450358361

A common architectural pattern for complex online systems is a collection of "microservices" communicating via RPC interfaces. A service architecture provides autonomy for teams to develop, deploy, and operate system modules without centralized coordination. But this autonomy comes at a cost in leverage-the fixed costs of running a service are high, and the desire to avoid them can lead to poor design choices. In this paper we describe Strato, a system built at Twitter that runs many microservices hosted in a shared service platform-trading a little autonomy for a lot of leverage. Hosted microservices are written in a Scala-like DSL that supports transparent concurrency and native access to thrift data (the common currency of services at Twitter). the DSL compiles to a concurrency library written in Scala with an arrows-based interface. We detail the design and implementation of the DSL and concurrency library, and evaluate the effectiveness of Strato in improving leverage at Twitter.

关键词： Scala microservices

来源：评论

学校读者我要写书评

暂无评论

Almost First-Class language Embedding Taming Staged Embedded DSLs 2015

Almost First-Class Language Embedding Taming Staged Embedded...

引用

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

作者： Scherr, Maximilian Chiba, Shigeru Univ Tokyo Tokyo Japan

ISBN: (纸本)9781450336871

Embedded domain-specific languages (EDSLs), inheriting a general-purpose language's features as well as look-and-feel, have traditionally been second-class or rather non-citizens in terms of host-language design. this makes sense when one regards them to be on the same level as traditional, non-EDSL library interfaces. However, this equivalence only applies to the simplest of EDSLs. In this paper we illustrate why this is detrimental when moving on to EDSLs that employ staging, i.e. program reification, by example of various issues that affect authors and users alike. We believe that if EDSLs are to be considered a reliable, language-like interface abstraction, they require exceptional attention and design scrutiny. Instead of unenforceable conventions, we advocate the acceptance of EDSLs as proper, i.e. almost first-class, citizens while retaining most advantages of pure embeddings. As a small step towards this goal, we present a pragmatic framework prototype for Java. It is based on annotations that explicate and document membership to explicit EDSL entities. In a nutshell, our framework identifies (annotated) method calls and field accesses as EDSL terms and dynamically constructs an abstract-syntax representation, which is eventually passed to a semantics-defining back end implemented by the EDSL author.

关键词： Java implementation embedded DSLs metaprogramming program transformation staging programming languages design

来源：评论

学校读者我要写书评

暂无评论

Formal design constraints 96

Formal design constraints

引用

Proceedings of the 1996 conference on Object-Oriented programming Systems, languages & Applications

作者： Klarlund, Nils Koistinen, Jari Schwartzbach, Michael I. Univ of Aarhus Aarhus Denmark

ISBN: (纸本)9780897917889

Large software systems are often built on system platforms that support or enforce specific characteristics of the source code or actual design. these characteristics are either captured informally in design guideline documents or in specialized design and implementation languages. In our view, both approaches are unsatisfactory. Informal descriptions do not allow automated analysis and lead to vague constraint descriptions. the language-based approach leads to different languages for different platforms and even for different versions of the same basic platform. Our approach is to describe and name the constraints separately in a design constraint language called CDL, which is based on an extraordinarily concise logic of parse trees. designs are then annotated with the names of the constraints they are supposed to satisfy. We discuss how the design constraint language is integrated into a design language environment. We exhibit industrial and experimental evidence that our choice of design constraint language allows us to formalize naturally and succinctly common design characteristics.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Compiling KB-Sized Machine Learning Models to Tiny IoT Devices 2019

Compiling KB-Sized Machine Learning Models to Tiny IoT Devic...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Gopinath, Sridhar Ghanathe, Nikhil Seshadri, Vivek Sharma, Rahul Microsoft Res Bengaluru India

ISBN: (纸本)9781450367127

Recent advances in machine learning (ML) have produced KiloByte-size models that can directly run on constrained IoT devices. this approach avoids expensive communication between IoT devices and the cloud, thereby enabling energy-efficient real-time analytics. However, ML models are expressed typically in floating-point, and IoT hardware typically does not support floating-point. therefore, running these models on IoT devices requires simulating IEEE-754 floating-point using software, which is very inefficient. We present SeeDot, a domain-specific language to express ML inference algorithms and a compiler that compiles SeeDot programs to fixed-point code that can efficiently run on constrained IoT devices. We propose 1) a novel compilation strategy that reduces the search space for some key parameters used in the fixed-point code, and 2) new efficient implementations of expensive operations. SeeDot compiles state-of-the-art KB-sized models to various microcontrollers and low-end FPGAs. We show that SeeDot outperforms 1) software emulation of floating-point (Arduino), 2) high-bitwidth fixed-point (MATLAB), 3) post-training quantization (TensorFlow-Lite), and 4) floating- and fixed-point FPGA implementations generated using high-level synthesis tools.

关键词： Machine Learning IoT device programming language Compiler Fixed-point Microcontroller FPGA

来源：评论

学校读者我要写书评

暂无评论

Generating Safe Boundary APIs between Typed EDSLs and their Environments 2015

Generating Safe Boundary APIs between Typed EDSLs and Their ...

引用

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

作者： Reynders, Bob Devriese, Dominique Piessens, Frank Katholieke Univ Leuven iMinds Distrinet Leuven Belgium

ISBN: (纸本)9781450336871

Embedded domain specific languages (EDSLs) are used to represent special-purpose code in a general-purpose language and they are used for applications like vector calculations and run-time code generation. Often, code in an EDSL is compiled to a target (e.g. GPU languages, JVM bytecode, assembly, JavaScript) and needs to interface with other code that is available at that level but uses other data representations or calling conventions. We present an approach for safely making available such APIs in a typed EDSL, guaranteeing correct conversions between data representations and the respect for calling conventions. When the code being interfaced with is the result of static compilation of host language code, we propose a way to auto-generate the needed boilerplate using meta-programming. We instantiate our technique with JavaScript as the target language, JS-Scala as the EDSL, *** as the static compiler and Scala macros to generate the boilerplate, but our design is more generally applicable. We provide evidence of usefulness of our approach through a prototype implementation that we have applied in a non-trivial code base.

关键词： embedded domain specific languages Scala meta-programming

来源：评论

学校读者我要写书评

暂无评论

Lem: Reusable Engineering of Real-world Semantics 14

Lem: Reusable Engineering of Real-world Semantics

引用

19th acm sigplan International conference on Functional programming (ICFP)

作者： Mulligan, Dominic P. Owens, Scott Gray, Kathryn E. Ridge, Tom Sewell, Peter Univ Cambridge Cambridge England Univ Kent Canterbury CT2 7NZ Kent England Univ Leicester Leicester Leics England

ISBN: (纸本)9781450328739

Recent years have seen remarkable successes in rigorous engineering: using mathematically rigorous semantic models (not just idealised calculi) of real-world processors, programming languages, protocols, and security mechanisms, for testing, proof, analysis, and design. Building these models is challenging, requiring experimentation, dialogue with vendors or standards bodies, and validation;their scale adds engineering issues akin to those of programming to the task of writing clear and usable mathematics. But language and tool support for specification is lacking. Proof assistants can be used but bring their own difficulties, and a model produced in one, perhaps requiring many person-years effort and maintained over an extended period, cannot be used by those familiar with another. We introduce Lem, a language for engineering reusable largescale semantic models. the Lem design takes inspiration both from functional programming languages and from proof assistants, and Lem definitions are translatable into OCaml for testing, Coq, HOL4, and Isabelle/ HOL for proof, and LaTeX and HTML for presentation. this requires a delicate balance of expressiveness, careful library design, and implementation of transformations - akin to compilation, but subject to the constraint of producing usable and human-readable code for each target. Lem's effectiveness is demonstrated by its use in practice.

关键词： Lem real-world semantics specification language proof assistants

来源：评论

学校读者我要写书评

暂无评论

conference on programming language design and implementation - PLAS 2006: Proceedings of the 2006 programming languages and Analysis for Security Workshop

Conference on Programming Language Design and Implementation...

引用

acm sigplan conference on programming language design and implementation, PLDI 2006 - PLAS 2006: 2006 programming languages and Analysis for Security Workshop

ISBN: (纸本)1595933743

the proceedings contain 36 papers. the topics discussed include: optimizing memory transactions;compiler and runtime support for efficient software transactional memory;better extensibility through modular syntax;fast and flexible instruction selection with on-demand tree-parsing automata;a framework for unrestricted whole-program optimization;practical dynamic software updating for C;an experimental analysis of self-adjusting computation;shared memory programming for large scale machines;optimizing data permutations for SIMD devices;auto-vectorization of interleaved data for SIMD;pruning dynamic slices with confidence;context-sensitive domain-independent algorithm composition and selection;reducing NoC energy consumption through compiler-directed channel voltage scaling;a global progressive register allocator;and automatic instruction scheduler retargeting by reverse-engineering.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：