The Mathworks, Inc.

Charles Gary Nylander

Peter Webb

John Micco

David A Foti

Marc Ullman

Barry Simon

Brett W Baker

William M McKeeman

William Richard Nell

Cheryl L Jones

The present invention is directed toward automatically integrating a late bound program language into an external environment. The external environment may be an early bound environment, a late bound environment or some combination thereof. Associated with the late bound program environment is a modular execution engine and an interface mechanism, wherein the interface mechanism is capable of expressing late bound semantics in a format compatible with the external environment.

Calling of late bound functions from an external program environment

A self-contained virtual file system is disclosed for deploying and distributing an application and/or software component. Executable files relating to the application are included in a distributable composite file. The composite file and a user front end application are deployed and distributed to an application user where the application is executed. An application provider can tag the composite file with the version information and other useful meta-data of the files for the application. The format of the composite file may support the storage of any kind of file types and associated meta-data. The composite file may contain the hierarchical directory structure of the files for the application so that the hierarchical directory structure is installed in the application user's electronic device.

Deploying and distributing of applications and software components

A method and apparatus, including a computer program apparatus, which facilitate invoking methods of objects defined within an object-oriented environment from an array-based technical computing environment often used in conventional mathematical tools. When a method is invoked from the computing environment, the techniques automatically compare the array input parameters with data-types accepted by methods defined within the object-oriented environment. Based on this comparison, the invention selects a method that best accepts the input arrays. The invention, therefore, allows a user to easily invoke methods from external objects, such as Java objects, directly from the technical computing environment of the mathematical tool.

Method and system for accessing externally-defined objects from an array-based mathematical computing environment

The illustrative embodiment of the present invention provides a method for extending a programming language to interact with foreign object systems. Through the use of an opaque interface, a requesting unit may interact with multiple foreign object systems. A single set of procedures written into the opaque interface and accessible by the requesting unit enable the requesting unit to interact with the foreign object systems. The foreign object systems register with the opaque interface. The registration process for the object systems includes the creation and registration of a defined set of functions, the format for which is provided by the opaque interface. The defined set of functions are called by the procedures in the opaque interface and execute in the object system. The results of the function execution are returned to the requesting unit thereby extending the foreign object system capabilities to the requesting unit.

System and method for extending a programming language to include multiple dissimilar object systems

When a method is invoked from a computing environment, techniques presented herein automatically compare array input parameters with data-types accepted by methods defined within the object-oriented environment. Based on this comparison, the invention selects a method that best accepts the input arrays. The invention, therefore, allows a user to easily invoke methods from external objects, such as Java objects, directly from the technical computing environment of the mathematical tool.

A method and system is provided that allows a well-behaved program to execute more quickly than dynamically typed programming languages did in the past, thereby allowing a the dynamically typed language to be competitive with static declarative programming languages. A method includes converting lines of source code representing functions to byte-codes representing functions, selecting a subsequence of the byte-codes based on the byte-codes and the dynamic run-time properties of program variables, generating processor instructions in a compiler for the subsequence, and interpreting the byte-codes not contained in the subsequence.

Program interpreter

The illustrative embodiment of the present invention provides a method for extending a programming language to interact with foreign object systems. Through the use of an opaque interface, a requesting unit may interact with multiple foreign object systems. The requesting unit is an executable piece of code such as a script, applet or application. A single set of procedures written into the opaque interface and accessible by the requesting unit enable the requesting unit to interact with the foreign object systems. The foreign object systems register with the opaque interface. The registration process for the object systems includes the creation and registration of a defined set of functions, the format for which is provided by the opaque interface. The defined set of functions are called by the procedures in the opaque interface and execute in the object system. The results of the function execution are returned to the requesting unit thereby extending the foreign object system capabilities to the requesting unit.

Growing community of inventors

Merrimack, NH, United States of America

Charles Gary Nylander