56 lines
1.6 KiB
Text
56 lines
1.6 KiB
Text
/-
|
|
Copyright (c) 2016 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
Author: Leonardo de Moura
|
|
-/
|
|
prelude
|
|
import init.logic init.nat
|
|
open decidable list
|
|
|
|
protected definition list.is_inhabited [instance] (A : Type) : inhabited (list A) :=
|
|
inhabited.mk list.nil
|
|
|
|
definition list.has_decidable_eq [instance] {A : Type} [H : decidable_eq A] (l₁ : list A) : ∀ l₂ : list A, decidable (l₁ = l₂) :=
|
|
list.rec_on l₁
|
|
(λ l₂, list.cases_on l₂
|
|
(tt rfl)
|
|
(λ b l₂, ff (λ H, list.no_confusion H)))
|
|
(λ a l₁ ih l₂, list.cases_on l₂
|
|
(ff (λ H, list.no_confusion H))
|
|
(λ b l₂,
|
|
decidable.cases_on (H a b)
|
|
(λ Hnab : a ≠ b, ff (λ H, list.no_confusion H (λ Hab Hl₁l₂, absurd Hab Hnab)))
|
|
(λ Hab : a = b,
|
|
decidable.cases_on (ih l₂)
|
|
(λ Hne : l₁ ≠ l₂, ff (λ H, list.no_confusion H (λ Hab Hl₁l₂, absurd Hl₁l₂ Hne)))
|
|
(λ He : l₁ = l₂, tt (congr (congr_arg cons Hab) He)))))
|
|
|
|
notation h :: t := cons h t
|
|
notation `[` l:(foldr `, ` (h t, cons h t) nil `]`) := l
|
|
|
|
namespace list
|
|
|
|
variable {A : Type}
|
|
|
|
definition append : list A → list A → list A
|
|
| [] l := l
|
|
| (h :: s) t := h :: (append s t)
|
|
|
|
notation l₁ ++ l₂ := append l₁ l₂
|
|
|
|
definition length : list A → nat
|
|
| [] := 0
|
|
| (a :: l) := length l + 1
|
|
|
|
open option nat
|
|
|
|
definition nth : list A → nat → option A
|
|
| [] _ := none
|
|
| (a :: l) 0 := some a
|
|
| (a :: l) (n+1) := nth l n
|
|
|
|
definition tail : list A → list A
|
|
| [] := []
|
|
| (a :: l) := l
|
|
|
|
end list
|