Patents by Inventor David N. Schach
David N. Schach has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 11372630Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.Type: GrantFiled: February 17, 2020Date of Patent: June 28, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Matthew J. Warren, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Andrew Pilch, Karen Liu
-
Publication number: 20200183667Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.Type: ApplicationFiled: February 17, 2020Publication date: June 11, 2020Inventors: Matthew J. Warren, Avner Y. Aharoni, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Pilch-Bisson, Karen Liu
-
Patent number: 10564944Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.Type: GrantFiled: January 7, 2010Date of Patent: February 18, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Matthew J. Warren, Avner Y. Aharoni, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Pilch-Bisson, Karen Liu
-
Patent number: 9043727Abstract: When a user enters text into an application, the application can utilize an auto-complete feature to provide the user with estimations as to a complete term a user is attempting to enter into the application. Visualization can be provided along with an estimation to disclose the likelihood the estimation is what the user intends to enter. Furthermore, a rationale can be provided to the user for the reason an estimation was provided to the user.Type: GrantFiled: July 26, 2007Date of Patent: May 26, 2015Assignee: Microsoft Technology Licensing, LLCInventors: Avner Y. Aharoni, Henricus Johannes Maria Meijer, Andrew Eyring Kimball, David N. Schach, Sravani Kothapalle, Ghanashyam Chandrasekhar Namboodiripad, Vladimir G. Sadov, Lisa Helene Feigenbaum, Abel Valadez Martinez, Olivier Michel Destrebecq
-
Patent number: 8732732Abstract: Systems and methods that enhance and balance a late binding and an early binding in a programming language, via supplying an option component to opt-in (or opt-out) late binding, and wherein a late binding is triggered based on a static type for the variable (e.g., object or a type/string.) Additionally, the variable is enabled to have different static types at different regions (e.g., a program fragment) of the programming language.Type: GrantFiled: June 25, 2013Date of Patent: May 20, 2014Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, Brian C. Beckman, David N. Schach, Amanda Silver, Paul A. Vick, Peter F. Drayton, Avner Y. Aharoni, Ralf Lammel
-
Publication number: 20130290987Abstract: Systems and methods that enhance and balance a late binding and an early binding in a programming language, via supplying an option component to opt-in (or opt-out) late binding, and wherein a late binding is triggered based on a static type for the variable (e.g., object or a type/string.) Additionally, the variable is enabled to have different static types at different regions (e.g., a program fragment) of the programming language.Type: ApplicationFiled: June 25, 2013Publication date: October 31, 2013Inventors: Henricus Johannes Maria Meijer, Brian C. Beckman, David N. Schach, Amanda Silver, Paul A. Vick, Peter F. Drayton, Avner Y. Aharoni, Ralf Lammel
-
Patent number: 8533693Abstract: An architecture that that extends conventional computer programming languages that compile into an instance of an extensible markup language (XML) document object model (DOM) to provide support for XML literals in the underlying programming language. This architecture facilitates a convenient short cut by replacing the complex explicit construction required by conventional systems to create an instance of a DOM with a concise XML literal for which conventional compilers can translate into the appropriate code. The architecture allows these XML literals to be embedded with expressions, statement blocks or namespaces to further enrich the power and versatility. In accordance therewith, context information describing the position and data types that an XML DOM can accept can be provided to the programmer via, for example, an integrated development environment.Type: GrantFiled: November 29, 2010Date of Patent: September 10, 2013Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, David N. Schach, Avner Y. Aharoni, Peter F. Drayton, Brian C. Beckman, Amanda Silver, Paul A. Vick
-
Patent number: 8479178Abstract: A batch compiler is employed to enable compilation of code provided at runtime. A managed application receives code during execution and invokes the compiler to transform the code to enable it to execute within the context of the receiving application. Among other things, employment of a batch compiler preserves investments made to such compilers while also opening up new scenarios in application scripting and/or hosting that are otherwise unavailable.Type: GrantFiled: June 27, 2008Date of Patent: July 2, 2013Assignee: Microsoft CorporationInventors: Avner Y. Aharoni, Henricus Johannes Maria Meijer, Timothy Yat Tim Ng, Amanda K. Silver, Scott Daniel Wisniewski, Kevin Wagner Halverson, David N. Schach, Aleksey V. Tsingauz, Paul A. Vick
-
Patent number: 8473971Abstract: Systems and methods that enhance and balance a late binding and an early binding in a programming language, via supplying an option component to opt-in (or opt-out) late binding, and wherein a late binding is triggered based on a static type for the variable (e.g., object or a type/string.) Additionally, the variable is enabled to have different static types at different regions (e.g., a program fragment) of the programming language.Type: GrantFiled: September 6, 2005Date of Patent: June 25, 2013Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, Brian C. Beckman, David N. Schach, Amanda Silver, Paul A. Vick, Peter F. Drayton, Avner Y. Aharoni, Ralf Lammel
-
Patent number: 8473932Abstract: Systems and methods that enhance expressibility in a programming language (e.g., Visual Basic) via relaxation of artificial restrictions and extension of delegates associated therewith, without changing the runtime infrastructure. A stub is employed that can replace an impermissible expression in the programming language, to leverage the existing permissible expressions.Type: GrantFiled: March 1, 2010Date of Patent: June 25, 2013Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, Brian C. Beckman, Peter F. Drayton, David N. Schach, Ralf Lammel, Avner Y. Aharoni
-
Patent number: 8239842Abstract: Modified compilers and other development tools provide implied line continuation within a sequence of syntax tokens of a programming language grammar which includes multiple semantic contexts and which uses line termination as presumptive statement termination. When source code parsing encounters a line terminator adjacent a context-dependent implicit line continuation token in an associated semantic context, an explicit decision is made whether to imply line continuation. Line continuation may also be implied in response to other specified tokens.Type: GrantFiled: February 24, 2009Date of Patent: August 7, 2012Assignee: Microsoft CorporationInventors: Avner Aharoni, Timothy Yat Tim Ng, David N. Schach, Paul Allen Vick, Jr., Lisa Feigenbaum, Sophia Salim, Henricus Johannes Maria Meijer, Jonathan Paul Aneja, Joseph Tyler Whitney
-
Publication number: 20110167088Abstract: Efficient immutable syntax representation with parent pointers under incremental change is enabled by creating a data structure comprising at least one tree structure that allows both upward and downward references in the tree and a tree structure that is immutable (read-only), and allows parts of itself to be re-used in other data structures. The data structure described enables tools to search and target particular sub trees. The fragment of the tree representing the targeted sub tree is produced as it is used. The rest of the tree is not produced. The read-only tree retains relative information, allowing it to be reassembled and shared.Type: ApplicationFiled: January 7, 2010Publication date: July 7, 2011Applicant: Microsoft CorporationInventors: Matthew J. Warren, Avner Y. Aharoni, Mads Torgersen, Renaud Paquay, Neal M. Gafter, Jared Parsons, David N. Schach, Aleksey V. Tsingauz, Peter Golde, Kevin Pilch-Bisson, Karen Liu
-
Patent number: 7945904Abstract: An architecture that extends conventional computer programming languages that compile into an instance of an extensible markup language (XML) document object model (DOM) to provide support for XML literals in the underlying programming language. This architecture facilitates a convenient short cut by replacing the complex explicit construction required by conventional systems to create an instance of a DOM with a concise XML literal for which conventional compilers can translate into the appropriate code. The architecture allows these XML literals to be embedded with expressions, statement blocks or namespaces to further enrich the power and versatility. In accordance therewith, context information describing the position and data types that an XML DOM can accept can be provided to the programmer via, for example, an integrated development environment.Type: GrantFiled: August 22, 2005Date of Patent: May 17, 2011Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, David N. Schach, Avner Y. Aharoni, Peter F. Drayton, Brian C. Beckman, Amanda Silver, Paul A. Vick
-
Publication number: 20110072413Abstract: An architecture that that extends conventional computer programming languages that compile into an instance of an extensible markup language (XML) document object model (DOM) to provide support for XML literals in the underlying programming language. This architecture facilitates a convenient short cut by replacing the complex explicit construction required by conventional systems to create an instance of a DOM with a concise XML literal for which conventional compilers can translate into the appropriate code. The architecture allows these XML literals to be embedded with expressions, statement blocks or namespaces to further enrich the power and versatility. In accordance therewith, context information describing the position and data types that an XML DOM can accept can be provided to the programmer via, for example, an integrated development environment.Type: ApplicationFiled: November 29, 2010Publication date: March 24, 2011Applicant: MICROSOFT CORPORATIONInventors: Henricus Johannes Maria Meijer, David N. Schach, Avner Y. Aharoni, Peter F. Drayton, Brian C. Beckman, Amanda Silver, Paul A. Vick
-
Publication number: 20100218173Abstract: Modified compilers and other development tools provide implied line continuation within a sequence of syntax tokens of a programming language grammar which includes multiple semantic contexts and which uses line termination as presumptive statement termination. When source code parsing encounters a line terminator adjacent a context-dependent implicit line continuation token in an associated semantic context, an explicit decision is made whether to imply line continuation. Line continuation may also be implied in response to other specified tokens.Type: ApplicationFiled: February 24, 2009Publication date: August 26, 2010Applicant: MICROSOFT CORPORATIONInventors: Avner Aharoni, Timothy Yat Tim Ng, David N. Schach, Paul Allen Vick, JR., Lisa Feigenbaum, Sophia Salim, Henricus Johannes Maria Meijer, Jonathan Paul Aneja, Joseph Tyler Whitney
-
Patent number: 7756882Abstract: Data is requested by an XML application conforming to the XML data model. The data is stored in an SQL database conforming to the relational data model. A mapping component transforms the XML query into an SQL query using a mapping component comprising instructions obtained from an instruction set defined by a mapping algebra. The transformed operation is used to retrieve the data. Once retrieved, the algebraically defined mapping component transforms the SQL data from data conforming to the relational data model to data conforming to the XML data for use in the XML application.Type: GrantFiled: October 1, 2004Date of Patent: July 13, 2010Assignee: Microsoft CorporationInventors: Avner Y. Aharoni, David N. Schach, Erik Meijer
-
Publication number: 20100162218Abstract: Systems and methods that enhance expressibility in a programming language (e.g., Visual Basic) via relaxation of artificial restrictions and extension of delegates associated therewith, without changing the runtime infrastructure. A stub is employed that can replace an impermissible expression in the programming language, to leverage the existing permissible expressions.Type: ApplicationFiled: March 1, 2010Publication date: June 24, 2010Applicant: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, Brian C. Beckman, Peter F. Drayton, David N. Schach, Ralf Lammel, Avner Y. Aharoni
-
Patent number: 7730448Abstract: The subject disclosure pertains to layering of a plurality of type systems. A development environment and language compilers can support multiple data models and their type systems in the same program. Elements of a program such as expressions can then be associated with several types from the multiple type systems. Compilers can employ the information provided by additional type systems to improve static type checking. Furthermore, the information can be bubbled up to a user in a plurality of forms including but not limited to intelligent assistance, auto-completion, tool tips, error information, and return types to enhance the program development experience.Type: GrantFiled: August 11, 2005Date of Patent: June 1, 2010Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, David N. Schach, Avner Y. Aharoni, Peter F. Drayton
-
Patent number: 7716656Abstract: Systems and methods that enhance a programming language by introducing null unification on a type level in addition to a value level, for static types of both reference and value types T. An operator that adds a level of nullability (and removes such nullability) is introduced without a mention of the actual type, to steer overloading in a precise manner.Type: GrantFiled: August 30, 2005Date of Patent: May 11, 2010Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, Amanda Silver, Brian C. Beckman, Paul A. Vick, Avner Y. Aharoni, David N. Schach, Peter F. Drayton
-
Patent number: 7694285Abstract: Systems and methods that enhance expressibility in a programming language (e.g., Visual Basic) via relaxation of artificial restrictions and extension of delegates associated therewith, without changing the runtime infrastructure. A stub is employed that can replace an impermissible expression in the programming language, to leverage the existing permissible expressions.Type: GrantFiled: August 30, 2005Date of Patent: April 6, 2010Assignee: Microsoft CorporationInventors: Henricus Johannes Maria Meijer, Brian C. Beckman, Peter F. Drayton, David N. Schach, Ralf Lammel, Avner Y. Aharoni