Abstract: A group join query facilitates navigation of relationships (e.g., one-to-many or many-to-one) across a plurality of data collections. Such a query operator produces nested or hierarchical results that capture the arguments passed thereto. If desired, the nested results can be flattened to simulate conventional relational database results.

Abstract: Partial methods enable separation of method declaration and/or calls from method implementation. A partial method specifies a signature of a join or hook point in a class. Calls to a partial method specify a join or hook point in code that can optionally be linked with an actual method implementation of the same signature. Separate method implementations or other code related to a partial method are injected into a single program prior to execution. Unimplemented partial methods are treated as no operation instructions or otherwise ignored.

Abstract: Systems and methods facilitate type inference in a computer-programming environment. Type inference can be applied to generic method or function invocation in object-oriented languages to determine a type argument list left implicit by a programmer. One or more type arguments can be identified as a parameter type to which all other types in a set of associated parameter types can be converted.

Abstract: The claimed subject matter relates to an architecture that can facilitate query comprehension that are constructed in a compositional manner. In accordance therewith, the query comprehensions can be assembled together in virtually in order without common requirements that force query operators of a query expression to follow ordering/syntactic rules. In addition, the architecture can provide for query expressions that arbitrarily composable and which can be terminated at any point. If the query expression terminates without a Select or Return clause at the end, the architecture can facilitate generation of an implicit Select or Return, and output results.

Abstract: The claimed subject matter provides a system and/or a method that facilitates querying data utilizing an explicit representation of an embedded language. An IEnumberable component can receive a data operation that can be employed on a collection of data utilizing at least one of an IEnumerable interface and an IEnumerable<T> interface. A mirror component can provide a generic interface to query the collection of data by representing the collection of data as an expression tree utilizing at least one function that mirrors the at least one IEnumerable interface and the IEnumerable<T> interface.

Abstract: The innovation enables generation of an index of cloud-based resources (e.g., data, services, applications). The index can be used to retrieve a subset of the cloud-based resources by analyzing a user-generated or standing query. ‘Identity’ and contextual factors can be incorporated to enable rich indexing as well as subsequent retrieval of meaningful resources. The cloud-based resources can be indexed and/or searched in accordance with diverse criteria including, but not limited to, type, size, data created, date modified, author core identity, object size, etc. As well, the innovation can provide for dynamically indexing and/or searching resources in accordance with current contextual factors including, but not limited to, author current acting capacity (e.g., current identity), current engaged activity of a user, location, time, date, etc. All of these criteria can facilitate indexing and categorizing of the resources for later retrieval and rendering via a rich index view.

Abstract: Syntax for creating object instances utilizing expressions instead of statements. A syntax component facilitates extension of conventional object-creation-expression syntax. An initializer component provides for initialization of a newly-created entity via object and collection initializers. The initializer component provides initialization of the newly-created entity utilizing an object initializer where the object initializer specifies values for one or more fields or properties of the newly-created entity which is an object, and consists of a sequence of member initializers enclosed by tokens and separated by commas. The initializer component can also provides initialization of the newly-created entity utilizing a collection initializer when the underlying object implements a certain interface or implements a certain pattern. An overloading constructor can be called as part of the initialization process.

Abstract: The claimed subject matter relates to a formalization of operator patterns that can facilitate type flow of element types between an operator in a first clause of an expression to an operator in a next clause of the expression. The type that flows to, and the operator extant in, the next clause can be combined to infer the element type of the next clause. As such, type-checking, autocompletion and other advantageous features can be accomplished incrementally without the need for a prior full translation of the expression.

Abstract: A computing paradigm where information can be aggregated from multiple services/programs within a ‘cloud-based’ environment is provided. Thus, the system can provide a uniform interface that can combine computational tasks across the multiple services/programs. Thus, the innovation takes advantage of the computing device being a ‘thin client’ which affords greater user comfort to a user without sacrificing data processing capabilities. Accordingly, the mechanisms are disclosed that standardize and/or normalize data across the resources within the cloud.

