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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

68 篇 会议
66 篇 期刊文献
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

129 篇 工学
- 105 篇 计算机科学与技术...
- 72 篇 软件工程
- 11 篇 电气工程
- 5 篇 控制科学与工程
- 4 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
- 1 篇 信息与通信工程
17 篇 理学
- 14 篇 数学
- 2 篇 物理学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
3 篇 医学
- 2 篇 临床医学
- 1 篇 基础医学(可授医学...
3 篇 管理学
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 哲学
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学

主题

135 篇 meta-programming
11 篇 reflection
8 篇 languages
8 篇 domain-specific ...
8 篇 logic programmin...
7 篇 java
5 篇 parallelism
5 篇 dependent types
5 篇 scala
5 篇 language extensi...
5 篇 prolog
4 篇 theory
4 篇 functional progr...
4 篇 aspect-oriented ...
4 篇 binders
4 篇 modularity
4 篇 code generation
3 篇 performance
3 篇 parallelization
3 篇 maude

机构

3 篇 ctr wiskunde & i...
3 篇 georgia inst tec...
2 篇 inria
2 篇 univ oslo dept i...
2 篇 univ pisa dipart...
2 篇 ecole polytech f...
2 篇 typesafe inc ca ...
2 篇 washington univ ...
2 篇 univ southampton...
2 篇 psl res univ min...
2 篇 mcgill univ mont...
2 篇 inria lille nord...
2 篇 cnrs isima limos...
2 篇 imperial coll lo...
2 篇 univ british col...
2 篇 univ blaise pasc...
2 篇 vrije univ amste...
2 篇 tech univ dresde...
2 篇 univ auvergne ea...
2 篇 univ auvergne cl...

作者

5 篇 smaragdakis yann...
4 篇 devriese dominiq...
4 篇 pientka brigitte
3 篇 hill david r. c.
3 篇 luk wayne
3 篇 klint paul
3 篇 lammel ralf
3 篇 pitts andrew m.
3 篇 peyretaillade er...
3 篇 zucca elena
3 篇 huang shan shan
3 篇 piessens frank
3 篇 servetto marco
3 篇 peyret pierre
3 篇 koerner philipp
3 篇 coutinho jose g....
3 篇 jaziri faouzi
3 篇 hu jason z. s.
2 篇 stump aaron
2 篇 rink norman a.

语言

116 篇 英文
19 篇 其他

检索条件"主题词=Meta-Programming"

共 135 条记录，以下是71-80 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Cooperative Specification via Composition Control 17

Cooperative Specification via Composition Control

引用

17th ACM SIGPLAN International Conference on Software Language Engineering (SLE)

作者： Esterhuyse, Christopher A. van Binsbergen, L. Thomas Univ Amsterdam Informat Inst Amsterdam Netherlands

ISBN: (纸本)9798400711800

High-level, declarative specification languages are typically highly modular: specifications are comprised of fragments that are themselves meaningful. As such, complex specifications are built from incrementally composed fragments. In a cooperative specification, different fragments are contributed by different agents, usually capturing requirements on different facets of the system. For example, legal regulators and system administrators cooperate to specify the behaviour of a data exchange system. In practice, cooperative specification is difficult, as different contributors' requirements are difficult to elicit, express, and compose. In this work, we characterise cooperative specification and adopt an approach that leverages language features specifically introduced for controlling specification composition. In our approach, specifications model the domain as usual, but also specify how specifications may change. For example, a legal regulator defines 'consent to process data' and specifies which agents may consent, and which relaxations of the requirement are permitted. We propose and demonstrate generic language extensions that improve composition control in three case study languages: Datalog, Alloy, and eFLINT. We reflect on how these extensions improve composition control, and afford new data exchange scenarios. Finally, we relate our contributions to existing works, and to the greater vision of multi-agent data exchange to the satisfaction of their shared, complex, dynamic requirements.

关键词： Specification Languages Program Composition Program Refinement Data Exchange meta-programming

来源：评论

学校读者我要写书评

暂无评论

Higher-Order unification for free! Reusing the meta-language unification for the object language 24

Higher-Order unification for free! Reusing the meta-language...

引用

26th International Conference on Principles and Practice of Declarative programming (PPDP)

作者： Fissore, Davide Tassi, Enrico Univ Cote Azur Inria Valbonne France

ISBN: (纸本)9798400709692

Specifying and implementing a proof system from scratch requires significant effort. Logical Frameworks and Higher Order Logic programming Languages provide dedicated, high-level meta languages to facilitate this task in two ways: 1) variable binding and substitution are for free when meta language binders represent object logic ones;2) proof construction, and proof search, are greatly simplified by leveraging the unification procedure provided by the meta language. Notable examples of meta languages are Elf [21], Twelf [23], lambda Prolog [16], Beluga [24], Abella [8] and Isabelle [31] which have been used to implement or specify many formal systems such as First Order Logic [5], Set Theory [20], Higher Order Logic [19], and the Calculus of Constructions [4]. The object logic we are interested in is Coq's type theory [28]. We aim to develop a higher-order unification-based proof search procedure using the meta language Elpi [3], a dialect of lambda Prolog. Elpi's equational theory includes beta eta-equivalence and features a higher-order unification procedure similar or equal to(m) for the pattern fragment [15]. Elpi offers an encoding of Coq terms that is suitable for meta programming [6, 9, 26, 27] but that restricts similar or equal to(m) to first-order unification problems only. We refer to this basic encoding as O. In this paper we translate unification problems in O to an alternative encoding called M, from which we derive similar or equal to(O), the higher-order unification procedure of O. similar or equal to(O) honours beta eta-equivalence for terms within the pattern fragment, and allows for the use of heuristics when the terms fall outside the pattern fragment. Moreover, as similar or equal to(O) delegates most of the work to similar or equal to(m), it can be used to efficiently simulate a logic program in O by taking advantage of unification-related optimizations of the meta language, such as clause indexing.

