Patent application number | Description | Published |
20090187886 | DECLARTIVE COMMANDS USING WORKFLOWS - Declaratively implementing a command. A method includes declaring an input gesture in a declarative programming language. Declaring an input gesture includes declaring one or more user performed actions. A command name is declared in a declarative programming language. A workflow is declared in a declarative programming language. Declaring a workflow includes declaring schedulable activities that are to be performed without specific specifications of the low level algorithms that are used to accomplish the activities. In an alternative example, workflows may be declared by declaring a wrapper to wrap imperative programming commands. The declared input gestures are bound with the declared workflow through the declared command name. | 07-23-2009 |
20090204912 | GENEERAL PURPOSE INFINITE DISPLAY CANVAS - Expanding and contracting a display screen container. Data is stored in a computer readable medium. The data represents a screen container such as a graphical desktop user interface displayable to a user on a computer display of a computing device. Data is stored representing artifacts, including one or more application graphical user interface artifacts for applications that are instantiated on the computing device. Information is stored specifying locations where each of the artifacts should be graphically located in the screen container. The graphical size of screen container is determined by the locations of the artifacts. Based on user input, a portion of the screen container is displayed to the user on the computer display of the computing device. The screen container may be expanded or contracted based on opening or closing graphical user interface artifacts, adding or removing artifacts, or repositioning artifacts. | 08-13-2009 |
20090204941 | IMPLICIT COMPOSITION OF COMPONENT BINDINGS - Component domains used to define a binding between various components associated with the component domain. The component domain tracks the various services to be imported by each component, and tracks the various services exported by each component. At runtime, rather than at compile time, the various interrelations between the components are bound using the service import and export data. Accordingly, depending on the components available and their characteristics, the bindings may differ. This permits applications to be much more flexible. | 08-13-2009 |
20090204942 | ITERATIVE COMPONENT BINDING - Component domains used to define a binding between various components associated with the component domain. The component domain tracks the various services to be imported by each component, and tracks the various services exported by each component. At runtime, rather than at compile time, the various interrelations between the components are bound using the service import and export data. Accordingly, depending on the components available and their characteristics, the bindings may differ. This permits applications to be much more flexible. In one implementation, the binding is performed iteratively. For example, if after one iteration of binding service imports to service exports, some components may expand the services that they export, or the services that they desire to import. | 08-13-2009 |
20090216778 | ACCESSING DIFFERENT APPLICATION DATA VIA A COMMON DATA STRUCTURE - A common data type structure can be used to correlate access requests between applications that implement data in accordance with different types or type structures. In one implementation, a common data structure includes schemes for operations, sequences, records, and atoms (i.e., undefined). The system can then map any type structure to the schemes of the common data structure. In operation, a request for data by an application can involve identifying one or more proxies used by an application to map the data to the common data structure. The proxies map the data to the common data structure based on the shape of the data (to the extent it can be identified). The proxies then can return one or more data structures that comprise the identified mapping information. The application can then perform operations directly on the received data structures. | 08-27-2009 |
20090216791 | EFFICIENTLY CORRELATING NOMINALLY INCOMPATIBLE TYPES - A nominal type framework can be configured to efficiently correlate different nominal types together based on a minimum set of common type shapes or structures. In one implementation, a developer identifies a number of different nominal types of interest (source types), and identifies the minimum set of common type shapes to be accessed by an application program. The minimum set of common type shapes can then be used to create an intermediate type (target type) to which each of the other different source types can be mapped. For example, one or more proxies can be created that map shapes of the one or more source types to corresponding shapes of the created target type. The application program created by the developer, in turn, can access, operate on, or otherwise use the mapped data of each different source type through a single target type. | 08-27-2009 |
20110252282 | PRAGMATIC MAPPING SPECIFICATION, COMPILATION AND VALIDATION - Facilitating translation of data between object oriented programs and database storage tables. A method includes receiving user input from a user. The user input includes a plurality of parts. Each part includes a specification of a source (such as a type source), optionally a filter, and a projection. Each projection assigns values to table columns. Based on the plurality of parts received, the method includes generating one or more views. The one or more views describe relationships between model extents and database tables. | 10-13-2011 |
20110307519 | Cogeneration of Database Applications and Their Databases - User experience in a designer tool manages cogeneration of a database application and a database accessible through the application. A user places a visual representation of an application element designed to control a relational or hierarchical dataset. Code is automatically called to add the application element to the application, and automatically invoked to create database schema elements designed to implement the dataset in the database under application element control. Users verify that an application element has been automatically added, and confirm that database schema elements implementing the dataset(s) under control of the application element have been automatically created. A tutorial illustrates a workflow utilizing a designer tool to cogenerate a database application and a database without a data design step. A wizard utilizes the designer tool to cogenerate a database application and a database that collectively implement a calendar, a diagram, a tree, a wiki, and/or a list. | 12-15-2011 |
20130066925 | ACCESSING DIFFERENT APPLICATION DATA VIA A COMMON DATA STRUCTURE - A common data type structure can be used to correlate access requests between applications that implement data in accordance with different types or type structures. In one implementation, a common data structure includes schemes for operations, sequences, records, and atoms (i.e., undefined). The system can then map any type structure to the schemes of the common data structure. In operation, a request for data by an application can involve identifying one or more proxies used by an application to map the data to the common data structure. The proxies map the data to the common data structure based on the shape of the data (to the extent it can be identified). The proxies then can return one or more data structures that comprise the identified mapping information. The application can then perform operations directly on the received data structures. | 03-14-2013 |
20130191811 | DECLARTIVE COMMANDS USING WORKFLOWS - Declaratively implementing a command. A method includes declaring an input gesture in a declarative programming language. Declaring an input gesture includes declaring one or more user performed actions. A command name is declared in a declarative programming language. A workflow is declared in a declarative programming language. Declaring a workflow includes declaring schedulable activities that are to be performed without specific specifications of the low level algorithms that are used to accomplish the activities. In an alternative example, workflows may be declared by declaring a wrapper to wrap imperative programming commands. The declared input gestures are bound with the declared workflow through the declared command name. | 07-25-2013 |