scholarly journals A SYSTEMC language extension for high-level reconfiguration modelling

2008 ◽  
Author(s):  
Andreas Raabe ◽  
Armin Felke
Keyword(s):  
Language Extension ◽  
High Level

scholarly journals Implementing type theory in higher order constraint logic programming

2019 ◽  
Vol 29 (8) ◽  
pp. 1125-1150
Author(s):  
FERRUCCIO GUIDI ◽  
CLAUDIO SACERDOTI COEN ◽  
ENRICO TASSI
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Type System ◽  
Theorem Prover ◽  
Type Checking ◽  
Language Extension ◽  
Order Constraint ◽  
Simple Implementation ◽  
Calculus Of Inductive Constructions ◽  
High Level

In this paper, we are interested in high-level programming languages to implement the core components of an interactive theorem prover for a dependently typed language: the kernel – responsible for type-checking closed terms – and the elaborator – that manipulates open terms, that is terms containing unresolved unification variables.In this paper, we confirm that λProlog, the language developed by Miller and Nadathur since the 80s, is extremely suitable for implementing the kernel. Indeed, we easily obtain a type checker for the Calculus of Inductive Constructions (CIC). Even more, we do so in an incremental way by escalating a checker for a pure type system to the full CIC.We then turn our attention to the elaborator with the objective to obtain a simple implementation thanks to the features of the programming language. In particular, we want to use λProlog’s unification variables to model the object language ones. In this way, scope checking, carrying of assignments and occur checking are handled by the programming language.We observe that the eager generative semantics inherited from Prolog clashes with this plan. We propose an extension to λProlog that allows to control the generative semantics, suspend goals over flexible terms turning them into constraints, and finally manipulate these constraints at the meta-meta level via constraint handling rules.We implement the proposed language extension in the Embedded Lambda Prolog Interpreter system and we discuss how it can be used to extend the kernel into an elaborator for CIC.

scholarly journals Lightweight compilation of (C)LP to JavaScript

2012 ◽  
Vol 12 (4-5) ◽  
pp. 755-773 ◽  
Author(s):  
JOSE F. MORALES ◽  
RÉMY HAEMMERLÉ ◽  
MANUEL CARRO ◽  
MANUEL V. HERMENEGILDO
Keyword(s):  
Web Applications ◽  
Point Of View ◽  
Computing Device ◽  
Extension Mechanism ◽  
Language Extension ◽  
Industry Standards ◽  
Compilation Process ◽  
High Level ◽  
Client Side ◽  
Very High

AbstractWe present and evaluate a compiler from Prolog (and extensions) to JavaScript which makes it possible to use (constraint) logic programming to develop the client side of web applications while being compliant with current industry standards. Targeting JavaScript makes (C)LP programs executable in virtually every modern computing device with no additional software requirements from the point of view of the user. In turn, the use of a very high-level language facilitates the development of high-quality, complex software. The compiler is a back end of the Ciao system and supports most of its features, including its module system and its rich language extension mechanism based onpackages. We present an overview of the compilation process and a detailed description of the run-time system, including the support for modular compilation into separate JavaScript code. We demonstrate the maturity of the compiler by testing it with complex code such as a CLP(FD) library written in Prolog with attributed variables. Finally, we validate our proposal by measuring the performance of some LP and CLP(FD) benchmarks running on top of major JavaScript engines.

scholarly journals Three-Dimensional Fluid Code with XcalableMP

2020 ◽  
pp. 165-179
Author(s):  
Hitoshi Sakagami
Keyword(s):  
Decomposition Method ◽  
Programming Model ◽  
Domain Decomposition Method ◽  
Three Dimensional ◽  
Parallel Computers ◽  
Fortran Compiler ◽  
Language Extension ◽  
Local View ◽  
High Level ◽  
Portable Parallel Programming

AbstractIn order to adapt parallel computers to general convenient tools for computational scientists, a high-level and easy-to-use portable parallel programming paradigm is mandatory. XcalableMP, which is proposed by the XcalableMP Specification Working Group, is a directive-based language extension for Fortran and C to easily describe parallelization in programs for distributed memory parallel computers. The Omni XcalableMP compiler, which is provided as a reference XcalableMP compiler, is currently implemented as a source-to-source translator. It converts XcalableMP programs to standard MPI programs, which can be easily compiled by the native Fortran compiler and executed on most of parallel computers. A three-dimensional Eulerian fluid code written in Fortran is parallelized by XcalableMP using two different programming models with the ordinary domain decomposition method, and its performances are measured on the K computer. Programs converted by the Omni XcalableMP compiler prevent native Fortran compiler optimizations and show lower performance than that of hand-coded MPI programs. Finally almost the same performances are obtained by using specific compiler options of the native Fortran compiler in the case of a global-view programming model, but performance degradation is not improved by specifying any native compiler options when the code is parallelized by a local-view programming model.