关键词： Logic programming meta-programming Higher-Order Unification

来源：评论

学校读者我要写书评

暂无评论

MuTACLP:: A language for declarative GIS analysis 1

引用

1st International Conference on Computational Logic (CL 2000)

作者： Mancarella, P Nerbini, G Raffaetà, A Turini, F Univ Pisa Dipartimento Informat I-56125 Pisa Italy

ISBN: (数字)9783540449577

ISBN: (纸本)3540677976

This paper proposes an integration between Geographical Information System (GIS) technology and constraint logic programming in order to supply the user with a declarative language that supports and improves GIS analysis. We present the language MuTACLP, where spatio-temporal and thematic information can be represented in a uniform way, and the features of constraint logic programming, such as recursion and constraint handling, can be exploited to perform sophisticated spatio-temporal reasoning. This unifying language seems also promising to address the key problem of interoperability among different GISs.

关键词： spatio-temporal reasoning GIS analysis meta-programming

来源：评论

学校读者我要写书评

暂无评论

A Prolog-based Approach to Self-Evaluated, Declarative and Zero-Knowledge Verifiable Policies 32

A Prolog-based Approach to Self-Evaluated, Declarative and Z...

引用

32nd International Conference on Modeling, Analysis and Simulation of Computer and Telecommunication Systems

作者： Farkas, Martin Toldi, Balazs Adam Peter, Bertalan Zoltan Kocsis, Imre Budapest Univ Technol & Econ Dept Artif Intelligence & Syst Engn Budapest Hungary

ISBN: (纸本)9798331531317;9798331531300

In most domains where declarative policies are employed, it is typically the executor of the policy who performs policy evaluation, and not the subjects of policies. However, this approach has evident drawbacks from the trust, transparency and privacy aspects, especially when the subjects are natural persons. Building on recent developments in noninteractive zero-knowledge proofs and the technologies and standards supporting Self-Sovereign Indentity solutions, in this paper, we propose Self-Evaluated Policies, which move policy evaluation to the subject and leave the executor in a (zero-knowledge) proof-checking role. We present an SSI-based system model, propose a proof-tree-checking computational model for zero-knowledge proofs over the evaluations of Prolog-based policies, and describe a Circom-based prototype.

关键词： zero-knowledge proofs declarative policies meta-programming verifiable credentials

来源：评论

学校读者我要写书评

暂无评论

Expressive and safe static reflection with MorphJ 08

Expressive and safe static reflection with MorphJ

引用

ACM SIGPLAN Conference on programming Language Design and Implementation

作者： Huang, Shan Shan Smaragdakis, Yannis Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Univ Oregon Dept Comp & Informat Sci Eugene OR 97403 USA

ISBN: (纸本)9781595938602

Recently, language extensions have been proposed for Java and C# to support pattern-based reflective declaration. These extensions introduce a disciplined form of meta-programming and aspect-oriented programming to mainstream languages: They allow members of a class (i.e., fields and methods) to be declared by statically iterating over and pattern-matching on members of other classes. Such techniques, however, have been unable to safely express simple, but common, idioms such as declaring getter and setter methods for fields. In this paper, we present a mechanism that addresses the lack of expressiveness in past work without sacrificing safety. Our technique is based on the idea of nested patterns that elaborate the outer-most pattern with blocking or enabling conditions. We implemented this mechanism in a language, MorphJ. We demonstrate the expressiveness of MorphJ with real-world applications. In particular, the MorphJ reimplementation of DSTM2, a software transactional memory library, reduces 1,107 lines of Java reflection and bytecode engineering library calls to just 374 lines of MorphJ code. At the same time, the MorphJ solution is both high level and safer, as MorphJ can separately type check generic classes and catch errors early. We present and formalize the MorphJ type system, and offer a type-checking algorithm.

关键词： languages object-oriented programming structural abstraction class morphing aspect-oriented programming meta-programming language extensions

来源：评论

学校读者我要写书评

暂无评论

metaExploArrays : a large-scale oligonucleotide probe design software for explorative DNA microarrays

