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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

86 篇 会议
72 篇 期刊文献
10 篇 学位论文
3 册 图书

馆藏范围

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

日期分布

学科分类号

151 篇 工学
- 107 篇 软件工程
- 104 篇 计算机科学与技术...
- 16 篇 电气工程
- 6 篇 控制科学与工程
- 3 篇 信息与通信工程
- 2 篇 网络空间安全
- 1 篇 仪器科学与技术
13 篇 理学
- 9 篇 数学
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 生物学
- 1 篇 统计学（可授理学、...
7 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
- 1 篇 公共管理
1 篇 文学
- 1 篇 外国语言文学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

171 篇 metaprogramming
18 篇 languages
15 篇 reflection
12 篇 design
11 篇 code generation
10 篇 java
8 篇 macros
6 篇 domain-specific ...
6 篇 dependent types
6 篇 functional progr...
6 篇 programming lang...
5 篇 type systems
5 篇 automatic verifi...
5 篇 c++
5 篇 type soundness
5 篇 staging
5 篇 language extensi...
5 篇 smalltalk
4 篇 compilers
4 篇 multi-stage prog...

机构

5 篇 tu berlin
4 篇 univ colorado bo...
4 篇 ecole polytech f...
4 篇 tech univ darmst...
4 篇 brno university ...
3 篇 indiana univ blo...
2 篇 univ nottingham ...
2 篇 univ waterloo wa...
2 篇 tech univ kosice...
2 篇 princeton univ p...
2 篇 delft univ techn...
2 篇 univ gothenburg ...
2 篇 univ massachuset...
2 篇 mit csail cambri...
2 篇 microsoft res re...
2 篇 univ st andrews ...
2 篇 carnegie mellon ...
2 篇 imperial coll lo...
2 篇 eindhoven univ t...
2 篇 univ cambridge c...

作者

4 篇 erdweg sebastian
4 篇 rompf tiark
4 篇 lorenzen florian
3 篇 siek jeremy
3 篇 van der storm ti...
3 篇 miao weiyu
3 篇 tanter eric
3 篇 yallop jeremy
3 篇 chiba shigeru
3 篇 kollar jan
2 篇 laszlo zoltan
2 篇 hirschfeld rober...
2 篇 levy ls
2 篇 jansson patrik
2 篇 monperrus martin
2 篇 christiansen dav...
2 篇 leshob abderrahm...
2 篇 kiselyov oleg
2 篇 godoy william f.
2 篇 michael ball

语言

150 篇 英文
19 篇 其他
1 篇 葡萄牙文
1 篇 中文

检索条件"主题词=Metaprogramming"

共 171 条记录，以下是91-100 订阅

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

详细简洁

排序：

Embedded Parser Generators

Embedded Parser Generators

引用

4th Haskell Symposium

作者： Duregard, Jonas Jansson, Patrik Chalmers Univ Technol Gothenburg Sweden Univ Gothenburg Gothenburg Sweden

ISBN: (纸本)9781450308601

We present a novel method of embedding context-free grammars in Haskell, and to automatically generate parsers and pretty-printers from them. We have implemented this method in a library called BNFC-meta (from the BNF Converter, which it is built on). The library builds compiler front ends using metaprogramming instead of conventional code generation. Parsers are built from labelled BNF grammars that are defined directly in Haskell modules. Our solution combines features of parser generators (static grammar checks, a highly specialised grammar DSL) and adds several features that are otherwise exclusive to combinatory libraries such as the ability to reuse, parameterise and generate grammars inside Haskell. To allow writing grammars in concrete syntax, BNFC-meta provides a quasi-quoter that can parse grammars (embedded in Haskell files) at compile time and use metaprogramming to replace them with their abstract syntax. We also generate quasi-quoters so that the languages we define with BNFC-meta can be embedded in the same way. With a minimal change to the grammar, we support adding anti-quotation to the generated quasi-quoters, which allows users of the defined language to mix concrete and abstract syntax almost seamlessly. Unlike previous methods of achieving anti-quotation, the method used by BNFC-meta is simple, efficient and avoids polluting the abstract syntax types.

关键词： Design Experimentation Languages metaprogramming Domain Specific Languages

来源：评论

学校读者我要写书评

暂无评论

Type Theory in Type Theory using Quotient Inductive Types 16

Type Theory in Type Theory using Quotient Inductive Types

引用

43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)

作者： Altenkirch, Thorsten Kaposi, Ambrus Univ Nottingham Sch Comp Sci Nottingham NG7 2RD England

ISBN: (纸本)9781450335492

We present an internal formalisation of a type heory with dependent types in Type Theory using a special case of higher inductive types from Homotopy Type Theory which we call quotient inductive types (QITs). Our formalisation of type theory avoids referring to preterms or a typability relation but defines directly well typed objects by an inductive definition. We use the elimination principle to define the set-theoretic and logical predicate interpretation. The work has been formalized using the Agda system extended with QITs using postulates.

