### Abstract

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.

### License

BSD License

### Topics

- Computer science/Data structures

### Session Lazy-Lists-II

- LList2

### Depends on

- Coinductive

### Used by

- Topology

### Auto-related entries

- From Abstract to Concrete Gödel’s Incompleteness Theorems—Part I

## Cite

×

Lazy-Lists-II-AFP

    @article{Lazy-Lists-II-AFP,
      author  = {Stefan Friedrich},
      title   = {Lazy Lists II},
      journal = {Archive of Formal Proofs},
      month   = {April},
      year    = {2004},
      note    = {\url{https://isa-afp.org/entries/Lazy-Lists-II.html},
                 Formal proof development},
      ISSN    = {2150-914x},
    }

Download

## Download

× Download latest

Older releases:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Dec 14, 2021 : Isabelle2021-1
- Feb 23, 2021 : Isabelle2021
- Apr 18, 2020 : Isabelle2020
- Jun 11, 2019 : Isabelle2019
- Aug 16, 2018 : Isabelle2018
- Oct 10, 2017 : Isabelle2017
- Dec 17, 2016 : Isabelle2016-1
- Feb 22, 2016 : Isabelle2016
- May 27, 2015 : Isabelle2015
- Aug 28, 2014 : Isabelle2014
- Dec 11, 2013 : Isabelle2013-2
- Nov 17, 2013 : Isabelle2013-1
- Feb 16, 2013 : Isabelle2013
- May 24, 2012 : Isabelle2012
- Oct 11, 2011 : Isabelle2011-1
- Feb 11, 2011 : Isabelle2011
- Jul 1, 2010 : Isabelle2009-2
- Dec 12, 2009 : Isabelle2009-1
- Apr 29, 2009 : Isabelle2009
- Jun 10, 2008 : Isabelle2008
- Nov 27, 2007 : Isabelle2007
- Oct 14, 2005 : Isabelle2005
- May 21, 2004 : Isabelle2004
- Apr 27, 2004 : Isabelle2004