Abstract: Providing for electronic messaging tailored to contexts or interests of one or more participants of electronic communication is described herein. By way of example, a message can be analyzed during or after compilation to determine a context of the message. Message participants can be identified and a context for such participants determined. Based on the message context or participant context, the message can be modified to be consistent with interests, preferences or other context of one or more participants. In some aspects, the message can be modified upon receipt by a recipient's communication device or messaging application. According to other aspects, the message can be modified at compilation, or transmission. In accordance with still other aspects, message modifications can be output as suggested feedback to improve receptivity or utility of a message.

Abstract: Providing for graphical visualization of contextual information pertinent to electronic messaging is described herein. By way of example, contextual network usage information or messaging disposition can be determined for a set of participants to electronic communication. The contextual information is compiled into categories and organized at least as a function of category. The compiled data can be transformed into a visualization of user disposition or context and output to a user device as a multi-dimensional graphical rendering. By rendering contextual data graphically, the rich and diverse information available from usage histories, current user context and user dispositions can be output and consumed rapidly and efficiently, resulting in productive electronic interaction.

Abstract: Providing for task-related electronic feedback based on user interaction with a communication network is described herein. By way of example, user interactions the network or a network interface can be monitored to identify user activities performed in conjunction with a task. A rating for performance of the task can be obtained via comparison of user activities with benchmark performance activities. Based on the rating and user-benchmark comparison, inefficiencies can be identified, along with corrective actions for such activities. The corrective actions can then be output to coach the user on techniques for improving performance of the task. Accordingly, by employing corrective feedback based on monitored user activity, personal training can be automated, potentially reducing time and cost of such training.

Abstract: An object-relational mapping mechanism facilitates customized relationship traversal. The mechanism can override default loading behavior with custom functionality (e.g., eager loading, lazy loading . . . ) specified by a programmer, for example. In other words, the object-relational mapping mechanism includes an extensibility point or hook for customization.

Abstract: A computer-implemented system for representing data comprises a position indicator that indicates a position of a datum within a group, a name indicator that optionally names the datum, and a value of the datum. A type to be assigned to the datum is derived from at least one of a name of the datum and the position of the datum within the group. Methods of using the system are also provided.

Abstract: Anonymous types for a programming language. Non-denotable anonymous types are types that a compiler generates on behalf of a programmer and can then be used as nominal types. Insofar as anonymous types do not have a name, they can be used only inside a method in which they are created. Additionally, an anonymous type cannot be exposed in any way outside of the method. Syntax to create an anonymous type is useful when employed with a Select operator to generate a result with a particular shape, without the need of having a regular type for it. Anonymous types are expressible such that an expression of that type can be written. Translation of an anonymous type by a compiler generates a nominal class that implements Equals and GetHashCode methods. There is equivalence of anonymous types within the same method, and conversion of an unrealized structural type into structurally compatible nominal type.

Abstract: Modified compilers and other development tools provide implied line continuation within a sequence of syntax tokens of a programming language grammar which includes multiple semantic contexts and which uses line termination as presumptive statement termination. When source code parsing encounters a line terminator adjacent a context-dependent implicit line continuation token in an associated semantic context, an explicit decision is made whether to imply line continuation. Line continuation may also be implied in response to other specified tokens.

Abstract: A computer-implemented system for accessing data stored in a computer-readable format comprises a data source indicator that identifies least one datum of a data source to be typed. The system also includes a type definition component that defines a strongly typed view of the at least one datum. Methods of using the system are also provided.

Abstract: The subject disclosure pertains to computer programming languages and translation or conversion thereof. Rather than a complicated semantics preserving translation or conversion from a first source language to a second target language, the conversion can be one of syntax. The conversion can be accomplished, for example, via employment of a map that defines the relation between the syntax of the first language and the second language. The semantics of at least a part of the first language can be defined by the second target language. Thus, the first language can be open-ended and/or semantically extensible based on the second language.

Abstract: A type system that facilitates seamless integration of data access to relational and semi-structured data in an object oriented host language. A data access component includes the type system and corresponding set of syntax constructions that facilitates coercive subtyping and restricts covariance to identity conversions.

Abstract: A query language system is provided that includes a query component that specifies operations for one or more items in a data set. An aggregator component identifies one or more keys associated with the data set, the keys are supplied to one or more aggregators that perform direct computations from the keys in order to determine at least one aggregated value for the data set.