关键词： Higher Inductive Types Homotopy Type Theory Logical Relations metaprogramming Agda

来源：评论

学校读者我要写书评

暂无评论

A Novice-Friendly Induction Tactic for Lean 2021

A Novice-Friendly Induction Tactic for Lean

引用

10th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP)

作者： Limperg, Jannis Vrije Univ Amsterdam Dept Comp Sci Amsterdam Netherlands

ISBN: (纸本)9781450382991

In theorem provers based on dependent type theory such as Coq and Lean, induction is a fundamental proof method and induction tactics are omnipresent in proof scripts. Yet the ergonomics of existing induction tactics are not ideal: they do not reliably support inductive predicates and relations;they sometimes generate overly specific or unnecessarily complex induction hypotheses;and they occasionally choose confusing names for the hypotheses they introduce. This paper describes a new induction tactic, implemented in Lean 3, which addresses these issues. The tactic is particularly suitable for educational use, but experts should also find it more convenient than existing induction tactics. In addition, the tactic serves as a moderately complex case study for the metaprogramming framework of Lean 3. The paper describes some difficulties encountered during the implementation and suggests improvements to the framework.

关键词： induction tactic Lean metaprogramming type theory

来源：评论

学校读者我要写书评

暂无评论

Composable Sequence Macros for Fast Iteration 2022

Composable Sequence Macros for Fast Iteration

引用

21st ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences (GPCE)

作者： Bolotina, Anna Culpepper, Ryan Czech Tech Univ Prague Czech Republic

ISBN: (纸本)9781450399203

Racket provides for loops with macro-extensible sequence expressions. Sequence macros offer better performance than dynamic sequence implementations, but they are complicated to define and Racket offers little support for creating new sequence macros by combining existing ones. In this paper, we develop such support in the form of sequence combinator macros and a general comprehension form. These utilities are implemented by manipulating compile-time records that contain binders and expressions;the binding relationships between the components are not trivial. We discuss how to diagnose and solve type and scoping problems in our implementation.

关键词： macros metaprogramming syntactic abstraction extensible languages sequences

来源：评论

学校读者我要写书评

暂无评论

Sound Type-Dependent Syntactic Language Extension 16

Sound Type-Dependent Syntactic Language Extension

引用

43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)

作者： Lorenzen, Florian Erdweg, Sebastian TU Berlin Berlin Germany Tech Univ Darmstadt Darmstadt Germany

ISBN: (纸本)9781450335492

Syntactic language extensions can introduce new facilities into a programming language while requiring little implementation effort and modest changes to the compiler. It is typical to desugar language extensions in a distinguished compiler phase after parsing or type checking, not affecting any of the later compiler phases. If desugaring happens before type checking, the desugaring cannot depend on typing information and type errors are reported in terms of the generated code. If desugaring happens after type checking, the code generated by the desugaring is not type checked and may introduce vulnerabilities. Both options are undesirable. We propose a system for syntactic extensibility where desugaring happens after type checking and desugarings are guaranteed to only generate well-typed code. A major novelty of our work is that desugarings operate on typing derivations instead of plain syntax trees. This provides desugarings access to typing information and forms the basis for the soundness guarantee we provide, namely that a desugaring generates a valid typing derivation. We have implemented our system for syntactic extensibility in a language independent fashion and instantiated it for a substantial subset of Java, including generics and inheritance. We provide a sound Java extension for Scala-like for-comprehensions.

关键词： Language extensibility type soundness type-dependent desugaring automatic verification metaprogramming macros

来源：评论

学校读者我要写书评

暂无评论

An Architecture for Dynamic Web Services that Integrates Adaptive Object Models with Existing Frameworks 19

An Architecture for Dynamic Web Services that Integrates Ada...

引用

13th Brazilian Symposium on Software Components, Architectures, and Reuse (SBCARS) / 10th Brazilian Conference on Software (CBSOFT)

作者： Dias, Antonio Guerra, Eduardo Lima, Phyllipe INPE Natl Inst Space Res Sao Jose Dos Campos SP Brazil

ISBN: (纸本)9781450376372

Nowadays, web services became one of the main alternatives for communication between software systems and even inside the components of the same application. In some domains, the change of requirements happens frequently, demanding flexibility from the architecture of the applications, and consequently also in the web services that they provide. In this context, the goal of this work is to provide an architecture that can be used for dynamic web services, allowing services to be changed and introduced at runtime. To fulfill these requirements this work proposes the usage of Adaptive Object Models (AOM) combined with existing web service framework, using dynamic adapters to integrate and decouple them. The framework Esfinge AOM Role Mapper received features to implement the behavioral part of the AOM model and to map the AOM rule objects with metadata to methods with code annotations in the dynamic adapters. The proposed architecture passes the adapters generated at runtime to the existing framework, which provide the web service based on its methods and code annotations. An evaluation based on a case study performed scenario-based tests to verify the architecture capability to create and change dynamic web services. Additionally, a modularity analysis verified the coupling between classes that use both frameworks. As a result, the proposed architectural solution was able to implement the dynamic web services in all the scenarios keeping the classes that handle the AOM model decoupled from the classes responsible for providing the web services.

