A computer-implemented method and system for reducing the amount of memory space required to store applications written in dynamic scripting languages loads a program module into memory and removes a category of program code, such as debug information or function definitions, from the program module. The method and system also receives a request for debug information, or a function call or query, and determines whether or not the corresponding program code is in memory. If not, then the location in storage is identified where the program module is stored, and another copy containing the corresponding program code is loaded into memory. The corresponding program code is located and copied into the program module in memory, and a response is provided to the request.

The present disclosure describes a method and system for generating and managing software builds for distributed applications includes scanning the source project folder to generate a source graph representing file dependencies within the source folder; compiling the one or more files in the source project folder to generate compiled code for each of the plurality of targets using the source graph; linking and writing the compiled code as linked files or written files for one or more of the plurality of targets; and writing the distribution manifest file to a build directory, the distribution manifest file including the linked or written files.

A transfer learning system is used for the development of neural transformer models pertaining to software engineering tasks. The transfer learning system trains source code domain neural transformer models with attention in various configurations on a large corpus of unsupervised training dataset of source code programs and/or source code-related natural language text. A web service provides the trained models for use in developing a model that may be fine-tuned on a supervised training dataset associated with a software engineering task thereby generating a tool to perform the software engineering task.

Disclosed herein is a compiler parsing technique that makes use of a “card game” mechanic to parse through tokens and generate an output that is inserted into a tree data structure and processed bottom-up. The technique is a non-recursive a parser & lexer. The processing is less computationally expensive than prior, recursive methods such as top down operator precedence. Simpler embodiments employ card solving of simple formulas, and more advanced embodiments implement tree processing structures that implement a card solver parsing technique at each node (or a subset of nodes) of the tree processing structures. In some embodiments, different nodes of a tree processing structure are routed to different processors (e.g., a CPU or a GPU) based on the degree of parallelism available in each node in order to improve parsing, compute, evaluation and compiling times.

A method for translating data from one application programming format to another programming format is provided. The method includes receiving a request to provide data in a second application programming format from data in a first application programming format, retrieving an interpretation data object associated with the request and the second application programming format, the interpretation data object including data representing source data entities in the first application programming format and target data entities in the second application programming format, performing a function identified in the interpretation data object, the function performed on a value of the source data entities to yield a value of target data entities based on an association included in the interpretation data object between the function, the source data entities, and the target data entities, and providing the data in the second application programming format based on the value of the target data entities.

Described are methods, systems and computer readable media for providing a current row position query language construct and array processing query language constructs and associated processing.

A quantum computing device configured to receive code written using one or more of a plurality of programming languages and convert the received code into quantum assembly language that can be executed by one or more quantum processing units of the quantum computing device. The quantum computing device also includes a hybrid memory cube storage device configured to function as storage for the high data throughput rates associated with the quantum processing units.

A method for a compilation, an electronic device and a readable storage medium are provided. The method for a compilation includes analyzing source program data to determine a target irregular branch, generating an update data flow graph according to the target irregular branch, and mapping the update data flow graph to a target hardware to complete the compilation.

Disclosed herein are system, method, and computer program product embodiments for providing an architecture to support a semantic validation technique. The system includes a governance console that carries out data management functionalities to support the validation. Such functionalities include generating, storing and publishing validation profiles that are used by a validation service for validating an asset, a validation reporter that receives and stores validation reports and performs notification functions to notify relevant individuals of the validation results, as well as a profile runner and associations manager that directly support the validation service.

A method for administering a plurality of Things in a knowledge base includes receiving a statement. A first verb action parses the statement into a parsed Thing. A second verb action evaluates the parsed Thing using a vocabulary, and computes and sets a performable statement Thing having a verb in the vocabulary representing a performable action. A third verb action performs the performable action upon a target Thing, wherein the vocabulary encompasses a set of performable action Things and a set of target Things a performable action Thing can act upon.