Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/13971
Title: | A Type System for DNAQL | Authors: | BRIJDER, Robert GILLIS, Joris VAN DEN BUSSCHE, Jan |
Issue Date: | 2012 | Source: | Stefanovic, Darko; Turberfield, Andrew (Eds.). DNA Computing and Molecular Programming, p. 12-24 | Series/Report: | Lecture Notes in Computer Science | Series/Report no.: | 7433 | Abstract: | Recently we have introduced a formal graph-based data model for DNA complexes geared towards database applications. The model is accompanied by the programming language DNAQL for querying databases in DNA. Due to natural restrictions on the implementability and termination of operations on DNA, programs in DNAQL are not always well defi ned on all possible inputs. Indeed, a problem left open by our previous work has been to devise a type system for DNAQL, with a soundness property to the e ect that well-typed programs are well defi ned on all inputs adhering to given input types. The contribution of the present paper is to propose such a type system and to establish soundness. Moreover, we show that the type system is flexible enough so that any database manipulation expressible in the relational algebra is also expressible in DNAQL in a well-typed manner. | Document URI: | http://hdl.handle.net/1942/13971 | ISBN: | 978-3-642-32208-2 | DOI: | 10.1007/978-3-642-32208-2_2 | Category: | C1 | Type: | Proceedings Paper |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
dna18.pdf | Peer-reviewed author version | 322.95 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
2
checked on Sep 2, 2020
Page view(s)
24
checked on Sep 6, 2022
Download(s)
12
checked on Sep 6, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.