Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “Programming language implementation”

An implementation of the Impala programming language

Danru Wang, Derek Kiong, Benjamin Yin Hon Lian · 2002

Impala is a strongly-typed imperative parallel programming language based on CSP. We implement it on SunOS using the multithreading facilities, to obtain a convenient and practical parallel programming tool. In this paper, we provide details of implementation techniques and performance evaluation bench-mark.

Cited by 0

ROOT RNTuple implementation in Julia programming language

Jerry Ling, T. Gal · Springer Link (Chiba Institute of Technology) · 2025

RNTuple is the upcoming primary data storage solution at the Large Hadron Collider (LHC) experiments and other high-energy physics (HEP) experiments going forward. Aside from many technical upgrades from the TTree object, RNTuple also is the first time .root file committed to specification.[1] In this paper we present the latest development in UnROOT.jl that enables both the reading and writing of complex table-like data structures in Julia with RN-Tuple. At the moment this is the most complete 3rd party libraries that can read and write RNTuple data outside of C++ ROOT.

Cited by 0

Product line implementation technologies. Programming language view

Patzke, T., Muthig, D. · Fraunhofer-Publica (Fraunhofer-Gesellschaft) · 2022

Nearly all software organizations today develop and maintain more than a single product. This holds for organizations that develop tailored systems individually for single customers, as well as for organizations that develop products for a mass market. The products developed by an organization typically are similar applications in the same application domain. Hence, these products share some common characteristics and thus can be viewed as a software product line. To implement a product line approach in practice, special technologies are required that effectively support the identification of reusable artifacts, as well as explicit means for capturing and controlling commonalities and variabilities. The focus of the PoLITe project are product line technologies at the implementation level. PoLITe defines three categories of implementation technologies [MAL+02], namely configuration management, component technologies, and generative features of programming languages (including generators). This report summarizes the product line implementation aspects in the programming- language dimension. The report first defines the term "programming language" and its role in the PoLITe context, surveys the actual distribution of programming languages in practice. It further categorizes variability techniques in the programming-language dimension and describes numerous of them in detail. This categorization is complemented by a high-level process that integrates the systematic usage of variability techniques throughout the implementation activities. Finally, the application of variability techniques is illustrated by two case studies: one uses C++, the other Java analogously.

Cited by 2Open access

Programming Language CAMIL II. Implementation and Evaluation.

Edward M. Gardner · Defense Technical Information Center (DTIC) · 1978

A reimplementation of Computer assisted/managed instruction language (CAMIL) for qualitative and quantitative improvements in the software is presented. The reformatted language is described narratively, and major components of the system software are indicated and discussed. Authoring aids and imbedded support facilities are also described, and key CAMIL programs used in the development are discussed. The resulting system offers a method for future improvement of the Air Force Advanced Instructional System (AIS) computer support system without expenditure of additional funds for computer support. (Author)

Cited by 0

ROOT RNTuple implementation in Julia programming language

Jerry Ling, T. Gal · EPJ Web of Conferences · 2025

RNTuple is the upcoming primary data storage solution at the Large Hadron Collider (LHC) experiments and other high-energy physics (HEP) experiments going forward. Aside from many technical upgrades from the TTree object, RNTuple also is the first time .root file committed to specification.[1] In this paper we present the latest development in UnROOT.jl that enables both the reading and writing of complex table-like data structures in Julia with RN-Tuple. At the moment this is the most complete 3rd party libraries that can read and write RNTuple data outside of C++ ROOT.

Cited by 0Open access

THE IMPLEMENTATION OF THE SLOTH PROGRAMMING LANGUAGE

DIEGO FERNANDES NEHAB · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · 2002