MetaExploArrays : a large-scale oligonucleotide probe design...

引用

13th International Conference on Parallel and Distributed Computing, Applications, and Technologies (PDCAT)

作者： Jaziri, Faouzi Hill, David R. C. Parisot, Nicolas Denonfoux, Jeremie Dugat-Bony, Eric Peyretaillade, Eric Peyret, Pierre Univ Blaise Pascal Clermont Univ Aubiere France LIMOS ISIMA CNRS UMR 6158 Aubiere France Univ Auvergne CRNH AUVERGNE IFR SANTE EA CIDAM EA 4678 Clermont Ferrand France Univ Auvergne Clermont Univ Aubiere France

ISBN: (纸本)9780769548791

The selection of oligonucleotide probes for microarrays is still very difficult task. With the rapid growth of environmental databases (metagenomics programs coupled to next generation sequencing), the computational capacity requirements of probe design algorithms have hugely increased. The use of parallel and distributed architectures can considerably reduce the complexity and the computational time of these algorithms. In this paper we present a new efficient algorithm of oligonucleotide probe selection for an individual specific nucleic acid sequence or a group of sequences. We used a model driven engineering approach to simultaneous design of thousands of sensitive, specific, isothermal and explorative probes, on both PC, multiprocessor, cluster and grid computing with on the one hand a significant computing speedup and on the other hand an improved quality of the resulting probes when compared to equivalent software.

关键词： meta-programming model driven engineering parallelization oligonucleotide probe design explorative probes thermodynamic complex environments

来源：评论

学校读者我要写书评

暂无评论

DCSLAM: A DYNAMICALLY CONSTRAINED REAL-TIME SLAM

DCSLAM: A DYNAMICALLY CONSTRAINED REAL-TIME SLAM

引用

IEEE International Conference on Image Processing (ICIP)

作者： Ramadasan, Datta Chateau, Thierry Chevaldonne, Marc Univ Blaise Pascal Inst Pascal Aubiere France Auvergne Univ ISIT Clermont Ferrand France

ISBN: (纸本)9781479983391

We propose a new real-time CSLAM algorithm (Constrained Simultaneous Localization And Mapping), named DCSLAM (dynamically constrained SLAM), designed to dynamically adapt each optimization to the variable number of parameters families and heterogeneous constraints. An automatic method is used to generate, from an exhaustive list of constraints, a dedicated optimization algorithm. This is, to our knowledge, the only implementation that combines flexibility and performance. The proposed experiments show the effectiveness of our approach in terms of accuracy and execution time compared to the state of the art on several public benchmarks of varying complexity. An augmented reality application mixing heterogeneous objects and constraints is also available.

关键词： SLAM real-time bundle adjustment meta-programming augmented reality

来源：评论

学校读者我要写书评

暂无评论

A Fresh Look at programming with Names and Binders 10

A Fresh Look at Programming with Names and Binders

引用

15th ACM SIGPLAN International Conference on Functional programming

作者： Pouillard, Nicolas Pottier, Francois INRIA Paris France

ISBN: (纸本)9781605587943

A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms which allow performing these manipulations in a safe and natural style has, to a large extent, remained elusive. In this paper, we present a novel approach to the problem. Our proposal can be viewed either as a programming language design or as a library: in fact, it is currently implemented within Agda. It provides a safe and expressive means of programming with names and binders. It is abstract enough to support multiple concrete implementations: we present one in nominal style and one in de Bruijn style. We use logical relations to prove that "well-typed programs do not mix names with different scope". We exhibit an adequate encoding of Pitts-style nominal terms into our system.

关键词： names binders meta-programming name abstraction higher-order abstract syntax

来源：评论

学校读者我要写书评

暂无评论

Forsaking Inheritance: Supercharged Delegation in DelphJ 13

Forsaking Inheritance: Supercharged Delegation in DelphJ

引用

2013 ACM SIGPLAN International Conference on Object Oriented programming Systems Languages

作者： Gerakios, Prodromos Biboudis, Aggelos Smaragdakis, Yannis Univ Athens Dept Informat Athens 15784 Greece

ISBN: (纸本)9781450323741

We propose DelphJ: a Java-based OO language that eschews inheritance completely, in favor of a combination of class morphing and (deep) delegation. Compared to past delegation approaches, the novel aspect of our design is the ability to emulate the best aspects of inheritance while retaining maximum flexibility: using morphing, a class can select any of the methods of its delegatee and export them (if desired) or transform them (e.g., to add extra arguments or modify type signatures), yet without needing to name these methods explicitly and handle them one-by-one. Compared to past work on morphing, our approach adopts and adapts advanced delegation mechanisms, in order to add late binding capabilities and, thus, provide a full substitute of inheritance. Additionally, we explore complex semantic issues in the interaction of delegation with late binding. We present our language design both informally, with numerous examples, and formally in a core calculus.

关键词： Languages meta-programming language extensions morphing object composition delegation static reflection

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：