公开(公告)号：EP2203848A1

公开(公告)日：2010-07-07

申请号：EP08841420.6

申请日：2008-10-22

申请人： Microsoft Corporation

发明人： BOX, Donald F. ,  HOOD, Destry W. ,  LOVERING, Bradford H. ,  SWARTZ, Stephen T. ,  PINKSTON, Jeffrey S.

IPC分类号： G06F17/00

CPC分类号： G06F8/20 ,  G06F9/546

摘要： 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.

公开(公告)号：EP2350867A2

公开(公告)日：2011-08-03

申请号：EP09818475.7

申请日：2009-09-30

申请人： Microsoft Corporation

发明人： LANGWORTHY, David E. ,  HAMBY, John L. ,  LOVERING, Bradford H. ,  BOX, Donald F.

IPC分类号： G06F17/00 ,  G06F9/44

CPC分类号： G06F8/43 ,  G06F8/75

摘要： Embodiments of tree-based directed graph programming structures for a declarative programming language are provided. In various embodiments, complex graph structured data, referred to as "DGraphs" herein in one non-limiting implementation, is authored using a compact, human friendly syntax without the use of explicit identifiers. In one non-limiting aspect, the syntax includes support for conformance relationships, also referred to as factored relationships. In another non-limiting aspect, the semistructured graph data is a tree-based representation and the syntax includes lexical resolution of references or lexical scoping, and/or non local initialization.

公开(公告)号：EP2350866A2

公开(公告)日：2011-08-03

申请号：EP09818473.2

申请日：2009-09-30

申请人： Microsoft Corporation

发明人： LANGWORTHY, David E. ,  BIERMAN, Gavin ,  GORDON, Andrew D. ,  BOX, Donald F. ,  LOVERING, Bradford H. ,  SCHLIMMER, Jeffrey C. ,  DOTY, John D.

IPC分类号： G06F17/00 ,  G06F17/30

CPC分类号： G06F8/10 ,  G06F8/31

摘要： 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.