Tree-based directed graph programming structures for a declarative programming language
US8296744B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 3, 2008 |
| Grant date | Oct 23, 2012 |
| Priority date | — |
| Expiry date | Jul 24, 2031 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F8/75
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.