Skip to content
The Chat Archive
gpt-4-0125-preview· OpenAI WildChat-4.8M (AI2)

module EvalIntExpr ( evalIntExpr, testEvalIntExpr, IntExpr(..) ) where import…

  1. User

    module EvalIntExpr ( evalIntExpr, testEvalIntExpr, IntExpr(..) ) where

    import Test.QuickCheck

    data IntExpr = Leaf Int | Add IntExpr IntExpr | Sub IntExpr IntExpr | Mul IntExpr IntExpr | Uminus IntExpr deriving (Eq, Show)

    evalIntExpr :: IntExpr -> Int evalIntExpr _ = error "TODO"

    testEvalIntExpr = do print "******* test evalIntExpr"

    quickCheck counterexample"Leaf"counterexample "Leaf" evalIntExpr (Leaf 42) == 42 quickCheck counterexample"Add"counterexample "Add" evalIntExpr (Add (Leaf 33) (Leaf 22)) == 55 quickCheck counterexample"Sub"counterexample "Sub" evalIntExpr (Sub (Leaf 33) (Leaf 22)) == 11 quickCheck counterexample"Mul"counterexample "Mul" evalIntExpr (Mul (Leaf 31) (Leaf 4)) == 124 quickCheck counterexample"Uminus"counterexample "Uminus" evalIntExpr (Uminus (Leaf 33)) == (-33) quickCheck counterexample"Complex"counterexample "Complex" evalIntExpr (Mul (Leaf 4) (Sub (Add (Leaf 3) (Uminus (Leaf 33))) (Leaf 20))) == (-200)

    quickCheck counterexample"e1+e2==e2+e1"counterexample "e1 + e2 == e2 + e1" (\ e1 e2 -> evalIntExpr (Add (Leaf e1) (Leaf e2)) == evalIntExpr (Add (Leaf e2) (Leaf e1))) quickCheck counterexample"e1∗e2==e2∗e1"counterexample "e1 * e2 == e2 * e1" (\ e1 e2 -> evalIntExpr (Mul (Leaf e1) (Leaf e2)) == evalIntExpr (Mul (Leaf e2) (Leaf e1))) quickCheck counterexample"(e1+e2)+e3==e1+(e2+e3)"counterexample "(e1 + e2) + e3 == e1 + (e2 + e3)" (\ e1 e2 e3 -> evalIntExpr (Add (Add (Leaf e1) (Leaf e2)) (Leaf e3)) == evalIntExpr (Add (Leaf e1) (Add (Leaf e2) (Leaf e3)))) quickCheck counterexample"(e1∗e2)∗e3==e1∗(e2∗e3)"counterexample "(e1 * e2) * e3 == e1 * (e2 * e3)" (\ e1 e2 e3 -> evalIntExpr (Mul (Mul (Leaf e1) (Leaf e2)) (Leaf e3)) == evalIntExpr (Mul (Leaf e1) (Mul (Leaf e2) (Leaf e3)))) quickCheck counterexample"e1−e2=−1∗(e2−e1)"counterexample "e1 - e2 = -1*(e2 - e1)" (\ e1 e2 -> evalIntExpr (Sub (Leaf e1) (Leaf e2)) == evalIntExpr (Mul (Leaf (-1)) (Sub (Leaf e2) (Leaf e1)))) quickCheck counterexample"e1∗(e2+e3)==e1∗e2+e1∗e3"counterexample "e1 * (e2 + e3) == e1*e2 + e1*e3" (\ e1 e2 e3 -> evalIntExpr (Mul (Leaf e1) (Add (Leaf e2) (Leaf e3))) == evalIntExpr (Add (Mul (Leaf e1) (Leaf e2)) (Mul (Leaf e1) (Leaf e3)))) quickCheck counterexample"e1∗(e2−e3)==e1∗e2−e1∗e3"counterexample "e1 * (e2 - e3) == e1*e2 - e1*e3" (\ e1 e2 e3 -> evalIntExpr (Mul (Leaf e1) (Sub (Leaf e2) (Leaf e3))) == evalIntExpr (Sub (Mul (Leaf e1) (Leaf e2)) (Mul (Leaf e1) (Leaf e3))))

  2. Assistant

    To complete this Haskell module, you need to implement the evalIntExpr function, which evaluates expressions represented by the IntExpr data type. Below is a full implementation for the EvalIntExpr module, including the missing function:

    module EvalIntExpr (evalIntExpr, testEvalIntExpr, IntExpr(..)) where
    
    import Test.QuickCheck
    
    data IntExpr =
          Leaf Int
        | Add IntExpr IntExpr
        | Sub IntExpr IntExpr
        | Mul IntExpr IntExpr
        | Uminus IntExpr
        deriving (Eq, Show)
    
    -- Function to evaluate an IntExpr into an Int
    evalIntExpr :: IntExpr -> Int
    evalIntExpr (Leaf n) = n
    evalIntExpr (Add e1 e2) = evalIntExpr e1 + evalIntExpr e2
    evalIntExpr (Sub e1 e2) = evalIntExpr e1 - evalIntExpr e2
    evalIntExpr (Mul e1 e2) = evalIntExpr e1 * evalIntExpr e2
    evalIntExpr (Uminus e) = - (evalIntExpr e)
    
    -- Function to test evalIntExpr using QuickCheck
    testEvalIntExpr = do
        print "******* test evalIntExpr"
        quickCheck $ counterexample "Leaf" $ evalIntExpr (Leaf 42) == 42
        quickCheck $ counterexample "Add" $
          evalIntExpr (Add (Leaf 33) (Leaf 22)) == 55
        quickCheck $ counterexample "Sub" $
          evalIntExpr (Sub (Leaf 33) (Leaf 22)) == 11
        quickCheck $ counterexample "Mul" $
          evalIntExpr (Mul (Leaf 31) (Leaf 4)) == 124
        quickCheck $ counterexample "Uminus" $
          evalIntExpr (Uminus (Leaf 33)) == (-33)
        quickCheck $ counterexample "Complex" $
          evalIntExpr (Mul (Leaf 4)
                    (Sub (Add (Leaf 3) (Uminus (Leaf 33)))
                      (Leaf 20))) == (-200)
        quickCheck $ counterexample "e1 + e2 == e2 + e1" $
          (\ e1 e2 -> 
              evalIntExpr (Add (Leaf e1) (Leaf e2)) ==
              evalIntExpr (Add (Leaf e2) (Leaf e1)))
        quickCheck $ counterexample "e1 * e2 == e2 * e1" $
          (\ e1 e2 -> 
              evalIntExpr (Mul (Leaf e1) (Leaf e2)) ==
              evalIntExpr (Mul (Leaf e2) (Leaf e1)))
        quickCheck $ counterexample "(e1 + e2) + e3 == e1 + (e2 + e3)" $
          (\ e1 e2 e3 -> 
              evalIntExpr (Add (Add (Leaf e1) (Leaf e2)) (Leaf e3)) ==
              evalIntExpr (Add (Leaf e1) (Add (Leaf e2) (Leaf e3))))
        quickCheck $ counterexample "(e1 * e2) * e3 == e1 * (e2 * e3)" $
          (\ e1 e2 e3 ->
              evalIntExpr (Mul (Mul (Leaf e1) (Leaf e2)) (Leaf e3)) ==
              evalIntExpr (Mul (Leaf e1) (Mul (Leaf e2) (Leaf e3))))
        quickCheck $ counterexample "e1 - e2 = -1*(e2 - e1)" $
          (\ e1 e2 ->
              evalIntExpr (Sub (Leaf e1) (Leaf e2)) ==
              evalIntExpr (Mul (Leaf (-1)) (Sub (Leaf e2) (Leaf e1))))
        quickCheck $ counterexample "e1 * (e2 + e3) == e1*e2 + e1*e3" $
          (\ e1 e2 e3 -> 
              evalIntExpr (Mul (Leaf e1) (Add (Leaf e2) (Leaf e3))) ==
              evalIntExpr (Add (Mul (Leaf e1) (Leaf e2)) 
                            (Mul (Leaf e1) (Leaf e3))))
        quickCheck $ counterexample "e1 * (e2 - e3) == e1*e2 - e1*e3" $
          (\ e1 e2 e3 -> 
              evalIntExpr (Mul (Leaf e1) (Sub (Leaf e2) (Leaf e3))) ==
              evalIntExpr (Sub (Mul (Leaf e1) (Leaf e2)) 
                            (Mul (Leaf e1) (Leaf e3))))
    

    This implementation defines how to evaluate basic arithmetic expressions consisting of integers, addition, subtraction, multiplication, and unary minus. It also includes a set of QuickCheck properties to verify the correctness of the function against a variety of test cases.

Responses were produced in different, uncontrolled contexts (system prompts, settings, prior turns). This is not a benchmark.