Microsoft Technology Licensing, LLC

Lucas James Hoban

Anders Hejlsberg

Steven E Lucco

Mads Torgersen

Charles P Jazdzewski

Jomo Fisher

Anson Michael Horton

Joseph Pamer

Michael C Fanning

Donald Syme

Timothy Yat Tim Ng

Ani Babaian

Matthew J Warren

Dinesh Chandrakant Kulkarni

Erik Meijer

Luca Bolognese

John Wesley Dyer

Gaurav Seth

Michael Gregory Montwill

Dmitry Lomov

Sreekar Choudhary

Mark Brian Shields

Hitesh Kanwathirtha

Caroline G Murdoch

Architecture that includes an asynchronous library which remembers the synchronization context that initiated an asynchronous method call and when the request is completed, the library restores the synchronization context of the calling thread before executing a callback. This ensures that the callback executes on the same thread as the original asynchronous request. The callback to the asynchronous operation that asynchronous library provides automatically 'jumps threads' to maintain thread affinity.

Automatic return to synchronization context for asynchronous computations

Static type checking can be performed on types and values defined in modules in a system that dynamically composes programs from modules. The types and values do not share a global namespace. Each module defines its own module universe, disjoint from other modules. A language mechanism can establish a local name binding to one module within the content of another module. When type checking at compile time an environment can be established that corresponds to a runtime instance of the program. The static type system can be arranged to align with the runtime values, such that the names used to refer to objects at runtime are the same as the names used to refer to the types of those objects in the static type system. Aliases of a particular type are resolved to a known compile time description of the type.

Static type checking across module universes

Type inference is used to provide the benefits of static type checking without explicitly declaring type in the source code. Type inference that proceeds in a bottom up direction is augmented by contextual typing that proceeds in a top down direction. Contextual typing types enclosed expressions by associating the type of a directly enclosing expression with the enclosed expression. Object literals, function literals and array literals enclosed in assignment and call expressions, can be contextually typed.

Contextual typing

Statically extensible types allow a static type system to model the behavior of dynamic object model extension in dynamic runtime systems. Static types that model dynamically extended types can be extended using additional declarations in the same compilation. Declarations for a particular type can come from multiple independent sources which can have been defined at multiple points in time. Extension declarations can use the same syntax as the initial type declaration. Hence presence of one or more declarations for the same type in a compilation can indicate that the type has been extended. These features allow static type checking of dynamic plug-ins to be supported using statically extensible types. Declarations and extension declarations for a type can be merged together to create an extended type that enables different processing paths and dependencies.

Statically extensible types

API description techniques are described for consumption by dynamically-typed languages. In one or more implementations, machine-readable data is parsed to locate descriptions of one or more application programming interfaces (APIs). The descriptions of the one or more application programming interfaces are projected into an alternate form that is different than a form of the machine-readable data.

API descriptions

A dynamic programming environment includes a dynamic runtime infrastructure configured to receive static metadata as source text in a source code written in a dynamic programming language. The dynamic runtime infrastructure determines an object representation based on the static metadata from the source text in the source code.

Static metadata in dynamic programs

Systems and methods are described for passing a data item to and obtaining the data item from a scripting environment hosted by a host environment, wherein each environment uses a different representation of the data item. The host environment passes the data item to the scripting environment by passing a host environment representation of the data item that is hidden from developers of scripts to be executed by the scripting environment. This enables the original host environment representation of the data item to be preserved even after the data item has been passed to and from the scripting environment in the case where the scripting environment does not modify the data item, and also facilitates lazy conversion of the data item or avoidance of conversion entirely in the case where the scripting environment does not modify the data item.

Hidden representations for marshaling through hosted scripting environments

Static type checking is performed against external data sources in an interacting editing environment. A rich editing experience can be provided to users for external data equivalent to that provided for internal static, typed data. An extensible compiler is provided so that a user or third party can extend type checking facilities to any external data source. An extensible language service is provided so that a user or third party can extend the language service to provide a consistent, current static view of external data. The extensible compiler and language service allow language extensions to plug into the type checking process. This enables the compiler and language service to provide an extension point that allows extensions of the compiler and allow the language service to render dynamic information statically.

Static type checking against external data sources

The utilization of data services (such as web services) may involve the invocation of services, which may reduce performance and overburden the server. In some scenarios, the invocation may be specified in a language that does not support batch invocation, but it may not be feasible to re-code the invocations in a language that supports batching. Instead, the service invocations may be automatically translated into a batch logic specified in a batch-capable language and sent to the service as a batch. For example, a local proxy may receive a language-integrated query having two or more service invocations, compile the query into an expression tree including the two or more invocations, and send the expression tree to the service host to achieve the batch processing of the service invocations.

Automated translation of service invocations for batch processing

A system and method for facilitating debugging of a computer program is provided. Mechanisms of the present invention facilitate presenting information and enable a developer to interact with a lazily evaluated program component. A debugging system may display data associated with a lazily evaluated program component, and may enable the programmer to control evaluation and viewing of elements of the lazily evaluated program component. In response to a user command, a debugging system may evaluate elements of the program component and display associated data. A user interface enables a user to view, interact with, and debug lazily evaluated program components as well as a program containing such components.

Debugging lazily evaluated program components

The present invention provides an extensible mechanism for displaying object data in a debug environment in a suitable display format. In one aspect, a system is provided for computerized debug environments. The system includes a display component that presents data at a debug interface, wherein the data is associated with a first representation in a debug object and as at least a second representation at the debug interface. A communications component transmits the data from the debug object to the display component and also transforms the data from the first representation to the second representation.

Growing community of inventors

Seattle, WA, United States of America

Lucas James Hoban