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

OntoJIT: Parsing Native OWL DL into Executable Ontologies in an Object Oriented Paradigm 1

13th International Workshop on OWL - Experiences and Directions (OWLED) / 5th International Workshop on OWL Reasoner Evaluation (ORE)

作者： Baset, Sohaila Stoffel, Kilian Univ Neuchatel Informat Management Inst Neuchatel Switzerland

ISBN: (数字)9783319546278

ISBN: (纸本)9783319546261;9783319546278

Despite meriting the growing consensus between researchers and practitioners of ontology modeling, the Web Ontology Language OWL still has a modest presence in the communities of "traditional" web developers and software engineers. This resulted in hoarding the semantic web field in a rather small circle of people with a certain profile of expertise. In this paper we present OntoJIT, our novel approach toward a democratized semantic web where we bring OWL ontologies into the comfort-zone of end-application developers. We focus particularly on parsing OWL source files into executable ontologies in an object oriented programming paradigm. We finally demonstrate the dynamic code-base created as the result of parsing some reference OWL DL ontologies.

关键词： Ontologies OWL Semantic web meta programming Dynamic compilation

来源：评论

学校读者我要写书评

暂无评论

Constructing a User-Centric IoT Framework for Software Integration in a Smart Home Environment 10

Constructing a User-Centric IoT Framework for Software Integ...

引用

10th International Conference on Ubi-media Computing and Workshops (Ubi-Media)

作者： Chen, Peng Wen Chen, Yung-Hui Wu, Yi-Hsien Oriental Inst Technol Dept Informat Management New Taipei Taiwan Lunghwa Univ Sci & Technol Dept Comp Informat & Network Engn Taoyuan Taiwan

ISBN: (纸本)9781538627617

High interactivity between human beings and the things that they use in their daily lives has resulted in the development of the Internet of Everything (IoE). While this user centric paradigm requires a new software design philosophy, it is anticipated that incremental refinement software and its consistent interface will replace traditional software. This paper proposes a user-centric gateway and framework for software integration. We treat the users and things at the same programming language level. The inter-connected activities are mapped with object instances and events in a software runtime environment. "Everything" is notified to respond or not respond by means of messages, and a smart home environment and its related objects and methodology are provided to demonstrate the framework for cross reference. Because the same working level is used for the objects, the idea of plug and play mechanism can be realized.

关键词： Ubiquitous Life Plug and Play IoT meta programming IoE gateway and middle-ware smart home context aware IoE

来源：评论

学校读者我要写书评

暂无评论

Modern Generative programming for Optimizing Small Matrix-Vector Multiplication 16

Modern Generative Programming for Optimizing Small Matrix-Ve...

引用

International Conference on High Performance Computing & Simulation (HPCS)

作者： Penuchot, Jules Falcou, Joel Khabou, Amal Univ Paris Sud F-91405 Orsay France Univ Paris Saclay Univ Paris Sud F-91405 Orsay France

ISBN: (纸本)9781538678794

BLAS-level functions are the cornerstone of a large subset of applications. If a large body of work surrounding efficient and large-scale implementation of some routines such as gemv exists, the interest for small-sized, highly-optimized versions of those routines emerged. In this paper, we propose to show how a modern C++ approach based on generative programming techniques such as vectorization and loop unrolling in the framework of meta-programming can deliver efficient automatically generated codes for such routines, that are competitive with existing, hand-tuned library kernels with a very low programming effort compared to writing assembly code. In particular, we analyze the performance of automatically generated small-sized gemv kernels for both Intel x86 and ARM processors. We show through a performance comparison with the OpenBLAS gemv kernel on small matrices of sizes ranging from 4 to 32 that our C++ kernels are very efficient and may have a performance that is up to 3 times better than that of OpenBLAS gemv.

关键词： C plus generative programming meta programming BLAS matrix-vector product (gemv) SIMD vectorization loop unrolling

来源：评论

学校读者我要写书评

暂无评论

Coq Coq Correct! Verification of type checking and erasure for Coq, in Coq

Coq Coq Correct! Verification of type checking and erasure f...

引用

Proceedings of the ACM on programming Languages

作者： Sozeau, Matthieu Boulier, Simon Forster, Yannick Tabareau, Nicolas Winterhalter, Théo Inria Paris and IRIF CNRS Université Paris Diderot France Gallinette Inria Nantes France Saarland University Germany

