Polynomial-Time Query Languages for Untyped Lists

Simple item page
dc.contributor.authorRobertson, Edward; Saxton, Lawrence; Van Gucht, Dirk
dc.date.accessioned2025-11-12T21:00:21Z
dc.date.available2025-11-12T21:00:21Z
dc.date.issued2005-12
dc.description.abstractWe 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.
dc.identifier.urihttps://hdl.handle.net/2022/34469
dc.relation.ispartofseriesIndiana University Computer Science Technical Reports; TR621
dc.rightsThis work is protected by copyright unless stated otherwise.
dc.rights.uri
dc.titlePolynomial-Time Query Languages for Untyped Lists

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR621.pdf
Size:
203.77 KB
Format:
Adobe Portable Document Format
Download

Collections

Technical Reports
Can’t use the file because of accessibility barriers? Contact us