Microsoft Technology Licensing, LLC

Microsoft Corporation

Charles P Jazdzewski

Anders Hejlsberg

Steven E Lucco

Michael C Fanning

Lucas James Hoban

Mads Torgersen

Joseph Pamer

Oliver H Foehr

Jerry Jay Dunietz

Michael John Hillberg

Robert A Relyea

Robert Andrew Little

Donald F Box

Geoffrey M Kizer

Randy S Kimmerly

Jeffrey C Schlimmer

David Ornstein

Joseph Ternasky

Christopher L Anderson

Jonathon Michael Stall

Brian Keith Pepin

Martin James Gudgin

Natasha Harish Jethanandani

Mohamed Hegazy

Mark A Boulter

Mark Brian Shields

Gary Linscott

Unnikrishnan Ravindranathan

James Nakashima

Joel David West

Brian Faris Chapman

Jeffrey Walter Kelly

Rob Relyea

Jordan L Matthiesen

Alan J Gasperini

Juraj Hlavac

A Michael Horton

Jerry Dunietz

Structure of a prototype-based programming language program is determined based on results of program execution. The structure determined can be implied by a program rather than explicitly declared. For example, classes and namespaces of a prototype-based program can be detected or inferred by identifying patterns that indicate the presence of a class or namespace. Furthermore, members of classes and namespaces can also be determined.

Class and namespace discovery in prototype based language

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

The transformation of an abstract syntax tree of a dynamic language program at evaluation time in a manner that is helpful for evaluating the program. For instance, the abstract syntax tree may be altered such that metadata is attached to variables generated during execution. The tree might also be altered to force code to execute faster or more likely than would occur otherwise. This might occur so that the dynamic language program might be executed at authoring time up to a halt point that represents a point of interest to the author. Without transformation of the abstract syntax tree, the execution might have not proceeded to the halt point or might have taken a long time. Once at the halt point, the program state at the halt point may be evaluated, allowing the program to perform functions such as generating an available symbol set at the halt point.

Abstract syntax tree transformation

The execution of a dynamic code segment sequence that includes at least two code segments in sequence. The first code segment is first executed and the corresponding state of the environment is captured. The second code segment is then executed. When the second code segment is later re-executed, the first code segment is not re-executed again. Rather, the environmental state is set to be the captured state that existed when the first code segment originally executed. Then, the second code segment may be executed without spending the resources required to re-run the first code segment. This may be employed at authoring time, or after deployment time.

State capture after execution in dependent sequences

The facilitated computation of an available symbol set at code locations in a dynamic language program, in which the program is executed up to a particular halt point for which an available symbol set is to be generated. At the halt point, a type of a value of a particular variable may be used in order to generate the available symbol set. However, at the halt point, the variable does not yet have a value of a useful type (e.g., null or undefined), which is possible in a dynamic language program. Rather than return an error, the principles described herein result in return of an available symbol set anyway. Specifically, the variable had previously been annotated with information representing accessed type information for the variable, even though the variable has not formally been defined. This annotated information may be used to generate the available symbol set.

Available symbol set generation using untyped variable

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

The present invention provides technologies for forming an editing interface for editing arbitrary objects. In particular, the present invention provides system and methods for enumerating object properties, selecting a suitable pre-existing object editor and, if no such pre-existing editor is available, constructing an object editor on the fly suitable for editing the properties of the object where the object may include properties and/or collections of objects. Construction of a suitable editor is based on enumeration of object properties and on the serialization of the object using a descriptive language such as extensible markup language ('XML') or the like. Property values specified by a user via the object interface and editors are stored in a descriptive format such as XML and generally specify the initial characteristics of the object.

Arbitrary object editing

A language service provider framework that generates an application context of a dynamic language program being authored. The application context includes a description of the dynamic language application being authored, one or more specific locations within the program, and runtime environment information. A language service provider port component holds one or more language service providers. Each language service provider may receive the application context and generate a set of available symbols corresponding to each of at least one of the identified one or more specific locations. A management component receives the application context from the application context generation component, provides the application context the language service provider, and correspondingly receives the available symbol set from the language service provider. Since the management component provides an application context that also includes runtime environment information, the available symbol set may be more accurately represented, thereby facilitating authoring of dynamic language programs.

Language service provider management using application context

Modular content framework and document format methods and systems are described. The described framework and format define a set of building blocks for composing, packaging, distributing, and rendering document-centered content. These building blocks define a platform-independent framework for document formats that enable software and hardware systems to generate, exchange, and display documents reliably and consistently. The framework and format have been designed in a flexible and extensible fashion. In addition to this general framework and format, a particular format, known as the reach package format, is defined using the general framework. The reach package format is a format for storing paginated documents. The contents of a reach package can be displayed or printed with full fidelity among devices and applications in a wide range of environments and across a wide range of scenarios.

Method and apparatus for document processing

A low privilege debug pipeline publisher advertises a debugging pipeline. Instead of having a client to which a debugger on the server has been attached interrogate the server for debugging information, the client requests information from the server. Control is returned to the server which can refuse to provide the requested information to the client. A debuggee server executes client code being debugged in an isolated context so that pausing the code at a breakpoint does not block the server. The server can apply transforms to compiled code to make the code cooperate with debugging services so that a privileged component to inspect the debuggee code is not needed.

Low privilege debugging pipeline

A browser-based debugger application is configured to debug a second browser based application. A channel repeater module is invoked to establish a bidirectional communication channel between the debugger application and the second application. A start indication is transmitted from the second application through the channel repeater module. The second application enters a blocked wait state. A debug operation is performed on the second application. A debug request message is transmitted to the second application through the channel repeater module to cause the second application to transition from the blocked wait state to a run state and to perform a debug action indicated by the debug request message. A response to the debug request message is received from the second application through the channel repeater module. The second application transitions to the blocked wait state from the run state.

Low-privilege debug channel

Various technologies and techniques are disclosed performing a bidirectional synchronization between a visual representation and a textual representation. A visual representation of a file is synchronized with a textual representation of a file using a same delta propagation that is used to synchronize the textual representation with the visual representation. A semantic view is generated for the visual representation, and a separate semantic view is generated for the textual representation of the file. The visual representation and the textual representation follow a same semantic structure for comparison. To perform synchronization after changes are made to one of the representations, a synchronization process is performed using the semantic views to update the other representation.

Live bidirectional synchronizing of a visual and a textual representation

Determining compatibility of data structures. A method may be practiced in a computing environment. The method includes accessing a first type defined in a mark-up object. The first type includes a first structure including a first plurality of fields. A second type defined in a mark-up object is accessed. The second type includes a second structure including a second plurality of fields. The first structure and the second structure are compared. Based on the comparison, a determination is made that the first type is compatible with the second type.

Growing community of inventors

Redmond, WA, United States of America

Charles P Jazdzewski