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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

238 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

196 篇 工学
- 191 篇 软件工程
- 79 篇 计算机科学与技术...
- 6 篇 电气工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 生物工程
6 篇 理学
- 5 篇 数学
- 1 篇 生物学
- 1 篇 系统科学
2 篇 教育学
- 2 篇 教育学
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 图书情报与档案管...

主题

46 篇 design
38 篇 languages
22 篇 performance
15 篇 algorithms
14 篇 probabilistic pr...
12 篇 verification
12 篇 functional progr...
11 篇 program synthesi...
10 篇 reliability
9 篇 object oriented ...
9 篇 experimentation
9 篇 programming lang...
8 篇 domain-specific ...
8 篇 concurrency
7 篇 type systems
7 篇 java
6 篇 optimization
5 篇 compilers
5 篇 metaprogramming
5 篇 theory

机构

8 篇 purdue univ w la...
7 篇 carnegie mellon ...
5 篇 harvard univ cam...
4 篇 univ wisconsin m...
4 篇 princeton univ p...
4 篇 univ calif davis...
4 篇 northeastern uni...
4 篇 cornell univ ith...
4 篇 univ penn philad...
4 篇 stanford univ st...
4 篇 univ washington ...
3 篇 microsoft res re...
3 篇 swiss fed inst t...
3 篇 mit cambridge ma...
3 篇 yale univ new ha...
3 篇 rice univ housto...
3 篇 univ calif berke...
3 篇 univ texas austi...
2 篇 microsoft corp r...
2 篇 oracle labs pots...

作者

5 篇 foster nate
5 篇 gulwani sumit
5 篇 walker david
4 篇 shao zhong
4 篇 dillig isil
3 篇 huang jeff
3 篇 vechev martin
3 篇 su zhendong
3 篇 chaudhuri swarat
3 篇 myers andrew c.
3 篇 zhang xiangyu
3 篇 mansinghka vikas...
2 篇 hirschfeld rober...
2 篇 flatt matthew
2 篇 gupta gagan
2 篇 shull thomas
2 篇 yahav eran
2 篇 rajamani sriram
2 篇 niephaus fabio
2 篇 choi jiho

语言

240 篇 英文
1 篇 中文

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

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Adding delimited and composable control to a production programming environment

Adding delimited and composable control to a production prog...

引用

12th acm sigplan International conference on Functional programming

作者： Flatt, Matthew Yu, Gang Findler, Robert Bruce Felleisen, Matthias Univ Utah Salt Lake City UT 84112 USA Chinese Acad Sci Inst Software Beijing 100864 Peoples R China Univ Chicago Chicago IL 60637 USA Northeastern Univ Boston MA 02115 USA

ISBN: (纸本)9781595938152

Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advantages, how the operators explain each other (or don't), and other aspects of the operators' existence. Production programming languages, however, do not support these operators, partly because their relationship to existing and demonstrably useful constructs-such as exceptions and dynamic binding-remains relatively unexplored. In this paper, we report on our effort of translating the theory of delimited and composable control into a viable implementation for a production system. the report shows how this effort involved a substantial design element, including work with a formal model, as well as significant practical exploration and engineering. the resulting version of PLT Scheme incorporates the expressive combination of delimited and composable control alongside dynamic-wind, dynamic binding, and exception handling. None of the additional operators subvert the intended benefits of existing control operators, so that programmers can freely mix and match control operators.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A type-based compiler for standard ML 95

A type-based compiler for standard ML

引用

1995 acm sigplan conference on programming language design and implementation, PLDI 1995

作者： Shao, Zhong Appelt, Andrew W. Yale University United States Princeton University United States

ISBN: (纸本)0897916972

Compile-time type information should be valuable in efficient compilation of statically typed functional languages such as Standard ML. But how should type-directed compilation work in real compilers, and how much performance gain will type-based optimization yield? In order to support more efficient data representations and gain more experience about type-directed compilation, we have implemented a new type-based middle end and back end for the Standard ML of New Jersey compiler. We describe the basic design of the new compiler, Identify a number of practical issues, and then compare the performance of our new compiler with the old non-type-based compiler. Our measurement shows that a combination of several simple type-based optimlzations reduces heap allocation by 36%: And improves the already-efficient code generated by the old non-type-based compiler by about 19% on a DECstation 5000. © 1995 acm.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

SOAP 2019 - proceedings of the 8th acm sigplan International Workshop on State of the Art in Program Analysis, co-located with PLDI 2019

SOAP 2019 - Proceedings of the 8th ACM SIGPLAN International...

引用

8th acm sigplan International Workshop on State Of the Art in Program Analysis, SOAP 2019, co-located with PLDI 2019

ISBN: (纸本)9781450367202

the proceedings contain 7 papers. the topics discussed include: fixpoint reuse for incremental JavaScript analysis;know your analysis: how instrumentation aids understanding static analysis;SootDiff: bytecode comparison across different Java compilers;modernizing parsing tools: parsing and analysis with object-oriented programming;commit-time incremental analysis;program analysis for process migration;and MetaDL: analyzing datalog in datalog.

关键词：

来源：评论

学校读者我要写书评

暂无评论

iCoLa: A Compositional Meta-language with Support for Incremental language Development 15

iCoLa: A Compositional Meta-language with Support for Increm...

引用

15th International conference on Software language Engineering (SLE)

作者： Frolich, Damian van Binsbergen, L. thomas Univ Amsterdam Informat Inst Amsterdam Netherlands

ISBN: (纸本)9781450399197

programming languages providing high-level abstractions can increase a programmers' productivity and the safety of a program. language-oriented programming is a paradigm in which domain-specific languages are developed to solve problems within specific domains with (high-level) abstractions relevant to those domains. However, language development involves complex design and engineering processes. these processes can be simplified by reusing (parts of) existing languages and by offering language-parametric tooling. In this paper we present iCoLa, a meta-language supporting incremental (meta-)programming based on reusable components. In our implementation of iCoLa, languages are firstclass citizens, providing the full power of the host-language (Haskell) to compose and manipulate languages. We demonstrate iCoLa through the construction of the Imp, SIMPLE, and MiniJava languages via the composition and restriction of language fragments and demonstrate the variability of our approach through the construction of several languages using a fixed-set of operators.

关键词： language composition prototyping domain-specific languages meta-language funcons

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：