Microsoft Technology Licensing, LLC

Robert Eric Lippert

Anders Hejlsberg

Matthew J Warren

Mads Torgersen

Andrew Clinick

Eric Hyde Carter

Mohit Gupta

Henricus Johannes Maria Meijer

Stephen Harris Toub

Amanda K Silver

Paul Allen Vick, Jr

Danny Van Velzen

Peter A Hallam

Samuel Ng

Gavin Mark Bierman

Neal M Gafter

Dmitry Lomov

James J Hugunin

Lucian Wischik

Christopher Joseph Burrows

Alex Christopher Turner

Lucian Jules Wishchik

A static type, called 'dynamic', is introduced into a statically bound programming language. An expression or subexpression that is defined as a static type called 'dynamic' in the source code of a program written in the statically bound programming language, is bound based on its runtime type instead of on its compile time type. Binding can be performed based on a mixture of compile time and runtime types that are based on the specification of types of expressions in source code. This type of binding is called hybrid binding. Operations are bound using the runtime type of constituent expressions (i.e., the runtime type of a receiver, an argument, or an operand) typed as dynamic and the compile time type of static constituents. If any constituent expression of an operation is dynamic, binding occurs at runtime instead of at compile time.

Dynamic binding directed by static types

The present invention extends to methods, systems, and computer program products for representing various programming elements with compiler-generated tasks. Embodiments of the invention enable access to the future state of a method through a handle to a single and composable task object. For example, an asynchronous method is rewritten to generate and return a handle to an instance of a builder object, which represents one or more future states of the asynchronous method. Information about operation of the asynchronous method is then passed through the handle. Accordingly, state of the asynchronous method is trackable prior to and after completing.

Using compiler-generated tasks to represent programming elements

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.

Type inference for object-oriented languages

A programming model that takes general purpose APIs and machine-generates new programming models based on user defined schemas that provide the developer with data and view separation, and a way to communicate to the host application using the domain of the problem being solved. The system comprises a schema component that the developer uses to define a schema that includes one or more domain terms related to the problem to be solved, and a mapping component that uses the schema to search and map selected constructs from one or more generic host application APIs to the corresponding problem domain terms. Once the mapping is completed, a generating component generates a new API that is used by a host application to facilitate developing an application document using terms related to the domain of the problem to be solved.

Schema-based machine generated programming models

Architecture that facilitates the creation of a customized document with embedded or linked code that can be run on a client or a server without invoking the host application. A programming model makes it transparent to the code whether it is running on the client or the server. The programming model automatically 'scales' to provide more features while running the document on the client and fewer features when running on the server. A transparent data island is automatically generated for the customized document that is embedded in the document and can be edited while requiring only a subset of all components of the host application to be running. A data binding mechanism is provided wherein changes that are made to the transparent data island while the host is not running can be moved back into the host document content when the document is reopened by the full host application.

Document customization for transparent execution on a client and a server

Growing community of inventors

Seattle, WA, United States of America

Robert Eric Lippert