36a17d092b
* update readme * Literal -> Lit, LitE -> Lit * commentary * infer * hindley milner inference :D * comments and better type errors * type IsString + test unification error * infer nonrec let binds infer nonrec let binds * small * LitE -> Lit * LitE -> Lit * TyInt -> TyCon "Int#" * parse type sigs; program type sigs * parse types * parse programs (with types :D) * parse programs (with type sigs :D) * Name = Text Name = Text * RlpcError * i'm on an airplane rn, my eyelids grow heavy, and i forgot my medication. should this be my final commit (of the week): gootbye * kinda sorta typechecking * back and medicated! * errorful (it's not good) * type-checked quasiquoters * fix hm tests * Compiler.JustRun * lex \ instead of \\ * grammar reference * 4:00 AM psychopath code * oh boy am i going to hate this code in 12 hours * application and lits appl * something * goofy * Show1 instances * fixation fufilled - back to work! * works * labels * infix decl * expr fixups * where * cool * aaaaa * decls fix * finally in a decent state * replace uses of many+satisfy with takeWhileP * layout layouts oh my layouts * i did not realise my fs is case insensitive * tysigs * add version bounds * grammar reference * 4:00 AM psychopath code * oh boy am i going to hate this code in 12 hours * application and lits appl * something * goofy * Show1 instances * fixation fufilled - back to work! * works * labels * infix decl * expr fixups * where * cool * aaaaa * decls fix * finally in a decent state * replace uses of many+satisfy with takeWhileP * layout layouts oh my layouts * i did not realise my fs is case insensitive * tysigs * its fine * threaded lexer * decent starting point * man this sucks * aagh * okay layouts kinda * kitten i'll be honest mommy's about to kill herself * see previous commit and scale back the part where i'm joking * version bounds * we're so back * fixy * cool * FIX REAL * oh my god * works * now we're fucking GETTING SOMEWHERE * i really need to learn git proper * infix exprs * remove debug flags * renamerlp * rename rlp * compiles (kill me) man * RlpcError -> IsRlpcError * when the "Test suite rlp-test: PASS" hits i'm like atlas and the world is writing two lines of code * errorful parser * errorful parser small * msgenvelope * errors! * allow uppercase sc names in preperation for Rlp2Core * letrec * infer letrec expressions * minor docs * checklist * minor docs * stable enough for a demo hey? * small fixups * new tag syntax; preparing for Core patterns new tag syntax; preparing for data names * temporary pragma system * resolve named data in case exprs * named constr tests * nearing release :3 * minor changes putting this on hold; implementing TTG first * some * oh my god guys!!! `Located` is a lax semimonoidal endofunctor on the category Hask!!!  * it's also a comonad. lol. * idk * show * abandon ship * at long last more no more undefineds * i should've made a lisp man this sucks * let layout * ttg boilerplate * fixup! ttg boilerplate * fixup! ttg boilerplate * organisation and cleaning organisation and tidying * error messages * driver progress * formatting * *R functions * -ddump-ast * debug tags * -ddump-eval * core driver * XRec fix * rlp2core base * ccoool * something * rlp TH * sc * expandableAlt * expandableAlt * fix layout_let * parse case exprs * case unrolling * rose * her light cuts deep time and time again ('her' of course referring to the field of computer science) * tidying * NameSupply effect * tidy * fix incomplete byTag * desugar * WIP associate postproc corecursive * sigh i'm gonna have to nuke the ast again in a month * remove old files * remove old files * fix top-level layout * define datatags * diagram * diagram * Update README.md * ppr debug flags ddump-parsed * ppr typesigs * ppr datatags * remove unnecessary comment * tidying * .hs -> .cr update examples * fix evil parser bug (it was a fucking typo) * fix evil lexer bug (it was actually quite subtle unlike prev.) * examples * examples * letrec + typechecking core * Update README.md * Rlp2Core: simple let binds * Rlp2Core: pattern let binds * small core fixes * update examples * formatting * typed coreExpr quoter * typechecking things * lt * decent state! * constants for bool tags * print# gm primitive * bind VarP after pats * fix: tag nested data names * gte gm prim * more nightmare GM fixes * QuickSort example works i'm gonig to cry * remove debug code * remove debug tracers * ready? * update readme * remove bad, incorrct, outdated docs --------- Co-authored-by: crumbtoo <crumb@disroot.org>
108 lines
3.4 KiB
Haskell
108 lines
3.4 KiB
Haskell
{-# LANGUAGE OverloadedStrings #-}
|
|
{-# LANGUAGE TemplateHaskell #-}
|
|
module Arith
|
|
( evalCore
|
|
, evalArith
|
|
) where
|
|
----------------------------------------------------------------------------------
|
|
import Data.Functor.Classes (eq1)
|
|
import Lens.Micro
|
|
import Core.Syntax
|
|
import GM
|
|
import Test.QuickCheck
|
|
----------------------------------------------------------------------------------
|
|
|
|
-- does not support division because there are few things i'd hate more than
|
|
-- trying to catch divide-by-zero exceptions in pure code
|
|
data ArithExpr = IntA Int
|
|
| NegateA ArithExpr
|
|
-- to test Evals
|
|
| IdA ArithExpr
|
|
-- strict arith; these get inlined
|
|
| ArithExpr :+ ArithExpr
|
|
| ArithExpr :* ArithExpr
|
|
| ArithExpr :- ArithExpr
|
|
-- non-strict ops; these get wrapped in an `id` call to test
|
|
-- non-inlined arith
|
|
| ArithExpr ::+ ArithExpr
|
|
| ArithExpr ::* ArithExpr
|
|
| ArithExpr ::- ArithExpr
|
|
deriving Show
|
|
|
|
evalArith :: ArithExpr -> Int
|
|
evalArith (IntA n) = n
|
|
evalArith (IdA e) = evalArith e
|
|
evalArith (NegateA a) = negate (evalArith a)
|
|
evalArith (a :+ b) = evalArith a + evalArith b
|
|
evalArith (a :* b) = evalArith a * evalArith b
|
|
evalArith (a :- b) = evalArith a - evalArith b
|
|
evalArith (a ::+ b) = evalArith a + evalArith b
|
|
evalArith (a ::* b) = evalArith a * evalArith b
|
|
evalArith (a ::- b) = evalArith a - evalArith b
|
|
|
|
instance Arbitrary ArithExpr where
|
|
-- TODO: implement shrink
|
|
arbitrary = gen 4
|
|
where
|
|
gen :: Int -> Gen ArithExpr
|
|
gen n
|
|
| n > 0 = oneof
|
|
-- i don't feel like dealing with division at the moment
|
|
[ IntA <$> int
|
|
, NegateA <$> arbitrary
|
|
, IdA <$> arbitrary
|
|
, b (:+)
|
|
, b (:-)
|
|
, b (:*)
|
|
, b (::+)
|
|
, b (::-)
|
|
, b (::*)
|
|
]
|
|
| otherwise = IntA <$> int
|
|
where
|
|
b f = liftA2 f s s
|
|
s = gen (n `div` 2)
|
|
-- int = chooseInt (minBound,maxBound)
|
|
int = chooseInt (-500,500)
|
|
|
|
-- prop_ArithExprEqCoreExpr :: ArithExpr -> Bool
|
|
-- prop_ArithExprEqCoreExpr e = arithResult `eq1` coreResult
|
|
-- where
|
|
-- arithResult = Just (evalArith e)
|
|
-- coreResult = evalCore (toCore e)
|
|
|
|
toCore :: ArithExpr -> Program'
|
|
toCore expr = mempty & programScDefs .~
|
|
[ ScDef "id" ["x"] $ Var "x"
|
|
, ScDef "main" [] $ go expr
|
|
]
|
|
where
|
|
go :: ArithExpr -> Expr'
|
|
go (IntA n) = Lit (IntL n)
|
|
go (NegateA e) = "negate#" :$ go e
|
|
go (IdA e) = "id" :$ go e
|
|
go (a :+ b) = f "+#" a b
|
|
go (a :- b) = f "-#" a b
|
|
go (a :* b) = f "*#" a b
|
|
go (a ::+ b) = f ("id" :$ "+#") a b
|
|
go (a ::- b) = f ("id" :$ "-#") a b
|
|
go (a ::* b) = f ("id" :$ "*#") a b
|
|
|
|
f n a b = n :$ go a :$ go b
|
|
|
|
evalProgram :: Program' -> Maybe Int
|
|
evalProgram p = do
|
|
a <- fst <$> evalProg p
|
|
case a of
|
|
(NNum n) -> Just n
|
|
_ -> Nothing
|
|
|
|
evalCore :: ArithExpr -> Maybe Int
|
|
evalCore = evalProgram . toCore
|
|
|
|
-- pure []
|
|
|
|
-- runTestsArith :: IO Bool
|
|
-- runTestsArith = $quickCheckAll
|
|
|