Coq is built around a well-delimited kernel that perfoms typechecking for definitions in a variant of the Calculus of Inductive Constructions (CIC). Although the metatheory of CIC is very stable and reliable, the correctness of its implementation in Coq is less clear. Indeed, implementing an efficient type checker for CIC is a rather complex task, and many parts of the code rely on implicit invariants which can easily be broken by further evolution of the code. Therefore, on average, one critical bug has been found every year in Coq. This paper presents the first implementation of a type checker for the kernel of Coq (without the module system and template polymorphism), which is proven correct in Coq with respect to its formal specification and axiomatisation of part of its metatheory. Note that because of Gödel's incompleteness theorem, there is no hope to prove completely the correctness of the specification of Coq inside Coq (in particular strong normalisation or canonicity), but it is possible to prove the correctness of the implementation assuming the correctness of the specification, thus moving from a trusted code base (TCB) to a trusted theory base (TTB) paradigm. Our work is based on the metaCoq project which provides metaprogramming facilities to work with terms and declarations at the level of this kernel. Our type checker is based on the specification of the typing relation of the Polymorphic, Cumulative Calculus of Inductive Constructions (PCUIC) at the basis of Coq and the verification of a relatively efficient and sound type-checker for it. In addition to the kernel implementation, an essential feature of Coq is the so-called extraction: the production of executable code in functional languages from Coq definitions. We present a verified version of this subtle type-and-proof erasure step, therefore enabling the verified extraction of a safe type-checker for Coq. © 2020 Copyright held by the owner/author(s).

关键词： Theorem proving Calculations Extraction Formal logic Formal specification Calculus of inductive constructions Certification Essential features Executable codes Functional languages meta programming Proof assistant Type checker

来源：评论

学校读者我要写书评

暂无评论

An EDSL Approach to High Performance Haskell programming

引用

ACM SIGPLAN NOTICES 2013年第12期48卷 1-11页

作者： Ankner, Johan Svenningsson, Josef Chalmers Univ Technol Gothenburg Sweden

This paper argues for a new methodology for writing high performance Haskell programs by using Embedded Domain Specific Languages. We exemplify the methodology by describing a complete library, meta-repa, which is a reimplementation of parts of the repa library. The paper describes the implementation of meta-repa and contrasts it with the standard approach to writing high performance libraries. We conclude that even though the embedded language approach has an initial cost of defining the language and some syntactic overhead it gives a more tailored programming model, stronger performance guarantees, better control over optimizations, simpler implementation of fusion and inlining and allows for moving type level programming down to value level programming in some cases. We also provide benchmarks showing that meta-repa is as fast, or faster, than repa. Furthermore, meta-repa also includes push arrays and we demonstrate their usefulness for writing certain high performance kernels such as FFT.

关键词： EDSL array programming optimization meta programming

来源：评论

学校读者我要写书评

暂无评论

Breaking through the Normalization Barrier: A Self-Interpreter for F-omega

引用

ACM SIGPLAN NOTICES 2016年第1期51卷 5-17页

作者： Brown, Matt Palsberg, Jens Univ Calif Los Angeles Los Angeles CA USA

According to conventional wisdom, a self-interpreter for a strongly normalizing lambda-calculus is impossible. We call this the normalization barrier. The normalization barrier stems from a theorem in computability theory that says that a total universal function for the total computable functions is impossible. In this paper we break through the normalization barrier and define a self-interpreter for System F-omega, a strongly normalizing lambda-calculus. After a careful analysis of the classical theorem, we show that static type checking in F-omega can exclude the proof's diagonalization gadget, leaving open the possibility for a self-interpreter. Along with the self-interpreter, we program four other operations in F-omega, including a continuation-passing style transformation. Our operations rely on a new approach to program representation that may be useful in theorem provers and compilers.

关键词： Languages Theory Lambda Calculus Self Representation Self Interpretation meta programming

来源：评论

学校读者我要写书评

暂无评论

Mixing Source and Bytecode A Case for Compilation by Normalization

引用

ACM SIGPLAN NOTICES 2008年第10期43卷 91-107页

作者： Kats, Lennart C. L. Bravenboer, Martin Visser, Eelco Delft Univ Technol Dept Software Technol NL-2600 AA Delft Netherlands Univ Oregon Dept Comp & Informat Sci Eugene OR 97403 USA

