Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Inductive liste (A:Set) : Set :=
- | nil : liste A
- | cons : A -> liste A -> liste A.
- Fixpoint map {A B : Set} (f:A->B) (l:liste A) :liste B :=
- match l with
- | nil => nil B
- | (cons p q) => cons B (f p) (map f q)
- end.
- Definition o {A B C} (f : A -> B) (g : B -> C) :(A->C) :=
- fun x : A => g (f x).
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement