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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,094 篇 会议
132 篇 期刊文献

馆藏范围

1,226 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,062 篇 工学
- 1,002 篇 软件工程
- 769 篇 计算机科学与技术...
- 43 篇 控制科学与工程
- 36 篇 电气工程
- 31 篇 信息与通信工程
- 8 篇 电子科学与技术（可...
- 7 篇 机械工程
- 5 篇 安全科学与工程
- 4 篇 材料科学与工程（可...
- 4 篇 建筑学
- 4 篇 土木工程
- 4 篇 化学工程与技术
- 4 篇 航空宇航科学与技...
- 4 篇 生物工程
- 2 篇 光学工程
- 2 篇 农业工程
134 篇 理学
- 111 篇 数学
- 14 篇 系统科学
- 8 篇 统计学（可授理学、...
- 6 篇 生物学
- 5 篇 物理学
- 4 篇 化学
82 篇 管理学
- 47 篇 管理科学与工程(可...
- 38 篇 图书情报与档案管...
- 27 篇 工商管理
12 篇 教育学
- 12 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
2 篇 农学
- 2 篇 作物学

主题

170 篇 design
157 篇 languages
99 篇 computer program...
96 篇 performance
57 篇 algorithms
54 篇 object oriented ...
51 篇 computer program...
43 篇 experimentation
39 篇 verification
34 篇 reliability
34 篇 java programming...
29 篇 functional progr...
26 篇 program synthesi...
26 篇 java
24 篇 probabilistic pr...
20 篇 concurrency
19 篇 domain-specific ...
19 篇 theory
18 篇 c (programming l...
17 篇 compilers

机构

16 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ washington ...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 univ penn philad...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 stanford univ st...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 yale univ new ha...
9 篇 harvard univ cam...
9 篇 cornell univ ith...
8 篇 microsoft res re...
8 篇 univ chicago il ...
7 篇 microsoft res re...
7 篇 swiss fed inst t...
7 篇 mit cambridge ma...
7 篇 northeastern uni...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 chlipala adam
8 篇 shao zhong
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
8 篇 gulwani sumit
7 篇 august david i.
7 篇 bacon david f.
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 hendren laurie
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 felleisen matthi...
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott

语言

1,148 篇 英文
77 篇 其他
1 篇 中文

检索条件"任意字段=Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation"

共 1226 条记录，以下是341-350 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

programming with Binders and Indexed Data-Types 12

Programming with Binders and Indexed Data-Types

引用

39th Annual acm sigplan-SIGACT Symposium on Principles of programming languages

作者： Cave, Andrew Pientka, Brigitte McGill Univ Montreal PQ H3A 2T5 Canada

ISBN: (纸本)9781450310833

We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a restricted form of dependent types where index objects are drawn from contextual LF. This allows the user to specify formal systems within the logical framework LF and index ML types with contextual LF objects. Our language design keeps the index language generic only requiring decidability of equality of the index language providing a modular design. To illustrate the elegance and effectiveness of our language, we give programs for closure conversion and normalization by evaluation. Our three key technical contribution are: 1) We give a bidirectional type system for our core language which is centered around refinement substitutions instead of constraint solving. As a consequence, type checking is decidable and easy to trust, although constraint solving may be undecidable. 2) We give a big-step environment based operational semantics with environments which lends itself to efficient implementation. 3) We prove our language to be type safe and have mechanized our theoretical development in the proof assistant Coq using the fresh approach to binding.

关键词： Logical frameworks higher-order abstract syntax dependent types recursive types

来源：评论

学校读者我要写书评

暂无评论

Automatically closing open reactive programs

Automatically closing open reactive programs

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Colby, Christopher Godefroid, Patrice Jagadeesan, Lalita Jategaonkar Loyola Univ Chicago Chicago United States

