Lazy Lists II

Stefan Friedrich

April 26, 2004

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.


This theory contains some useful extensions to the LList (lazy list) theory by Larry Paulson, including finite, infinite, and positive llists over an alphabet, as well as the new constants take and drop and the prefix order of llists. Finally, the notions of safety and liveness in the sense of Alpern and Schneider (1985) are defined.


BSD License


Session Lazy-Lists-II

Depends on

Used by