Abstract:
Monadic types are preserved for query operators to further query operator compositionality utilizing operators defined over a monad. Query operators that are defined over a monad and are suited to return non-monadic types are constructed or altered to return a monadic type. For instance, aggregate query operators defined over a local or remote sequence monad can be generated that return a monadic type.
Abstract:
The present invention provides systems and methods that isomorphically maps constructs between domain spaces (e.g., object, markup, relational and user interface domains). The systems and methods employ a mapping component that utilizes at least one suppress label(s), introduce label(s) and/or mediating schema to facilitate construct mapping. Examples of such mapping include transforming a named construct to an anonymous construct, a named construct to a named construct, an anonymous construct to a named construct, and an anonymous construct to an anonymous construct. In general, introduce labels can be utilized to provide names for anonymous constructs and/or modify existing names; suppress labels typically are utilized to suppress names such as introduced names or names a user desires to be suppressed; and mediating schema can be utilized to provide a default or user customized mapping to an intermediate schema before, during and/or after construct mapping.
Abstract:
An event driven application may predict a future event and spawn an event stream from the predicted event. The spawned event stream may be performed as a predicted operation until the prediction is confirmed to be correct or incorrect. The predicted operation may generate results that may be present when the prediction is confirmed. In some cases, the results may be used prior to the predicted event, while in other cases, the results may be cached until the prediction is confirmed. In some cases, the predicted operation may be merged with an actual event stream when the predicted event occurs. The prediction mechanism may enhance performance, enable operations that would otherwise be difficult, and may save battery life or energy in some devices.
Abstract:
A workflow is described and subsequently constructed by a general-purpose program. Among other things, such construction enables meta-programming to be employed. Further, workflow item and task dependencies can be explicitly expressed in the workflow and utilized to, among other things, optimize workflow execution for one or more factors. For instance, dependency information can be employed with respect to scheduling concurrent execution of tasks as well as to confine re-execution, upon workflow or item changes, to tasks affected by the changes. In addition, messages pertaining to workflow processing can be typed to facilitate logging in a structured and easily comprehensible manner.
Abstract:
The claimed subject matter provides systems and/or methods that facilitate dynamically allocating resources (e.g., hardware, software, . . . ) supported by a third party service provider. The third party service provider can support any number of services that can be concurrently requested by several clients without user perception of degraded computing performance as compared to conventional systems/techniques due to improved connectivity and mitigated latencies. An interface component can receive a request from a client device. Further, a dynamic allocation component can apportion resources (e.g., hardware resources) supported by the third party service provider to process and respond to the request based at least in part upon subscription data. Moreover, a user state evaluator can determine a state associated with a user and/or the client device; the state can be utilized by the dynamic allocation component to tailor resource allocation.
Abstract:
Distributed programming is aided by tier splitting single-tier applications into multi-tier applications. Computations and persistent data are split across tiers to generate offlineable or occasionally connected distributed applications. More specifically, computations are divided amongst tiers while preserving the semantics of a single-tier application, and upstream-tier resident data and changes thereto are replicated downstream to facilitate offline work.
Abstract:
A compiler supporting a language in which selected semantic objects are represented as data objects. The data objects may be used in multiple ways to expand the capabilities of the programming language. Data objects may be passed to applications and used to create executable instructions for that application. In this way, instructions written in the native language of the compiler may be used to control applications that accept programs in a language inconsistent with the native language of the compiler. The syntax checking and variable binding capabilities of the compiler may be used for those instructions that will be executed by an application separate from the object code generated by the compiler. The semantic objects represented as data objects may be selected based on express operations included in the source code or may be based on implicit type conversion.
Abstract:
Unsuspended co-routines are handled by the machine call stack mechanism in which the stack grows and shrinks as recursive calls are made and returned from. When a co-routine is suspended, however, additional call stack processing is performed. A suspension message is issued, and the entire resume-able part of the call stack is removed, and is copied to the heap. A frame that returns control to a driver method (a resumer) is copied to the call stack so that resumption of the co-routine does not recursively reactivate the whole call stack. Instead the resumer reactivates only the topmost or most current frame called the leaf frame. When a co-routine is suspended, it does not return to its caller, but instead returns to the resumer that has reactivated it.
Abstract:
A method for processing a computer action using a processor. The method includes receiving a first request to perform a first computer action, performing the first computer action and producing a first class representation of the first computer action.
Abstract:
The subject disclosure pertains to relationships between items. Relationships between items can be defined external to the items themselves thereby providing a modular, flexible and extensible system. For instance, relationships between items can be defined in a class that includes methods for returning particular elements or values in accordance with a specified relationship. Moreover, a compiler or like system can be extended to accept relationship expressions in a simple property format and direct such calls to specific methods.