To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Real-Time Persistent Queu… - University of Gothenburg, Sweden Till startsida
To content Read more about how we use cookies on

Real-Time Persistent Queues and Deques with Logic Variables (Declarative Pearl)

Conference paper
Authors Gerlof Bouma
Published in Proceedings of the 11th International Symposium on Functional and Logic Programming (FLOPS 2012)
Pages 62--73
ISBN 978-3-642-29821-9
Publication year 2012
Published at Department of Swedish
Pages 62--73
Language en
Subject categories Theoretical computer science


We present a Prolog implementation of real-time persistent queues and double-ended queues. Our implementation is inspired by Okasaki’s lazy-functional approach, but relies only on standard Prolog, comprising of the pure subset plus if-then-else constructs to efficiently implement guards and meta-calls for convenience. The resulting data structure is a nice demonstration of the fact that the use of logic variables to hold the outcome of an unfinished computation can sometimes give the same kind of elegant and compact solutions as lazy evaluation.

Page Manager: Webmaster|Last update: 9/11/2012

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?