Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming

Real-Time Deques, Multihead Turing Machines, and Purely Functional Programming (1993)

Cached

Download Links

[www.iis.sinica.edu.tw]

by Tyng-Ruey Chuang , Benjamin Goldberg

Venue:	In Conference on Functional Programming Languages and Computer Architecture
Citations:	11 - 1 self

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	Real-time deques, multihead Turing machines, and purely functional programming	INFERENCE
AUTHOR NAME	Tyng-Ruey Chuang	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; Courant Institute of Mathematical Sciences; New York University	user correction - Legacy Corrections
AUTHOR ADDR	251 Mercer Street, New York, NY 10012, USA	user correction - Legacy Corrections
AUTHOR NAME	Benjamin Goldberg	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; Courant Institute of Mathematical Sciences; New York University	user correction - Legacy Corrections
AUTHOR ADDR	251 Mercer Street, New York, NY 10012, USA	user correction - Legacy Corrections
ABSTRACT	We answer the following question: Can a deque (double-- ended queue) be implemented in a purely functional language such that each push or pop operation on either end of a queue is accomplished in O(1) time in the worst case? The answer is yes, thus solving a problem posted by Gajewska and Tarjan [14] and by Ponder, McGeer, and Ng [25], and refining results of Sarnak [26] and Hoogerwoord [18]. We term such a deque real--time, since its constant worstcase behavior might be useful in real time programs (assuming real--time garbage collection [3], etc.) Furthermore, we show that no restriction of the functional language is necessary, and that push and pop operations on previous versions of a deque can also be achieved in constant time. We present a purely functional implementation of real-- time deques and its complexity analysis. We then show that the implementation has some interesting implications, and can be used to give a real--time simulation of a multihead Turing machine in a purel...	user correction - Legacy Corrections
YEAR	1993	INFERENCE
VENUE	In Conference on Functional Programming Languages and Computer Architecture	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	289--298	INFERENCE
CITATIONS	32 found	ParsCit 1.0