关键词： Adaptive Object Model Software Engineering Framework metaprogramming Web Services Reuse

来源：评论

学校读者我要写书评

暂无评论

SORCER: COMPUTING AND METACOMPUTING INTERGRID

SORCER: COMPUTING AND METACOMPUTING INTERGRID

引用

10th International Conference on Enterprise Information Systems

作者： Soblewski, Michael Texas Tech Univ Lubbock TX 79409 USA

ISBN: (纸本)9789898111388

This paper investigates grid computing from the point of view three basic computing platforms. Each platform considered consists of virtual compute resources, a programming environment allowing for the development of grid applications, and a grid operating system to execute user programs and to make solving complex user problems easier. Three platforms are discussed: compute grid, metacompute grid and intergrid. Service protocol-oriented architectures are contrasted with service object-oriented architectures, then the current SORCER metacompute grid based on a service object-oriented architecture and a new metacomputing paradigm is described and analyzed. Finally, we explain how SORCER, with its core services and federated file system, can also be used as a traditional compute grid and an intergrid-a hybrid of compute and metacompute grids.

关键词： Metacomputing metaprogramming grid computing service-oriented architectures service-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Concrete Syntax Metapatterns 17

Concrete Syntax Metapatterns

引用

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

作者： Miljak, Luka Poulsen, Casper Bach Corvino, Rosilde Delft Univ Technol Delft Netherlands TNO ESI Eindhoven Netherlands

ISBN: (纸本)9798400711800

Software engineers should be able to apply massive code refactorings tomaintain large legacy code bases. Akey aspect of developing restructurings is matching and transforming code snippets using abstract syntax trees (ASTs). Matching on ASTs is typically done through AST patterns with holes. AST patterns can be extended to become metapatterns, which increase their expressivity. Metapattern examples include disjunctions, descendant patterns, and patches where we inline transformations into the pattern itself. Despite their expressivity, abstract syntax (meta)patterns can become verbose and require restructuring engineers to be intimately familiar with the data types that define the AST. A better approach is to use concrete syntax patterns, which allows us to denote our patterns in the syntax of the object language. Previous work has shown that we can use external black-box parsers of the object language to compile concrete syntax patterns for arbitrary languages. In this paper, we scale this compilation method to support concrete syntax metapatterns, which allows for a more declarative way of expressing restructurings. We evaluate this method through an implementation written in Kotlin.

关键词： refactoring restructuring metaprogramming concrete syntax black-box parsers

来源：评论

学校读者我要写书评

暂无评论

Achieving Natural Mathematical Expression Programming on GPUs via Expression Templates

Achieving Natural Mathematical Expression Programming on GPU...

引用

UKSim-AMSS 7th European Modelling Symposium on Computer Modelling and Simulation (EMS)

作者： Breglia, Alfonso Capozzoli, Amedeo Curcio, Claudio Liseno, Angelo Univ Naples Federico II Dipartimento Ingn Elettr & Tecnol Informaz I-80125 Naples Italy

ISBN: (纸本)9781479925780

We present the development of one of the first libraries based on the so-called expression templates technique to simplify the implementation of CPU and parallel GPU codes. Expression templates allow to express matrix algebra operations to be executed either on the CPU or on the GPU with a syntax very close to the natural mathematical one. The developed library has been deeply optimized so that the same performance of standard C/C++ or CUDA codings is kept.

关键词： metaprogramming CUDA expression templates GPU

来源：评论

学校读者我要写书评

暂无评论

From Transpilers to Semantic Libraries Formal Verification With Pluggable Semantics 24

From Transpilers to Semantic Libraries Formal Verification W...

引用

ACM/IEEE 27th International Conference on Model Driven Engineering Languages and Systems: Companion Proceedings (MODELS)

作者： Zavada, Armin Marussy, Kristof Molnar, Vince Budapest Univ Technol & Econ Budapest Hungary

ISBN: (纸本)9798400706226

In the field of model-based systems engineering, there is an increasing demand for the application of formal methods. However, this requires expertise in formal methods, which cannot be expected from systems engineers. While several attempts have been made to bridge this gap, there are still open questions. (1) With the trend shifting towards ontological languages, systems are modeled as classes of 4D occurrences, rather than a 3D system evolving with time, which hinders the application of state-of-the-art model checking algorithms. (2) Ontological reasoning cannot handle the state space explosion problem, and can even make it harder for verifiers to operate efficiently. (3) When operationalizing ontological languages, we need to validate the conformance of the two semantics, even in the presence of optimizations. (4) On top of all, these challenges must be solved for every new engineering language, version, or variant. In this paper, we propose a new approach to address the aforementioned challenges. To validate its feasibility, we present a prototype tool and evaluate it on a SysML model.

关键词： model-based systems engineering kernel modeling language formal verification declarative interpretation metaprogramming semantic libraries operational libraries

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：