[Oz] Lazy implementation of automata operations

[Denys Duchier]

Markus.Walther at mailer.uni-marburg.de (Markus Walther) writes:

> has anyone looked into the suitability of Oz/Mozart for
> clean implementation of on-demand (lazy) algorithms for
> common finite-state automata operations, in particular intersection?

not that I know.

> Unless anybody already has a piece of code, what would be the best
> approach? Any pointers to helpful literature?

Mozart supports convenient syntax for lazy functions:

        fun lazy {Foo X Y}  ... end

any invocation of Foo returns a future that is computed on demand
(i.e. when synchronized on)

Cheers,

-- 
Dr. Denys Duchier			Denys.Duchier at ps.uni-sb.de
Forschungsbereich Programmiersysteme	(Programming Systems Lab)
Universitaet des Saarlandes, Geb. 45	http://www.ps.uni-sb.de/~duchier
Postfach 15 11 50			Phone: +49 681 302 5618
66041 Saarbruecken, Germany		Fax:   +49 681 302 5615
-
Please send submissions to users at mozart-oz.org
and administriva mail to users-request at mozart-oz.org.
The Mozart Oz web site is at http://www.mozart-oz.org/.