Microsoft Technology Licensing, LLC

Donald F Box

Bradford H Lovering

David E Langworthy

Jeffrey C Schlimmer

Martin James Gudgin

Kenneth David Wolf

John David Doty

Christopher G Kaler

Randy S Kimmerly

Erik B Christensen

Clemens Alden Szyperski

Geoffrey M Kizer

Christopher L Anderson

Haroon Ahmed

Jeffrey S Pinkston

Luis Felipe Cabrera

Steven E Lucco

Todd R Manion

Shiraz Jitendra Cupala

Zhangwei Xu

Edmund Samuel Victor Pinto

Curt Andrew Steeb

Jeremy Lee Dewey

John Lawrence Hamby

Min Liu

Anthony Vincent Discolo

Kean Ee Lim

Edmund Hon-Sum Lui

Ryan B Elgram

Grant Gardner

Henricus Johannes Maria Meijer

Anders Hejlsberg

John Peter Shewchuk

David Wortendyke

Giovanni Moises Della-Libera

Andrew Donald Gordon

Nathan Christopher Talbert

Quetzalcoatl Bradley

Robert Brian Schmidt

Michael Steven Vernal

Gavin Mark Bierman

Natasha Harish Jethanandani

Joshua Ryan Williams

Douglas M Purdy

Gopala Krishna R Kakivaya

Antony S Williams

Matthew J Warren

Dinesh Chandrakant Kulkarni

Tirunelveli R Vishwanath

Arun K Nanda

Gary Shon Katzenberger

Hervey O Wilson

Stephen Jared Maine

Luca Bolognese

Michael James Coulson

Stefan Harrington Pharies

Anthony Christopher Bloesch

Peter A Hallam

Arye Gittelman

Anthony J Moore

Alfred Lee

Gunter Leeb

Stephen T Swartz

David Edwin Levin

Saurab Nog

Aaron Stern

Stefan H Pharies

Douglas A Walter

HongMei Ge

Kavita K Kamani

William A Manis

Sowmyanarayanan K Srinivasan

Alexander Martin DeJarnatt

David Robert Cliffe

Alberto Arias Maestro

Stephen James Millet

Henrik Frystyk Nielsen

Raymond W McCollum

Michael John Hillberg

Alan Geller

Siddharth Jayadevan

Andrew Eyring Kimball

Laurent Mollicone

Craig Andrew Critchley

Charles P Jazdzewski

Elliot Lee Waingold

Robert A Relyea

Scott M Roberts

Geary L Eppley

David Lawrence Remy

Fabian Omar Winternitz

Max A Feingold

James Randall Flynn

Asad Jawahar

Harris Syed

Andrew D Milligan

Arpan A Desai

Saji Abraham

Edmund S V Pinto

Joel David West

Device linking is described. In one or more implementations, data is maintained at a network service that describes characteristics of a plurality of devices that are associated with a user account of the network service. A communication is formed to be received by one of the plurality of devices that includes a portion of the data that pertains to another one of the plurality of devices and that is suitable by the receiving device to discover the other one of the plurality of devices to initiate a local network connection between the devices.

Device linking

Interfaces for a continuation-based runtime. Some embodiments described herein are directed to a framework using continuation based runtime interface that pertain to an infrastructure for enabling the creation of a wide variety of continuation-based programs that perform a wide-array of tasks. The infrastructure provides a foundation for building continuation-based, declarative applications of various scale and complexity.

Interface infrastructure for a continuation based runtime

Namespace for continuation-based runtime. Some embodiments described herein are directed to a framework using continuation based runtime namespaces that pertain to an infrastructure for enabling the creation of a wide variety of continuation-based programs that perform a wide-array of tasks. The infrastructure provides a foundation for building continuation-based, declarative applications of various scale and complexity. In some embodiments, the associated application programming interfaces (APIs) are factored into a hierarchy of namespaces in a manner that balances utility, usability, extensibility, and versionability.