Este trabalho descreve uma nova linguagem de programação \nfuncional e sua implementação.\nSloth é uma linguagem funcional pura interpretada, não \nestrita, que suporta funções de ordem\nelevada como valores de primeira classe, tipos de dados \nestruturados e definições múltiplas de\nfunções selecionadas por casamento de padrões.\nSloth foi criada para o uso no meio acadêmico, em \natividades relacionadas ao uso e à implementação de \nlinguagens funcionais. Sendo assim, durante o \ndesenvolvimento de Sloth, uma\ngrande preocupação com a simplicidade direcionou tanto a \nespecificação da linguagem quanto\nsua implementação. Como resultado, a sintaxe da linguagem é \nmodesta, mas expressiva o bastante\npara permitir seu uso em aplicações práticas. Da mesma \nforma, a grande simplicidade e\nportabilidade de sua implementação não prejudicam \nseveramente sua eficiência.\nAs principais contribuições do trabalho são o projeto e \ndesenvolvimento de Sloth, uma otimização \nà redução de grafos combinatórios como alternativa ao uso \ndos combinadores de Turner,\numa arquitetura inovadora para a implementação de \nlinguagens funcionais interpretadas, baseada\nno uso cooperativo de duas linguagens de programação, e \numa análise comparativa entre a\neficiência de Sloth e outras linguagens semelhantes.

Cited by 0Open access

The Fork95 Parallel Language" Design, Application Programming Implementation,

Christoph W. Ke, Helmut Seidl · 1997

Fork95 is an imperative parallel programming language intended to express algorithms for synchronous shared memory machines (PRAMs). It is based on ANSI C and offers additional constructs to hierarchically divide processor groups into subgroups and manage shared and private address subspaces. Fork95 makes the assembly-level synchronicity of the underlying hardware available to the programmer at the language level. Nevertheless, it supports locally asynchronous computation where desired by the programmer. We present a one pass compiler, fcc, which compiles Fork95 and C programs to the SB-PRAM machine. The SB-PRAM is a lock-step synchronous, massively parallel multiprocessor currently being built at Saarbrficken University, with a physically shared memory and uniform memory access time. We examine three important types of parallel computation frequently used for the parallel solution of real-world problems. While farming and parallel divide-and-conquer are directly supported by Fork95 language constructs, pipelining can be easily expressed using existing language features; an additional language construct for pipelining is not required.

Cited by 0

The Distributed Programming Language INSEL - Concepts and Implementation

H.-M. Windisch · 1996

In this paper the high-level distributed programming language INSEL and its Mach-based runtime system are presented. INSEL is a general purpose programming language for parallel and distributed programming. INSEL is objectbased and allows for client/server-style as well as DSM-style programming on a high level of abstraction. To achieve runtime efficiency of INSEL-systems a distributed manager architecture has been devised which acts as a framework for a variety of alternatives for the transformation of languagelevel objects to basic mechanisms supplied by an underlying distributed base layer. The decisions on object placement, object representation and object access are based on compile-time and run-time analysis to gain high performance by exploiting static and dynamic knowledge of object properties. 1. Introduction With the advent of powerful workstations and high speed interconnects such as FDDI or ATM networks of workstations (NOWs) offer a growing potential for parallel computin...

Cited by 0

Automatic differentiation: Implementation in the Ada programming language

Robert Herloski · RIT Scholar Works (Rochester Institute of Technology) · 1987

This thesis describes the characteristics of a novel computational technique called automatic differentiation, and gives an implementation of this technique in the Ada® programming language. Automatic differentiation is a technique with which one can directly calculate the value of any partial derivative of nearly any function that has been programmed into a computer (at any point of interest), without requiring the algebraic derivation of the desired partial derivative of the function of interest. It is closely related to the technique of power series manipulation, with which one can find, for example, the sum, product, square root, etc., of given power series. The result of this work is an Ada package called DIFFERENTIALS, which exports various types and functions that can be included in user programs. The first half of this thesis describes the technique of automatic differentiation, gives the fundamental specification for the DIFFERENTIALS package, and explains the details of the implementation. The second half of this thesis gives specific examples of the use of DIFFERENTIALS in the area of optical system analysis. Presented there are several user programs that use the DIFFERENTIALS package to calculate various partial derivatives of the ray tracing function, and illustrate the proper usage of this package.

Cited by 0Open access