The Mathworks, Inc.

Michael Karr

Loren P Dean

Jocelyn Martin

Joseph F Hicklin

Halldor Narfi Stefansson

Roy Lurie

John Norris Little

Penelope Anderson

Nausheen B Moulana

Stephen C Johnson

Jason A Kinchen

Mary Ann Branch

Brett W Baker

William M McKeeman

John Micco

Gael Mulat

In an embodiment of the invention, one or more tangible non-transitory computer-readable storage media may store the following instructions. Defining representation type spaces Rand Rand correctness type spaces Cand Cover the representation type spaces Rand R, respectively. Defining a representation type space R and a correctness type space C over the representation type space R, such that a semilattice associated with the correctness type space C is a function semilattice over respective semilattices associated with the correctness type spaces Cand C.

Wide-spectrum type system incorporating representation types, correctness types, coercions, and function overload resolution

A device creates a graph based on source code, and analyzes the source code to identify private variables and functions of the source code and public variables and functions of the source code. The device determines, based on the graph, a size threshold and semantics-related characteristics of functions and variables for each module, of multiple modules, and assigns, based on the graph, the private variables and functions to a corresponding module of the multiple modules. The device reduces, based on the graph, a number of the public variables and functions assigned to each module, and generates the multiple modules based on one or more of the graph, the size threshold, the assigned private variables and functions, and the number of the public variables and functions assigned to each module.

Automatic modularization of source code

A computing device-implemented method includes receiving a program created by a technical computing environment, analyzing the program, generating multiple program portions based on the analysis of the program, dynamically allocating the multiple program portions to multiple software units of execution for parallel programming, receiving multiple results associated with the multiple program portions from the multiple software units of execution, and providing the multiple results or a single result to the program.

Parallel programming interface to dynamicaly allocate program portions

A computing system receives a program created by a technical computing environment, analyzes the program, generates multiple program portions based on the analysis of the program, dynamically allocates the multiple program portions to multiple software units of execution for parallel programming, receives multiple results associated with the multiple program portions from the multiple software units of execution, and provides the multiple results or a single result to the program.

Parallel programming computing system to dynamically allocate program portions

Parallel programming interface to dynamically allocate program portions

A method and computer program product is shown for use with a computer programming language having dynamic types and overloaded functions. A function data structure (a function handle) is constructed using a function name, which data structure contains or leads to information necessary to resolve function overloading, and also may lead to other auxiliary functions such as write, read or print. Application of the function data structure at the point of construction is functionally equivalent to application of a function name string. However, the function data structure may be applied without regard to the scope at the point of construction.

Function values in computer programming languages having dynamic types and overloading

Methods and apparatus for using description information about a function to translate a call to the function in a first language into a call to a corresponding function in a second language. The methods include create description information from a definition of a function associated with a first language that enables translation of a call to the function in the first language into a call to a corresponding function in a second language without requiring processing of the definition of the function. In one aspect, the methods include providing a description file of items, each item including description information about a function associated with a first language, and using the file of description items to translate a first program file from the first language into a second language.

Function call translation

Growing community of inventors

Brookline, MA, United States of America

Michael Karr