Mercurial > hg > Members > atton > agda-proofs

view sandbox/InferenceTypeComposition.agda @ 49:8031568638d0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Define composition of codesegment using subtype without constraint list
author atton <atton@cr.ie.u-ryukyu.ac.jp>
date Fri, 06 Jan 2017 06:29:51 +0000
parents 723532aa0592
children
line wrap: on
line source

module InferenceTypeComposition where

open import Relation.Binary.PropositionalEquality

infixl 30 _+++_
-- _+++_ : {A B C : Set} {equiv : B ≡ B} -> (A -> B) -> (B -> C) -> (A -> C)
_+++_ : {A B C : Set} -> (A -> B) -> (B -> C) -> (A -> C)
_+++_ f g = \x -> g (f x)

comp-sample : {A B C D : Set} -> (A -> B) -> (B -> C) -> (C -> D) -> (A -> D)
comp-sample f g h = f +++ g +++ h