We study in this paper the problem of analyzing implementations of open systems - systems in which only some of the components are present. We present an algorithm for automatically dosing an open concurrent reactive system with its most general environment, i.e., the environment that can provide any input at any time to the system. The result is a nondeterministic closed (i.e., self-executable) system which can exhibit all the possible reactive behaviors of the original open system. These behaviors can then be analyzed using VeriSoft, an existing tool for systematically exploring the state spaces of closed systems composed of multiple (possibly nondeterministic) processes executing arbitrary code. We have implemented the techniques introduced in this paper in a prototype tool for automatically closing open programs written in the C programming language. We discuss preliminary experimental results obtained with a large telephone-switching software application developed at Lucent Technologies.

关键词： Computer systems 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

来源：评论

学校读者我要写书评

暂无评论

Invertible Syntax Descriptions: Unifying Parsing and Pretty Printing

Invertible Syntax Descriptions: Unifying Parsing and Pretty ...

引用

3rd acm Haskell Symposium on Haskell

作者： Rendel, Tillmann Ostermann, Klaus Univ Marburg D-35032 Marburg Germany

ISBN: (纸本)9781450302524

Parsers and pretty-printers for a language are often quite similar, yet both are typically implemented separately, leading to redundancy and potential inconsistency. We propose a new interface of syntactic descriptions, with which both parser and pretty-printer can be described as a single program. Whether a syntactic description is used as a parser or as a pretty-printer is determined by the implementation of the interface. Syntactic descriptions enable programmers to describe the connection between concrete and abstract syntax once and for all, and use these descriptions for parsing or pretty-printing as needed. We also discuss the generalization of our programming technique towards an algebra of partial isomorphisms.

关键词： design languages embedded domain specific languages invertible computation parser combinators pretty printing

来源：评论

学校读者我要写书评

暂无评论

Web Question Answering with Neurosymbolic Program Synthesis 2021

Web Question Answering with Neurosymbolic Program Synthesis

引用

42nd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Chen, Qiaochu Lamoreaux, Aaron Wang, Xinyu Durrett, Greg Bastani, Osbert Dillig, Isil Univ Texas Austin Austin TX 78712 USA Univ Michigan Ann Arbor MI 48109 USA Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450383912

In this paper, we propose a new technique based on program synthesis for extracting information from webpages. Given a natural language query and a few labeled webpages, our method synthesizes a program that can be used to extract similar types of information from other unlabeled webpages. To handle websites with diverse structure, our approach employs a neurosymbolic DSL that incorporates both neural NLP models as well as standard language constructs for tree navigation and string manipulation. We also propose an optimal synthesis algorithm that generates all DSL programs that achieve optimal F-1 score on the training examples. Our synthesis technique is compositional, prunes the search space by exploiting a monotonicity property of the DSL, and uses transductive learning to select programs with good generalization power. We have implemented these ideas in a new tool called WEBQA and evaluate it on 25 different tasks across multiple domains. Our experiments show that WEBQA significantly outperforms existing tools such as state-of-the-art question answering models and wrapper induction systems.

关键词： Program Synthesis programming by Example Web Information Extraction

来源：评论

学校读者我要写书评

暂无评论

Decoupled Lifeguards: Enabling Path Optimizations for Dynamic Correctness Checking Tools 10

Decoupled Lifeguards: Enabling Path Optimizations for Dynami...

引用

acm sigplan conference on programming language design and implementation

作者： Ruwase, Olatunji Chen, Shimin Gibbons, Phillip B. Mowry, Todd C. Carnegie Mellon Univ Pittsburgh PA 15213 USA Intel Labs Pittsburgh Pittsburgh PA USA

ISBN: (纸本)9781450300193

Dynamic correctness checking tools (a.k.a. lifeguards) can detect a wide array of correctness issues, such as memory, security, and concurrency misbehavior, in unmodified executables at run time. However, lifeguards that are implemented using dynamic binary instrumentation (DBI) often slow down the monitored application by 10-50X, while proposals that replace DBI with hardware still see 3-8X slowdowns. The remaining overhead is the cost of performing the lifeguard analysis itself. In this paper, we explore compiler optimization techniques to reduce this overhead. The lifeguard software is typically structured as a set of event-driven handlers, where the events are individual instructions in the monitored application's dynamic instruction stream. We propose to decouple the lifeguard checking code from the application that it is monitoring so that the lifeguard analysis can be invoked at the granularity of hot paths in the monitored application. In this way, we are able to find many more opportunities for eliminating redundant work in the lifeguard analysis, even starting with well-optimized applications and hand-tuned lifeguard handlers. Experimental results with two lifeguard frameworks-one DBI-based and one hardware-assisted-show significant reduction in monitoring overhead.

关键词： design Performance Reliability Security Dynamic code optimizations Dynamic correctness checking Dynamic program analysis

来源：评论

学校读者我要写书评

暂无评论

Can programming be liberated from the two-level style?: Multi-level programming with DeepJava 07

Can programming be liberated from the two-level style?: Mult...

引用

22nd International conference on Object-Oriented programming, Systems, languages and Applications

作者： Kuehne, Thomas Schreiber, Daniel Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781595937865

Since the introduction of object-oriented programming few programming languages have attempted to provide programmers with more than objects and classes, i.e., more than two levels. Those that did, almost exclusively aimed at describing language properties - i. e., their metaclasses exert linguistic control on language concepts and mechanisms often in order to make the language extensible. In terms of supporting logical domain classification levels, however, they are still limited to two levels. In this paper we conservatively extend the object-oriented programming paradigm to feature an unbounded number of domain classification levels. We can therefore avoid the introduction of accidental complexity into programs caused by accommodating multiple domain levels within only two programming levels. We present a corresponding language design featuring "deep instantiation" and demonstrate its features with a running example. Finally, we outline the implementation of our compiler prototype and discuss the potentials of further developing our language design.

关键词： languages design domain metatypes ontological metamodeling deep characterization

来源：评论

学校读者我要写书评

暂无评论

Modula-2 and Oberon

Modula-2 and Oberon

引用

3rd acm sigplan History of programming languages conference, HOPL-III

作者： Wirth, Niklaus ETH Zurich

ISBN: (纸本)9781595937667

This is an account of the development of the languages Modula-2 and Oberon. Together with their ancestors ALGOL 60 and Pascal they form a family called Algol-like languages. Pascal (1970) reflected the ideas of structured programming, Modula-2 (1979) added those of modular system design, and Oberon (1988) catered to the object-oriented style. Thus they mirror the essential programming paradigms of the past decades. Here the major language properties are outlined, followed by an account of the respective implementation efforts. The conditions and the environments in which the languages were created are elucidated. We point out that simplicity of design was the most essential guiding principle. Clarity of concepts, economy of features, efficiency and reliability of implementations were its consequences. © 2007 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Flexible Object Layouts Enabling Lightweight language Extensions by Intercepting Slot Access 11

Flexible Object Layouts Enabling Lightweight Language Extens...

引用

2011 acm International conference on Object Oriented programming Systems languages and Applications

作者： Verwaest, Toon Lungu, Mircea Nierstrasz, Oscar Bruni, Camillo Univ Bern Software Composit Grp CH-3012 Bern Switzerland INRIA Lille Nord Europe RMoD Lille France

ISBN: (纸本)9781450309400

programming idioms, design patterns and application libraries often introduce cumbersome and repetitive boilerplate code to a software system. language extensions and external DSLs (domain specific languages) are sometimes introduced to reduce the need for boilerplate code, but they also complicate the system by introducing the need for language dialects and inter-language mediation. To address this, we propose to extend the structural reflective model of the language with object layouts, layout scopes and slots. Based on the new reflective language model we can 1) provide behavioral hooks to object layouts that are triggered when the fields of an object are accessed and 2) simplify the implementation of state-related language extensions such as stateful traits. By doing this we show how many idiomatic use cases that normally require boilerplate code can be more effectively supported. We present an implementation in Smalltalk, and illustrate its usage through a series of extended examples.

关键词： Reflection Smalltalk Structural Reflection Metaobject Protocol Traits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共123页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：