Language extensions increase programmer productivity by providing concise, often domain-specific syntax, and support for static verification of correctness, security, and style constraints. Language extensions can often be realized through translation to the base language, supported by preprocessors and extensible compilers. However, various kinds of extensions require further adaptation of a base compiler's internal stages and components, for example to support separate compilation or to make use of low-level primitives of the platform (e. g., jump instructions or unbalanced synchronization). To allow for a more loosely coupled approach, we propose an open compiler model based on normalization steps from a high-level language to a subset of it, the core language. We developed such a compiler for a mixed Java and (core) bytecode language, and evaluate its effectiveness for composition mechanisms such as traits, as well as statement-level and expression-level language extensions.

关键词： Languages Design Dryad Compiler Stratego Java Bytecode SDF Compilers meta programming Embedded Languages Language Extensions Domain-Specific Languages Source Tracing Traits Iterators

来源：评论

学校读者我要写书评

暂无评论

Flask: Staged functional programming for sensor networks

引用

ACM SIGPLAN NOTICES 2008年第9期43卷 335-345页

作者： Mainland, Geoffrey Morrisett, Greg Welsh, Matt Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA

Severely resource-constrained devices present a confounding challenge to the functional programmer: we are used to having powerful abstraction facilities at our fingertips, but how can we make use of these tools on a device with an 8-or 16-bit CPU and at most tens of kilobytes of RAM? Motivated by this challenge, we have developed Flask, a domain specific language embedded in Haskell that brings the power of functional programming to sensor networks, collections of highly resource-constrained devices. Flask consists of a staging mechanism that cleanly separates node-level code from the meta-language used to generate node-level code fragments;syntactic support for embedding standard sensor network code;a restricted subset of Haskell that runs on sensor networks and constrains program space and time consumption;a higher-level "data stream" combinator library for quickly constructing sensor network programs;and an extensible runtime that provides commonly-used services. We demonstrate Flask through several small code examples as well as a compiler that generates node-level code to execute a network-wide query specified in a SQL-like language. We show how using Flask ensures constraints on space and time behavior. Through microbenchmarks and measurements on physical hardware, we demonstrate that Flask produces programs that are efficient in terms of CPU and memory usage and that can run effectively on existing sensor network hardware.

关键词： languages design meta programming

来源：评论

学校读者我要写书评

暂无评论

lbmpy: Automatic code generation for efficient parallel lattice Boltzmann methods

引用

JOURNAL OF COMPUTATIONAL SCIENCE 2021年 49卷 101269-101269页

作者： Bauer, Martin Koestler, Harald Ruede, Ulrich Friedrich Alexander Univ Erlangen Nurnberg Lehrstuhl Syst Simulat Cauerstr 11 D-91058 Erlangen Germany CERFACS F-31057 Toulouse 1 France

Lattice Boltzmann methods are a popular mesoscopic alternative to classical computational fluid dynamics based on the macroscopic equations of continuum mechanics. Many variants of lattice Boltzmann methods have been developed that vary in complexity, accuracy, and computational cost. Extensions are available to simulate multi phase, multi-component, turbulent, and non-Newtonian flows. In this work we present lbmpy, a code generation package that supports a wide variety of different lattice Boltzmann methods. Additionally, lbmpy provides a generic development environment for new schemes. A high-level domain-specific language allows the user to formulate, extend and test various lattice Boltzmann methods. In all cases, the lattice Boltzmann method can be specified in symbolic form. Transformations that operate on this symbolic representation yield highly efficient compute kernels. This is achieved by automatically parallelizing the methods, and by various application-specific automatized steps that optimize the resulting code. This pipeline of transformations can be applied to a wide range of lattice Boltzmann variants, including singleand two-relaxation-time schemes, multi-relaxation-time methods, as well as the more advanced cumulant methods, and entropically stabilized methods. lbmpy can be integrated into high-performance computing frameworks to enable massively parallel, distributed simulations. This is demonstrated using the WALBERLA multiphysics package to conduct scaling experiments on the SuperMUCNG supercomputing system on up to 147 456 compute cores.

关键词： meta programming LBM hpc

来源：评论

学校读者我要写书评

暂无评论

Nikola: Embedding Compiled GPU Functions in Haskell

引用

ACM SIGPLAN NOTICES 2010年第11期45卷 67-77页

作者： Mainland, Geoffrey Morrisett, Greg Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA

We describe Nikola, a first-order language of array computations embedded in Haskell that compiles to GPUs via CUDA using a new set of type-directed techniques to support re-usable computations. Nikola automatically handles a range of low-level details for Haskell programmers, such as marshaling data to/from the GPU, size inference for buffers, memory management, and automatic loop parallelization. Additionally, Nikola supports both compile-time and run-time code generation, making it possible for programmers to choose when and where to specialize embedded programs.

关键词： Languages Design meta programming CUDA GPU

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：