Polynomial-Time Query Languages for Untyped Lists
Loading...
Can’t use the file because of accessibility barriers? Contact us
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Permanent Link
Abstract
We present a language for querying list-based complex objects. These objects are constructible with untyped nodes and hence permit arbitrary-depth sublists. The language is shown to express precisely the polynomial-time generic functions. The language controls complexity by carefully restricting the replication of values and limiting the form and nesting of recursion.
Table of Contents
Description
Keywords
Citation
Journal
DOI
Link(s) to data and video for this item
Relation
Rights
This work is protected by copyright unless stated otherwise.