Analysing Time-Related Properties of Service-Oriented Systems

2012 ◽  
pp. 36-60 ◽  
Author(s):  
Laura Bocchi ◽  
José Fiadeiro ◽  
Monika Solanki ◽  
Stephen Gilmore ◽  
João Abreu ◽  
...  
Keyword(s):  
Quality Of Service ◽  
Quantitative Analysis ◽  
Markovian Process ◽  
Formal Approach ◽  
Dynamically Reconfigurable ◽  
Language Extension ◽  
Service Oriented ◽  
High Level ◽  
Efficient Software

We present a formal approach for expressing and analysing time-related properties of service-oriented systems. Our aim is to make it possible for analysts to determine, based on models of services developed at early stages of design, what quality-of-service properties can be expected from, or offered by, the providers of those services. Our approach is based on an extension of SRML, a high-level modelling language developed in the Sensoria project for architectural and behavioural specification of dynamically reconfigurable service-oriented systems. The proposed language extension offers primitives that capture several kinds of delays that may occur during service provision. Quantitative analysis is supported by mapping SRML models to PEPA, a Markovian process algebra supported by a range of efficient software tools that can either confirm that required properties are met or provide feedback that can be used to improve the SRML model.

GroupSpeak: High-level Language Extension for Workflow Capability

2009 ◽  
Author(s):  
Moshe Gutman ◽  
Sridhar Radhakrishnan ◽  
Changwook Kim ◽  
Chandra N. Sekharan ◽  
Konstantin Laufer
Keyword(s):  
High Level Language ◽  
Language Extension ◽  
High Level

scholarly journals Extending C++ for Heterogeneous Quantum-Classical Computing

2021 ◽  
Vol 2 (2) ◽  
pp. 1-36
Author(s):  
Alexander Mccaskey ◽  
Thien Nguyen ◽  
Anthony Santana ◽  
Daniel Claudino ◽  
Tyler Kharazi ◽  
...  
Keyword(s):  
Forward Error Correction ◽  
Quantum Algorithm ◽  
System Level ◽  
Circuit Optimization ◽  
Language Extension ◽  
Quantum Programming ◽  
Near Term ◽  
Classical Computing ◽  
High Level ◽  
Forward Error

We present qcor—a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language agnostic manner, as well as a hardware-agnostic, retargetable compiler workflow targeting a number of physical and virtual quantum computing backends. qcor leverages novel Clang plugin interfaces and builds upon the XACC system-level quantum programming framework to provide a state-of-the-art integration mechanism for quantum-classical compilation that leverages the best from the community at-large. qcor translates quantum kernels ultimately to the XACC intermediate representation, and provides user-extensible hooks for quantum compilation routines like circuit optimization, analysis, and placement. This work details the overall architecture and compiler workflow for qcor, and provides a number of illuminating programming examples demonstrating its utility for near-term variational tasks, quantum algorithm expression, and feed-forward error correction schemes.

Transcription factor/DNA interactions visualized by electron spectroscopic imaging

1992 ◽  
Vol 50 (1) ◽  
pp. 450-451
Author(s):  
David P. Bazett-Jones ◽  
Mark L. Brown
Keyword(s):  
Transcription Factor ◽  
Dna Sequences ◽  
Transcription Initiation ◽  
Molecular Mechanisms ◽  
Phosphorus Content ◽  
Spectroscopic Imaging ◽  
Electron Spectroscopic Imaging ◽  
Dna Backbone ◽  
Two Parameters ◽  
High Level

A multisubunit RNA polymerase enzyme is ultimately responsible for transcription initiation and elongation of RNA, but recognition of the proper start site by the enzyme is regulated by general, temporal and gene-specific trans-factors interacting at promoter and enhancer DNA sequences. To understand the molecular mechanisms which precisely regulate the transcription initiation event, it is crucial to elucidate the structure of the transcription factor/DNA complexes involved. Electron spectroscopic imaging (ESI) provides the opportunity to visualize individual DNA molecules. Enhancement of DNA contrast with ESI is accomplished by imaging with electrons that have interacted with inner shell electrons of phosphorus in the DNA backbone. Phosphorus detection at this intermediately high level of resolution (≈lnm) permits selective imaging of the DNA, to determine whether the protein factors compact, bend or wrap the DNA. Simultaneously, mass analysis and phosphorus content can be measured quantitatively, using adjacent DNA or tobacco mosaic virus (TMV) as mass and phosphorus standards. These two parameters provide stoichiometric information relating the ratios of protein:DNA content.

Sign in / Sign up

Export Citation Format

Share Document