This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
open import Relation.Binary.PropositionalEquality | |
open import Data.Unit | |
open import Data.Product | |
open ≡-Reasoning | |
variable | |
A : Set | |
B : Set |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{-# LANGUAGE RecursiveDo #-} | |
f = do rec a <- do a <- b | |
putStrLn "Hello" | |
return a | |
b <- do return $ return a :: IO (IO ()) | |
return a | |
f' = do rec b <- do return $ return a :: IO (IO ()) | |
a <- do a <- b |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
{-# LANGUAGE ScopedTypeVariables #-} | |
{-# LANGUAGE Strict #-} | |
import Debug.Trace | |
h :: forall a. a -> () | |
h a = | |
let f :: Show a => () | |
f = trace "Hi" $ traceShow a () | |
in () |