A common intermediate representation for a data scripting language is provided for efficient representation and direct specification of programming constructs in memory. The common intermediate representation of data scripts allows data intensive applications to be created and analyzed in a machine accessible format, and the elements of the common intermediate representation can be stored independent of underlying storage specifics. Stored elements of the common intermediate representation of code are thus available for fast loading in memory when desired by other applications and programs by mapping the stored elements to the in memory intermediate representation.

Common intermediate representation for data scripting language

A nominal type framework can be configured to efficiently correlate different nominal types together based on a minimum set of common type shapes or structures. In one implementation, a developer identifies a number of different nominal types of interest (source types), and identifies the minimum set of common type shapes to be accessed by an application program. The minimum set of common type shapes can then be used to create an intermediate type (target type) to which each of the other different source types can be mapped. For example, one or more proxies can be created that map shapes of the one or more source types to corresponding shapes of the created target type. The application program created by the developer, in turn, can access, operate on, or otherwise use the mapped data of each different source type through a single target type.

Efficiently correlating nominally incompatible types

A single software project in an integrated development environment (IDE) may be built for multiple target environments in a single build episode. Multiple different output artifacts may be generated by the build process for each of the target environments. The output artifacts are then deployed to the target environments, which may be homogeneous or heterogeneous environments. The same source project may be used to generate multiple output artifacts for the same target environment.

Simultaneously targeting multiple homogeneous and heterogeneous runtime environments

An efficient, logical and expressive type system is provided for flexibly defining types of a declarative programming language so that efficient and structurally compact data intensive applications can be generated. The type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. With the type system, types can be expressed as intersections and/or unions of other types. Thus, types can be efficiently represented for a full range of types of data as may be found in real world data stores.

Type system for declarative data scripting language

Data is accessed and updated in a data store at a field granularity. A user query specifies one or more non-unique fields of a record. The query is sent to a data store to retrieve the fields of the record at a field granularity, in satisfaction of the query. The fields of the record can also be modified by transmitting a record ID along with original content, while omitting some of the record data, and by also including the modification to be made.

Data framework to enable rich processing of data from any arbitrary data source

An efficient, logical and expressive type system supports the combination of refinement types and type membership expressions, as well as a top type that encompasses all valid values as members. A bidirectional type checking algorithm is provided for the type system including synthesis and checking steps to statically verify types of code based on the type system.

Bidirectional type checking for declarative data scripting language

A common data type structure can be used to correlate access requests between applications that implement data in accordance with different types or type structures. In one implementation, a common data structure includes schemes for operations, sequences, records, and atoms (i.e., undefined). The system can then map any type structure to the schemes of the common data structure. In operation, a request for data by an application can involve identifying one or more proxies used by an application to map the data to the common data structure. The proxies map the data to the common data structure based on the shape of the data (to the extent it can be identified). The proxies then can return one or more data structures that comprise the identified mapping information. The application can then perform operations directly on the received data structures.

Accessing different application data via a common data structure

Embodiments provide an architecture to enable composite, autonomous composite applications and services to be built and deployed. In addition, an infrastructure is provided to enable communication between and amongst distributed applications and services. In one or more embodiments, an example architecture includes or otherwise leverages five logical modules including connectivity services, process services, identity services, lifecycle services and tools.

Model-based composite application platform

A database integration viewer that allows additional properties to be associated with a record as viewed in a single record or table, even though those additional properties are not owned by the record in the underlying source record or table in the database. Using this integration view, a viewed version of record or table may be different than the actual structure of the source record or table. In the viewed version of the record or table, the viewed record or table or may include some or all of the properties for the records of the subject record or table, while incorporating one or more additional properties for the record into the viewed table. The properties may be scalars, or may be computed to populate the viewed version of the record or table.

Database integrated viewer

Facilitating generic database editing to allow for data to be received from a user for entry into a database without requiring the data to conform to schema constraints for the database. A method includes examining a first schema for a first database. The first schema including a first set of constraints specified in the first schema on data to be entered into the first database. The method further includes, based on the examination, constructing a second database corresponding to the first database. The second database is associated with a second schema with a second set of constraints. The second set of constraints is a relaxed version of the first set of constraints specified in the first schema.

Generic editor for databases

Growing community of inventors

Bellevue, WA, United States of America

Donald F Box