{"text": "module HEff\n\n-- Based on https://github.com/effectfully/Eff/blob/master/Resources/Core.agda\n\nimport Data.HVect\n\nEffect : Type -> Type\nEffect r = r -> (a : Type) -> (a -> r) -> Type\n\nEffects : (Type -> Type) -> Vect n Type -> Vect n Type\nEffects f [] = []\nEffects f (x :: xs) = f x :: Effects f xs\n\ndata Exists' : {t : Type} -> {rs : Vect n Type} ->\n HVect rs -> t -> HVect (Effects Effect rs) -> Effect t -> Type where\n Here : Exists' (x :: xs) x (y :: ys) y\n There : Exists' xs x ys y -> Exists' (_ :: xs) x (_ :: ys) y\n\nupdate' : {t : Type} -> (r : HVect rs) -> (e : Exists' {t = t} r s effs eff) -> t -> HVect rs\nupdate' [] Here _ impossible\nupdate' [] (There _) _ impossible\nupdate' (x :: xs) Here v = v :: xs\nupdate' (x :: xs) (There e) v = x :: update' xs e v\n\nHEffect : Type\nHEffect = {n : Nat} -> (rs : Vect n Type) -> HVect (Effects Effect rs) -> Effect (HVect rs)\n\ndata HEff : HEffect where\n Pure : (x : a) -> HEff rs effs (r' x) a r'\n Bind : (e : Exists' r s effs eff) ->\n eff s a s' ->\n ((x : a) -> HEff rs effs (update' r e (s' x)) b r'') -> HEff rs effs r b r''\n\n(>>=) : HEff rs effs r a r' -> ((x : a) -> HEff rs effs (r' x) b r'') -> HEff rs effs r b r''\n(>>=) (Pure x) f = f x\n(>>=) (Bind e x f) g = Bind e x (\\y => f y >>= g)\n\ndata Access = LoggedOut | LoggedIn\ndata Store : Access -> (ty : Type) -> (ty -> Access) -> Type where\n Login : Store LoggedOut () (const LoggedIn)\n Logout : Store LoggedIn () (const LoggedOut)\n\nlogin : {auto e : Exists' r LoggedOut effs Store} ->\n HEff rs effs r () (\\_ => update' r e LoggedIn)\nlogin {e} = Bind e Login Pure\n\nlogout : {auto e : Exists' r LoggedIn effs Store} ->\n HEff rs effs r () (\\_ => update' r e LoggedOut)\nlogout {e} = Bind e Logout Pure\n\ndata State : Type -> (a : Type) -> (a -> Type) -> Type where\n Get : State s s (const s)\n Put : s' -> State s () (const s')\n\nget : {auto e : Exists' r s effs State} ->\n HEff rs effs r s (\\_ => update' r e s)\nget {e} = Bind e Get Pure\n\nput : {auto e : Exists' r s effs State} -> s' ->\n HEff rs effs r () (\\_ => update' r e s')\nput {e} s' = Bind e (Put s') Pure\n\nrun : HEff [] [] r a r' -> a\nrun (Pure x) = x\nrun (Bind Here _ _) impossible\nrun (Bind (There _) _ _) impossible\n\nhead' : HVect xs -> head xs\nhead' (x :: _) = x\ntail' : HVect xs -> HVect (tail xs)\ntail' (x :: xs) = xs\n\nrunStore : HEff (Access :: rs) (Store :: effs) r a r' -> HEff rs effs (tail' r) a (\\x => tail' $ r' x)\nrunStore (Pure x) = Pure x\nrunStore (Bind Here Login f) = runStore $ f ()\nrunStore (Bind Here Logout f) = runStore $ f ()\nrunStore (Bind (There e) eff f) = Bind e eff (\\x => runStore $ f x)\n\nrunState : (head' r) -> HEff (Type :: rs) (State :: effs) r a r' -> HEff rs effs (tail' r) (DPair a (\\x => head' $ r' x)) (\\x => tail' $ r' (fst x))\nrunState s (Pure x) = Pure (x ** s)\nrunState s (Bind Here Get f) = runState s $ f s\nrunState s (Bind Here (Put s') f) = runState s' $ f ()\nrunState s (Bind (There e) eff f) = Bind e eff (\\x => runState s $ f x)\n\nexample : HEff [Access, Type] [Store, State] [LoggedOut, Nat] Nat (\\n => [LoggedOut, Vect n Bool])\nexample = do login\n n <- get\n put (replicate n True)\n logout\n Pure n\n\ntest : DPair Nat (\\n => Vect n Bool)\ntest = run . runState 3 . runStore $ example \n", "meta": {"hexsha": "a197f1033335131656a94df915a00751a8b6c993", "size": 3308, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/HEff.idr", "max_stars_repo_name": "STELIORD/idris-snippets", "max_stars_repo_head_hexsha": "f5ca6fa86370d24587040af9871ae850bbc630c2", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2017-11-21T22:28:51.000Z", "max_stars_repo_stars_event_max_datetime": "2020-10-05T18:25:18.000Z", "max_issues_repo_path": "src/HEff.idr", "max_issues_repo_name": "stjordanis/idris-snippets", "max_issues_repo_head_hexsha": "d92734b8624ae27be21a63fcb041077b38eaaecb", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/HEff.idr", "max_forks_repo_name": "stjordanis/idris-snippets", "max_forks_repo_head_hexsha": "d92734b8624ae27be21a63fcb041077b38eaaecb", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-05-06T13:39:44.000Z", "max_forks_repo_forks_event_max_datetime": "2020-10-21T15:39:16.000Z", "avg_line_length": 35.1914893617, "max_line_length": 149, "alphanum_fraction": 0.5525997582, "num_tokens": 1152, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7310585786300049, "lm_q2_score": 0.5467381519846138, "lm_q1q2_score": 0.39969761627266737}} {"text": "import Data.Vect\n\ndata VectN : Type -> Type where\n MkVectN : (n : Nat) -> Vect n a -> VectN a\n\ndoSearch : Nat -> VectN Int\ndoSearch n = MkVectN ?vlength [1,2,3,4]\n", "meta": {"hexsha": "948cdceecc3a0d0648af915145fced335c6365f4", "size": 167, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "tests/idris2/interactive035/unify.idr", "max_stars_repo_name": "ska80/idris-jvm", "max_stars_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 396, "max_stars_repo_stars_event_min_datetime": "2016-07-17T08:00:45.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-21T22:47:13.000Z", "max_issues_repo_path": "tests/idris2/interactive035/unify.idr", "max_issues_repo_name": "ska80/idris-jvm", "max_issues_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 54, "max_issues_repo_issues_event_min_datetime": "2016-08-04T06:13:36.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-03T04:00:31.000Z", "max_forks_repo_path": "tests/idris2/interactive035/unify.idr", "max_forks_repo_name": "ska80/idris-jvm", "max_forks_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 28, "max_forks_repo_forks_event_min_datetime": "2016-09-15T15:19:03.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-27T13:05:48.000Z", "avg_line_length": 20.875, "max_line_length": 47, "alphanum_fraction": 0.628742515, "num_tokens": 61, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.7248702761768248, "lm_q2_score": 0.5506073655352404, "lm_q1q2_score": 0.3991189131205236}} {"text": "module Circuits.NetList.Linear.Usage.DataType.Use.Full\n\nimport Decidable.Equality\n\nimport Data.Nat\nimport Data.List.Elem\nimport Data.List.Quantifiers\n\nimport Data.Vect\nimport Data.Vect.AtIndex\nimport Data.Vect.Quantifiers\n\nimport Data.String\n\nimport Toolkit.Data.Whole\nimport Toolkit.Data.DList\nimport Toolkit.Data.DList.Elem\n\nimport Toolkit.Data.Vect.Extra\n\nimport Circuits.Common\nimport Circuits.NetList.Types\nimport Circuits.NetList.Linear.Usage.DataType\n\n%default total\n\nmutual\n public export\n data Use : (type : DType)\n -> (free : Usage type)\n -> (this : IsFree type free)\n -> (used : Usage type)\n -> (that : IsUsed type used)\n -> Type\n where\n UFL : Use LOGIC (Logic FREE) FreeL\n (Logic USED) UsedL\n\n UFA : (prf : Use type fs free us used)\n -> Use (BVECT (W (S n) ItIsSucc) type) (Array fs) (FreeA free)\n (Array us) (UsedA used)\n\n\n public export\n data Result : (type : DType)\n -> (free : Usage type)\n -> (prf : IsFree type free)\n -> Type\n where\n R : (u : Usage type)\n -> (used : IsUsed type u)\n -> (result : Use type f free u used)\n -> Result type f free\n\n namespace Vect\n public export\n data Use : (type : DType)\n -> (this : Vect n (Usage type))\n -> (free : All (IsFree type) this)\n -> (that : Vect n (Usage type))\n -> (used : All (IsUsed type) that)\n -> Type\n where\n End : Use type Nil Nil Nil Nil\n Ext : Use type f pf u pu\n -> Use type fs pfs us pus\n -> Use type (f::fs) (pf::pfs) (u::us) (pu::pus)\n\n public export\n data Result : (type : DType)\n -> (free : Vect n (Usage type))\n -> (prf : All (IsFree type) free)\n -> Type\n where\n R : {this : Vect n (Usage type)}\n -> (free : All (IsFree type) this)\n -> (us : Vect n (Usage type))\n -> (useds : All (IsUsed type) us)\n -> (results : Use type this free us useds)\n -> Result type this free\n\nmutual\n\n export\n use : {type : DType}\n -> {free : Usage type}\n -> (prf : IsFree type free)\n -> Result type free prf\n use FreeL\n = R (Logic USED) UsedL UFL\n\n use (FreeA prf) with (use prf)\n use (FreeA prf) | (R prf us useds results)\n = R (Array us) (UsedA useds) (UFA results)\n\n namespace Vect\n export\n use : {type : DType}\n -> {free : Vect n (Usage type)}\n -> (prf : All (IsFree type) free)\n -> Result type free prf\n use []\n = R [] [] [] End\n\n use (x :: xs) with (use x)\n use (x :: xs) | (R u used result) with (use xs)\n use (x :: xs) | (R u used result) | (R xs us useds results)\n = R (x :: xs) (u :: us) (used :: useds) (Ext result results)\n\n-- [ EOF ]\n", "meta": {"hexsha": "86797534898e71c150c269a8d2854d080fa81b03", "size": 3040, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Circuits/NetList/Linear/Usage/DataType/Use/Full.idr", "max_stars_repo_name": "gallais/linear-circuits", "max_stars_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_stars_repo_licenses": ["BSD-3-Clause-Clear"], "max_stars_count": 8, "max_stars_repo_stars_event_min_datetime": "2021-11-29T17:20:04.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-10T21:41:44.000Z", "max_issues_repo_path": "src/Circuits/NetList/Linear/Usage/DataType/Use/Full.idr", "max_issues_repo_name": "gallais/linear-circuits", "max_issues_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_issues_repo_licenses": ["BSD-3-Clause-Clear"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Circuits/NetList/Linear/Usage/DataType/Use/Full.idr", "max_forks_repo_name": "gallais/linear-circuits", "max_forks_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_forks_repo_licenses": ["BSD-3-Clause-Clear"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-02-09T19:49:11.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-09T19:49:11.000Z", "avg_line_length": 27.3873873874, "max_line_length": 78, "alphanum_fraction": 0.5065789474, "num_tokens": 843, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7090191214879992, "lm_q2_score": 0.5621765008857982, "lm_q1q2_score": 0.398593888779246}} {"text": "module IR.Lens\n\nimport Control.Category\n\ndata Store s a = MkStore (s -> a) s\n\nclass Functor w => Comonad (w : Type -> Type) where\n extract : w a -> a\n extend : (w a -> b) -> w a -> w b\n\nclass Comonad w => VerifiedComonad (w : Type -> Type) where\n comonadLaw1 : (wa : w a) ->\n extend extract wa = wa\n comonadLaw2 : (f : w a -> b) ->\n (wa : w a) ->\n extract (extend f wa) = f wa\n comonadLaw3 : (f : w b -> c) ->\n (g : w a -> b) ->\n (wa : w a) ->\n extend f (extend g wa) = extend (\\d => f (extend g d)) wa\n\ninstance Functor (Store s) where\n map f (MkStore g a) = MkStore (f . g) a\n\ninstance Comonad (Store s) where\n extract (MkStore f a) = f a\n extend f (MkStore g a) = MkStore (\\b => f (MkStore g b)) a\n\ninstance VerifiedComonad (Store s) where\n comonadLaw1 (MkStore f a) = ?storeIdentityProof\n comonadLaw2 f (MkStore g a) = refl\n comonadLaw3 f g (MkStore h a) = refl\n\n-- TODO: This is evil.\n-- Supposedly (jonsterling) this definition used to work without the believe_me.\neta : (f : a -> b) -> f = (\\c => f c)\neta g = believe_me refl {g}\n\nstoreIdentityProof = proof\n intros\n rewrite eta f\n trivial\n\npos : Store s a -> s\npos (MkStore _ s) = s\n\npeek : s -> Store s a -> a\npeek s (MkStore f _) = f s\n\npeeks : (s -> s) -> Store s a -> a\npeeks f (MkStore g s) = g (f s)\n\ndata Lens a b = MkLens (a -> Store b a)\n\ninstance Category Lens where\n id = MkLens (MkStore id)\n (.) (MkLens f) (MkLens g) = MkLens (\\a => case g a of\n MkStore ba b => case f b of\n MkStore cb c => MkStore (Prelude.Basics.(.) ba cb) c)\n\nlens : (a -> b) -> (b -> a -> a) -> Lens a b\nlens f g = MkLens (\\a => MkStore (\\b => g b a) (f a))\n\niso : (a -> b) -> (b -> a) -> Lens a b\niso f g = MkLens (\\a => MkStore g (f a))\n\ngetL : Lens a b -> a -> b\ngetL (MkLens f) a = pos (f a)\n\nsetL : Lens a b -> b -> a -> a\nsetL (MkLens f) b = peek b . f\n\nmodL : Lens a b -> (b -> b) -> a -> a\nmodL (MkLens f) g = peeks g . f\n\ninfixr 0 ^$\n(^$) : Lens a b -> a -> b\n(^$) = getL\n\ninfixr 4 ^=\n(^=) : Lens a b -> b -> a -> a\n(^=) = setL\n\ninfixr 4 ^%=\n(^%=) : Lens a b -> (b -> b) -> a -> a\n(^%=) = modL\n", "meta": {"hexsha": "e820c850cde416d17004241f3e936b4e3cf69b1a", "size": 2159, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/IR/Lens.idr", "max_stars_repo_name": "puffnfresh/iridium", "max_stars_repo_head_hexsha": "2dc438475962b62f6ca8d00f0dff3add87418dec", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 133, "max_stars_repo_stars_event_min_datetime": "2015-01-07T20:02:06.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-10T18:09:54.000Z", "max_issues_repo_path": "src/IR/Lens.idr", "max_issues_repo_name": "victoredwardocallaghan/iridium", "max_issues_repo_head_hexsha": "e1fde25ed8a4c601dcdddc5ef81c03bfca8f459a", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 4, "max_issues_repo_issues_event_min_datetime": "2016-01-18T01:32:33.000Z", "max_issues_repo_issues_event_max_datetime": "2018-10-09T02:36:06.000Z", "max_forks_repo_path": "src/IR/Lens.idr", "max_forks_repo_name": "victoredwardocallaghan/iridium", "max_forks_repo_head_hexsha": "e1fde25ed8a4c601dcdddc5ef81c03bfca8f459a", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 7, "max_forks_repo_forks_event_min_datetime": "2015-11-02T05:18:42.000Z", "max_forks_repo_forks_event_max_datetime": "2020-09-29T02:12:48.000Z", "avg_line_length": 24.816091954, "max_line_length": 80, "alphanum_fraction": 0.5321908291, "num_tokens": 816, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7185943925708562, "lm_q2_score": 0.5544704649604273, "lm_q1q2_score": 0.39843936696671844}} {"text": "module Collections.Util.Bnd\n\nimport Decidable.Equality\nimport Control.Relation\nimport Control.Order\nimport Decidable.Order.Strict\n\n||| Extends a type with `Bot` and `Top` values, making it a \"bounded\" type.\n|||\n||| Used for orderings in order to allow a value which precedes all other values (`Bot`), and a\n||| value which follows all other values (`Top`).\npublic export\ndata Bnd : (0 a : Type) -> Type where\n Bot : Bnd a\n Mid : (x : a) -> Bnd a\n Top : Bnd a\n\nexport\nUninhabited (Bot = Mid x) where\n uninhabited Refl impossible\n\nexport\nUninhabited (Bot = Top) where\n uninhabited Refl impossible\n\nexport\nUninhabited (Mid x = Bot) where\n uninhabited Refl impossible\n\nexport\nUninhabited (Mid x = Top) where\n uninhabited Refl impossible\n\nexport\nUninhabited (Top = Bot) where\n uninhabited Refl impossible\n\nexport\nUninhabited (Top = Mid x) where\n uninhabited Refl impossible\n\n||| Proof that if two `Mid` values are equal, then their wrapped values are equal\nexport\nmidEq : Mid x = Mid y -> x = y\nmidEq Refl = Refl\n\n||| Proof that if two `Mid` values are not equal, then their wrapped values are not equal\nexport\nmidNotEq : Not (Mid x = Mid y) -> Not (x = y)\nmidNotEq ctra prf = ctra $ cong Mid prf\n\nexport\nDecEq t => DecEq (Bnd t) where\n decEq Bot Bot = Yes Refl\n decEq Bot (Mid _) = No absurd\n decEq Bot Top = No absurd\n decEq (Mid _) Bot = No absurd\n decEq (Mid x) (Mid y) = case decEq x y of\n Yes prf => Yes $ cong Mid prf\n No ctra => No $ ctra . midEq\n decEq (Mid x) Top = No absurd\n decEq Top Bot = No absurd\n decEq Top (Mid _) = No absurd\n decEq Top Top = Yes Refl\n\n||| Given a LTE (less than or equal) relation on `a`, produces an LTE relation extended to `Bnd a`\n|||\n||| @ o The ordering to extend\npublic export\ndata BndLTE : (o : a -> a -> Type) -> Bnd a -> Bnd a -> Type where\n ||| `Bot` is less than or equal to everything\n BotLTEAll : BndLTE o Bot y\n ||| Two `Mid`s are ordered iff their wrapped values are ordered\n MidLTEMid : {0 o : a -> a -> Type} -> o x y -> BndLTE o (Mid x) (Mid y)\n ||| Everything is less than or equal to `Top`\n AllLTETop : BndLTE o x Top\n\nexport\nReflexive ty rel => Reflexive (Bnd ty) (BndLTE rel) where\n reflexive {x=Bot} = BotLTEAll\n reflexive {x=Mid x} = MidLTEMid $ reflexive {x=x}\n reflexive {x=Top} = AllLTETop\n\nexport\nTransitive ty rel => Transitive (Bnd ty) (BndLTE rel) where\n transitive {x=Bot} BotLTEAll yz = BotLTEAll\n transitive {x=Mid x} {y=Mid y} {z=Mid z} (MidLTEMid xy) (MidLTEMid yz) = MidLTEMid $ transitive {x} {y} {z} xy yz\n transitive {x=Mid _} {y=Mid _} {z=Top} (MidLTEMid xy) AllLTETop = AllLTETop\n transitive {y=Top} {z=Top} AllLTETop AllLTETop = AllLTETop\n\nexport\nAntisymmetric ty rel => Antisymmetric (Bnd ty) (BndLTE rel) where\n antisymmetric {x=Bot} {y=Bot} BotLTEAll BotLTEAll = Refl\n antisymmetric {x=Mid x} {y=Mid y} (MidLTEMid xy) (MidLTEMid yx) = cong Mid $ antisymmetric {x} {y} xy yx\n antisymmetric {x=Top} {y=Top} AllLTETop AllLTETop = Refl\n\nexport\nConnex ty rel => Connex (Bnd ty) (BndLTE rel) where\n connex {x=Bot} _ = Left BotLTEAll\n connex {y=Bot} _ = Right BotLTEAll\n connex {x=Top} _ = Right AllLTETop\n connex {y=Top} _ = Left AllLTETop\n connex {x=Mid x} {y=Mid y} prf = case connex {rel} {x} {y} (midNotEq prf) of\n Left xy => Left $ MidLTEMid xy\n Right yx => Right $ MidLTEMid yx\n\n||| Given a LT (less than) relation on `a`, produces a LT relation extended to `Bnd a`\n|||\n||| @ so The strict ordering to extend\npublic export\ndata BndLT : (so : a -> a -> Type) -> Bnd a -> Bnd a -> Type where\n BotLTMid : BndLT so Bot (Mid x)\n BotLTTop : BndLT so Bot Top\n MidLTMid : {0 so : a -> a -> Type} -> so x y -> BndLT so (Mid x) (Mid y)\n MidLTTop : BndLT so (Mid x) Top\n\nexport\nTransitive ty rel => Transitive (Bnd ty) (BndLT rel) where\n transitive {x=Bot} {y=Mid _} {z=Mid _} BotLTMid (MidLTMid _) = BotLTMid\n transitive {x=Bot} {y=Mid _} {z=Top} BotLTMid MidLTTop = BotLTTop\n transitive {x=Bot} {y=Top} BotLTTop BotLTMid impossible\n transitive {x=Bot} {y=Top} BotLTTop BotLTTop impossible\n transitive {x=Bot} {y=Top} BotLTTop (MidLTMid x) impossible\n transitive {x=Bot} {y=Top} BotLTTop MidLTTop impossible\n transitive {x=Mid x} {y=Mid y} {z=Mid z} (MidLTMid xy) (MidLTMid yz) = MidLTMid $ transitive {x} {y} {z} xy yz\n transitive {x=Mid x} {y=Mid y} {z=Top} (MidLTMid w) MidLTTop = MidLTTop\n transitive {x=Mid _} {y=Top} MidLTTop BotLTMid impossible\n transitive {x=Mid _} {y=Top} MidLTTop BotLTTop impossible\n transitive {x=Mid _} {y=Top} MidLTTop (MidLTMid y) impossible\n transitive {x=Mid _} {y=Top} MidLTTop MidLTTop impossible\n\nexport\nIrreflexive ty rel => Irreflexive (Bnd ty) (BndLT rel) where\n irreflexive {x=Mid x} (MidLTMid xx) = irreflexive {x} xx\n\nexport\nAsymmetric ty rel => Asymmetric (Bnd ty) (BndLT rel) where\n asymmetric BotLTMid BotLTMid impossible\n asymmetric BotLTMid BotLTTop impossible\n asymmetric BotLTMid (MidLTMid _) impossible\n asymmetric BotLTMid MidLTTop impossible\n asymmetric BotLTTop BotLTMid impossible\n asymmetric BotLTTop BotLTTop impossible\n asymmetric BotLTTop (MidLTMid _) impossible\n asymmetric BotLTTop MidLTTop impossible\n asymmetric (MidLTMid xy) (MidLTMid yx) = asymmetric {rel} xy yx\n asymmetric MidLTTop BotLTMid impossible\n asymmetric MidLTTop BotLTTop impossible\n asymmetric MidLTTop (MidLTMid _) impossible\n asymmetric MidLTTop MidLTTop impossible\n\nexport\nStrictPreorder ty rel => StrictPreorder (Bnd ty) (BndLT rel) where\n\nexport\nStrictOrdered ty rel => StrictOrdered (Bnd ty) (BndLT rel) where\n order Bot Bot = DecEQ Refl\n order Bot (Mid _) = DecLT BotLTMid\n order Bot Top = DecLT BotLTTop\n order (Mid _) Bot = DecGT BotLTMid\n order (Mid x) (Mid y) = case order x y of\n DecLT xy => DecLT $ MidLTMid xy\n DecEQ prf => DecEQ $ cong Mid prf\n DecGT yx => DecGT $ MidLTMid yx\n order (Mid _) Top = DecLT MidLTTop\n order Top Bot = DecGT BotLTTop\n order Top (Mid _) = DecGT MidLTTop\n order Top Top = DecEQ Refl\n", "meta": {"hexsha": "13935d068de12b3a4c8695a2a05471c29aab96c2", "size": 6587, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Collections/Util/Bnd.idr", "max_stars_repo_name": "polendri/idris-collections", "max_stars_repo_head_hexsha": "8492ab9ceffdef72d25a65c6b4296e561816f73c", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2020-11-24T10:58:23.000Z", "max_stars_repo_stars_event_max_datetime": "2021-09-20T16:16:04.000Z", "max_issues_repo_path": "src/Collections/Util/Bnd.idr", "max_issues_repo_name": "polendri/idris-collections", "max_issues_repo_head_hexsha": "8492ab9ceffdef72d25a65c6b4296e561816f73c", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Collections/Util/Bnd.idr", "max_forks_repo_name": "polendri/idris-collections", "max_forks_repo_head_hexsha": "8492ab9ceffdef72d25a65c6b4296e561816f73c", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 38.9763313609, "max_line_length": 115, "alphanum_fraction": 0.6266889327, "num_tokens": 2214, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6548947290421276, "lm_q2_score": 0.6076631698328916, "lm_q1q2_score": 0.39795540695659193}} {"text": "module HoareAsLogic\n\nimport Assn\nimport Expr\nimport Equiv\nimport Hoare\nimport Imp\nimport Logic\nimport Maps\n\n%access public export\n\n%default total\n\ndata HoareProof : Assertion -> Com -> Assertion -> Type where\n H_Skip : HoareProof p SKIP p\n H_Ass : HoareProof (AssignSub x a q) (x ::= a) q\n H_Seq : HoareProof p c q -> HoareProof q d r ->\n HoareProof p (do c; d) r\n H_If : HoareProof (\\st => (p st, BAssn b st)) c1 q ->\n HoareProof (\\st => (p st, Not (BAssn b st))) c2 q ->\n HoareProof p (CIf b c1 c2) q\n H_If1 : HoareProof (\\st => (p st, BAssn b st)) c q ->\n (\\st => (p st, Not (BAssn b st))) ->> q ->\n HoareProof p (CIf1 b c) q\n H_While : HoareProof (\\st => (p st, BAssn b st)) c p ->\n HoareProof p (CWhile b c) (\\st => (p st, Not (BAssn b st)))\n H_For : HoareProof p init q ->\n HoareProof (\\st => (q st, BAssn cond st)) (do body; updt) q ->\n HoareProof p (CFor init cond updt body)\n (\\st => (q st, Not (BAssn cond st)))\n H_Repeat : HoareProof p c q -> (\\st => (q st, Not (BAssn b st))) ->> p ->\n HoareProof p (CRepeat c b) (\\st => (q st, BAssn b st))\n H_Consequence : HoareProof p' c q' -> (p ->> p') -> (q' ->> q) ->\n HoareProof p c q\n\nh_consequence_pre : HoareProof p' c q -> (p ->> p') -> HoareProof p c q\nh_consequence_pre hp imp = H_Consequence hp imp assertImpliesRefl\n\nh_consequence_post : HoareProof p c q' -> (q' ->> q) -> HoareProof p c q\nh_consequence_post hp imp = H_Consequence hp assertImpliesRefl imp\n\nsample_proof : HoareProof\n (AssignSub X (X + 1) (AssignSub X (X + 2) (\\st => st X = 3)))\n (do X ::= X + 1; X ::= X + 2)\n (\\st => st X = 3)\nsample_proof = H_Seq H_Ass H_Ass\n\nhoare_proof_sound : HoareProof p c q -> HoareTriple p c q\nhoare_proof_sound {q} H_Skip = hoare_skip q\nhoare_proof_sound (H_Ass {q}) = hoare_assign q\nhoare_proof_sound (H_Seq {p} {q} {r} hp1 hp2) =\n hoare_seq p q r (hoare_proof_sound hp2) (hoare_proof_sound hp1)\nhoare_proof_sound (H_If {p} {q} {b} hpt hpf) =\n hoare_if p q (hoare_proof_sound hpt) (hoare_proof_sound hpf)\nhoare_proof_sound (H_If1 {p} {q} hp imp) =\n hoare_if1 p q (hoare_proof_sound hp) imp\nhoare_proof_sound (H_While {p} {b} hp) =\n hoare_while p (hoare_proof_sound hp)\nhoare_proof_sound (H_For {p} {q} hp_init hp_body_updt) =\n hoare_for p q (hoare_proof_sound hp_init) (hoare_proof_sound hp_body_updt)\nhoare_proof_sound (H_Repeat {p} {q} hp imp) =\n hoare_repeat p q (hoare_proof_sound hp) imp\nhoare_proof_sound (H_Consequence {p} {q} {p'} {q'} hp p_imp q_imp) =\n hoare_consequence p p' q q' (hoare_proof_sound hp) p_imp q_imp\n\nh_post_true_deriv : HoareProof p c (const ())\nh_post_true_deriv {c = CSkip} = h_consequence_pre H_Skip (\\_, _ => ())\nh_post_true_deriv {c = (CAss _ _)} = h_consequence_pre H_Ass (\\_, _ => ())\nh_post_true_deriv {p} {c = (CSeq c1 c2)} =\n H_Seq (h_post_true_deriv {p=p} {c=c1}) (h_post_true_deriv {c=c2})\nh_post_true_deriv {c = (CIf _ c1 c2)} =\n H_If (h_post_true_deriv {c=c1}) (h_post_true_deriv {c=c2})\nh_post_true_deriv {c = (CIf1 _ c)} =\n H_If1 (h_post_true_deriv {c=c}) (\\_, _ => ())\nh_post_true_deriv {c = (CWhile _ c)} =\n H_Consequence (H_While {p=const ()} (h_post_true_deriv {c=c}))\n (\\_, _ => ())\n (\\_, _ => ())\nh_post_true_deriv {p} {c = f@(CFor init _ updt body)} =\n h_consequence_post\n (H_For (h_post_true_deriv {p=p} {c=init})\n (h_post_true_deriv {c=assert_smaller f (do body; updt)}))\n (\\_, _ => ())\nh_post_true_deriv {c = (CRepeat c _)} =\n H_Consequence (H_Repeat (h_post_true_deriv {c=c}) (\\_, _ => ()))\n (\\_, _ => ())\n (\\_, _ => ())\n\nh_pre_false_deriv : HoareProof (const Void) c q\nh_pre_false_deriv {c = CSkip} = h_consequence_pre H_Skip (\\_, v => absurd v)\nh_pre_false_deriv {c = (CAss x e)} = h_consequence_pre H_Ass (\\_, v => absurd v)\nh_pre_false_deriv {c = (CSeq c1 c2)} = H_Seq (h_pre_false_deriv {c=c1})\n (h_pre_false_deriv {c=c2})\nh_pre_false_deriv {c = (CIf _ ct cf)} =\n H_If (h_consequence_pre (h_pre_false_deriv {c=ct}) (\\_, (v, _) => v))\n (h_consequence_pre (h_pre_false_deriv {c=cf}) (\\_, (v, _) => v))\nh_pre_false_deriv {c = (CIf1 _ c)} =\n H_If1 (h_consequence_pre (h_pre_false_deriv {c=c}) (\\_, (v, _) => v))\n (\\_, (v, _) => absurd v)\nh_pre_false_deriv {c = (CWhile _ c)} =\n h_consequence_post\n (H_While (h_consequence_pre (h_pre_false_deriv {c=c} {q=const Void})\n (\\_, (v, _) => v)))\n (\\_, (v, _) => absurd v)\nh_pre_false_deriv {c = f@(CFor init _ updt body)} =\n h_consequence_post\n (H_For (h_pre_false_deriv {c=init} {q=const Void})\n (h_consequence_pre\n (h_pre_false_deriv {c=assert_smaller f (do body; updt)})\n (\\_, (v, _) => v)))\n (\\_, (v, _) => absurd v)\nh_pre_false_deriv {c = (CRepeat c _)} =\n h_consequence_post\n (H_Repeat (h_pre_false_deriv {c=c} {q=const Void}) (\\_, (v, _) => v))\n (\\_, (v, _) => absurd v)\n\nWP : Com -> Assertion -> Assertion\nWP c q = \\s => (s' : State) -> CEval c s s' -> q s'\n\nwp_is_precondition : HoareTriple (WP c q) c q\nwp_is_precondition _ st' rel = \\wp => wp st' rel\n\nwp_is_weakest : HoareTriple p' c q -> (st : State) -> p' st -> WP c q st\nwp_is_weakest ht st p'_st = \\st', rel => ht st st' rel p'_st\n\nhoare_proof_complete : HoareTriple p c q -> HoareProof p c q\nhoare_proof_complete {c = CSkip} ht =\n h_consequence_post H_Skip (\\st, p_st => ht st st E_Skip p_st)\nhoare_proof_complete {c = (CAss x e)} ht =\n h_consequence_pre\n H_Ass (\\st, q_st => ht st (t_update x (aeval st e) st) (E_Ass Refl) q_st)\nhoare_proof_complete {q} {c = (CSeq c1 c2)} ht =\n H_Seq\n (hoare_proof_complete\n {c=c1} {q=WP c2 q}\n (\\st1, _, r1, p_st, st3, r2 => ht st1 st3 (E_Seq r1 r2) p_st))\n (hoare_proof_complete {c=c2} (\\_, st', rel, wp => wp st' rel))\nhoare_proof_complete {c = (CIf b ct cf)} ht =\n H_If\n (hoare_proof_complete\n (\\st, st', rel, (p_st, prf) => ht st st' (E_IfTrue prf rel) p_st))\n (hoare_proof_complete\n (\\st, st', rel, (p_st, contra) =>\n ht st st' (E_IfFalse (bassn_eval_false contra) rel) p_st))\nhoare_proof_complete {c = (CIf1 b c)} ht =\n H_If1\n (hoare_proof_complete\n (\\st, st', rel, (p_st, prf) => ht st st' (E_If1True prf rel) p_st))\n (\\st, (p_st, contra) =>\n ht st st (E_If1False (bassn_eval_false contra)) p_st)\nhoare_proof_complete {c = (CWhile b c)} {q} ht =\n H_Consequence\n {p'=WP (CWhile b c) q}\n (H_While\n (hoare_proof_complete {c=c} $ \\_, _, rel, (wp, prf), st'', rel' =>\n wp st'' (E_WhileLoop prf rel rel')))\n (\\st, p_st, st', rel => ht st st' rel p_st)\n (\\st, (wp, contra) => wp st (E_WhileEnd (bassn_eval_false contra)))\nhoare_proof_complete {c = f@(CFor init cond updt body)} {q} ht =\n H_Consequence\n {p'=WP (CFor init cond updt body) q}\n (H_For\n {q=WP (CWhile cond (do body; updt)) q}\n (hoare_proof_complete $ \\_, _, rel, wp, st'', rel' =>\n wp st'' (E_For rel rel'))\n (hoare_proof_complete\n {c=assert_smaller f (do body; updt)}\n (\\_, _, rel, (wp, prf), st'', rel' =>\n wp st'' (E_WhileLoop prf rel rel'))))\n (\\st, p_st, st', rel => ht st st' rel p_st)\n (\\st, (wp, contra) => wp st (E_WhileEnd (bassn_eval_false contra)))\nhoare_proof_complete {c = (CRepeat c b)} {q} ht =\n H_Consequence\n {p'=WP (CRepeat c b) q}\n (H_Repeat\n {q=WP (CWhile (not b) c) q}\n (hoare_proof_complete $\n \\_, _, rel, wp, st'', rel' => wp st'' (E_Repeat rel rel'))\n (\\st, (wp, contra), st', (E_Repeat r1 r2) =>\n let rel = snd (loop_unrolling {b=not b} {c=c} st st')\n (E_IfTrue (cong {f=not} (fst not_true_iff_false contra))\n (E_Seq r1 r2))\n in wp st' rel))\n (\\st, p_st, st', rel => ht st st' rel p_st)\n (\\st, (wp, prf) => wp st (E_WhileEnd (cong {f=not} prf)))\n", "meta": {"hexsha": "802b7278d2cbc115526f6a64c279937baad78e01", "size": 7955, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "HoareAsLogic.idr", "max_stars_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_stars_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "HoareAsLogic.idr", "max_issues_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_issues_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "HoareAsLogic.idr", "max_forks_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_forks_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 42.5401069519, "max_line_length": 80, "alphanum_fraction": 0.5948460088, "num_tokens": 2817, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6584175139669997, "lm_q2_score": 0.6039318337259583, "lm_q1q2_score": 0.39763929656737684}} {"text": "module FLK_bos\n\nimport Data.SortedMap\nimport FLK_ast\n\n\nmutual\n syntax \"[\" [ex1] \"=>>\" [ex2] \"]\" =\n ex1 >- _ `BigStep` ex2 >- _\n\n syntax \"[\" [ex1] \",\" [env1] \"=>>\" [ex2] \",\" [env2] \"]\" =\n ex1 >- env1 `BigStep` ex2 >- env2\n\n -- Big Step rules for FLK\n data BigStep : (CF a) -> (CF b) -> Type where\n DoneEv : {d : Exp Done} -> [d, e =>> d, e]\n\n Prim1Ev : [e =>> (B b)]\n -> [Prim1 Not e, env =>> B (not b), env]\n\n Prim2NEv : [e1 =>> (N n1)]\n -> [e2 =>> (N n2)]\n -> [(Prim2 o e1 e2), env =>> (N (arithOp o n1 n2)), env]\n\n Prim2REv : [e1 =>> (N n1)]\n -> [e2 =>> (N n2)]\n -> [(Prim2 o e1 e2), env =>> (B (relop o n1 n2)), env]\n\n Prim2Gen : {v1 : Exp Done} -> {v2 : Exp Done}\n -> [e1 =>> v1]\n -> [e2 =>> v2]\n -> [(Prim2 o e1 e2), env =>> genOp o v1 v2, env]\n IfTEv : [cond =>> (B True)]\n -> [t =>> v]\n -> [If cond t f, e =>> v, e]\n\n IfFEv : [cond =>> (B False)]\n -> [f =>> v]\n -> [If cond t f, e =>> v, e]\n\n IdValEv : {ident : Ident} -> {e : Env} -> {v : Exp Done}\n -> (v ** lookup ident e = Just $ Left v)\n -> [v, e =>> r, e']\n -> [Id ident, e =>> r, e']\n\n IdRecEv : {ident : Ident} -> {e : Env} -> {v : Exp RecLam}\n -> (v ** lookup ident e = Just $ Right v)\n -> [v, e =>> r, e']\n -> [Id ident, e =>> r, e']\n\n LamEv : [Abs x body, env =>> Clos env (Abs x body), env]\n\n RecEv : {env : Env} -> {ident : Ident} -> {body : Exp a}\n -> [body, (insert ident (Right $ Rec ident body) env) =>> v, env']\n -> [Rec ident body, env =>> v, env']\n\n AppEv : [func =>> (Clos e (Abs ident body))]\n -> [arg =>> argval]\n -> [body, (insert ident (Left $ argval) e) =>> v,e']\n -> [App func arg, e'' =>> v,e']\n\n instance Show (BigStep a b) where\n show DoneEv = \"DoneEv\"\n show (Prim1Ev z) = (show z) ++ \" -> PrimEv\"\n show (Prim2NEv w u) = (show w) ++ \" and \" ++ (show u) ++ \" -> \" ++ \"Prim2NEv\"\n show (Prim2REv w u) = (show w) ++ \" and \" ++ (show u) ++ \" -> \" ++ \"Prim2REv\"\n show (Prim2Gen w u) = (show w) ++ \" and \" ++ (show u) ++ \" -> \" ++ \"Prim2GEv\"\n show (IfTEv w x1) = (show w) ++ \" and \" ++ (show x1) ++ \" -> \" ++ \"IfTEv\"\n show (IfFEv w x1) = (show w) ++ \" and \" ++ (show x1) ++ \" -> \" ++ \"IfFEv\"\n show (IdValEv x y) = (show y) ++ \" -> IdValEv\"\n show (IdRecEv x y) = (show y) ++ \" -> IdRecEv\"\n show LamEv = \"LamEv\"\n show (RecEv x) = (show x) ++ \"-> RecEv\"\n show (AppEv s x1 y1) = (show s) ++ \" and \" ++ (show x1) ++ \" and \" ++ (show y1) ++ \" -> \" ++ \"AppEv\"\n\n transStr : (CF a) -> (CF b) -> String\n transStr c d = \"[\"++(show c)++\"] =>> [\"++(show d)++\"]\"\n\nprim2Lemma : (ot : OpTy) -> (op : Op2 ot) -> (e1 : Exp Done) -> (e2 : Exp Done)\n -> (tr1 : [e1' =>> e1]) -> (tr2 : [e2' =>> e2])\n -> (env : Env)\n -> Maybe (Sigma (CF Done) (\\res => Prim2 op e1' e2' >- env `BigStep` res))\nprim2Lemma Arith op (N k) (N j) tr1 tr2 y =\n Just ((N $ arithOp op k j) >- y ** Prim2NEv tr1 tr2)\nprim2Lemma Arith op e1 e2 tr1 tr2 y = Nothing\nprim2Lemma Rel op (N k) (N j) tr1 tr2 y =\n Just ((B $ relop op k j) >- y ** Prim2REv tr1 tr2)\nprim2Lemma Rel op e1 e2 tr1 tr2 y = Nothing\nprim2Lemma Gen op e1 e2 tr1 tr2 y = Just ((genOp op e1 e2) >- y ** Prim2Gen tr1 tr2)\nprim2Lemma Bool op e1 e2 tr1 tr2 y = Nothing\n\nmutual\n syntax \"[[\" [exp] \",\" [env] \"]]\" = evalCF (getTag exp) (exp >- env);\n\n evalCFI : (st : CF Inter) -> Maybe (Sigma (CF Done) (\\st' => st `BigStep` st'))\n evalCFI ((App x z) >- y) = do\n ((stateF >- yF) ** transF) <- [[x, y]]\n ((stateA >- yA) ** transA) <- [[z, y]]\n case stateF of\n (Clos env (Abs ident body)) => do\n ((stateRes >- yRes) ** transRes) <- [[body, (insert ident (Left $ stateA) env)]]\n pure $ ((stateRes >- yRes) ** AppEv transF transA transRes)\n otherwise => Nothing\n\n evalCFI ((If x z w) >- y) = do\n ((stateC >- _) ** transC) <- [[x, y]]\n case stateC of\n (B False) => do\n ((stateF >- _) ** transF) <- [[w, y]]\n pure (stateF >- y ** (IfFEv transC transF))\n (B True) => do\n ((stateT >- _) ** transT) <- [[z, y]]\n pure (stateT >- y ** (IfTEv transC transT))\n otherwise => Nothing\n\n evalCFI ((Prim1 Not z) >- y) = do\n ((state >- _) ** trans') <- [[z, y]]\n case state of\n (B b) => pure ((B $ not b) >- y ** (Prim1Ev trans'))\n otherwise => Nothing\n\n evalCFI ((Prim2 z w s) >- y) = do\n ((st1 >- _) ** tr1) <- [[w, y]]\n ((st2 >- _) ** tr2) <- [[s, y]]\n prim2Lemma (getOpT z) z st1 st2 tr1 tr2 y\n\n\n evalCFI ((Id x) >- y) with (idSteps x y)\n evalCFI ((Id x) >- y) | (Just (MkSigma z pf)) = do {\n ((st >- y') ** trans) <- [[z, y]];\n pure $ ((st >- y') ** (IdValEv (MkSigma z pf) trans))\n }\n evalCFI ((Id x) >- y) | Nothing with (idRecSteps x y)\n evalCFI ((Id x) >- y) | Nothing | Nothing = Nothing\n evalCFI ((Id x) >- y) | Nothing | (Just (MkSigma z pf)) = do {\n ((st >- y') ** trans) <- [[z, y]];\n pure $ ((st >- y') ** (IdRecEv (MkSigma z pf) trans))\n }\n\n\n evalCFD : (st : CF Done) -> (Sigma (CF Done) (\\st' => st `BigStep` st'))\n evalCFD (x >- z) = (x >- z ** DoneEv)\n\n evalCFL : (st : CF Lam) -> (Sigma (CF Done) (\\st' => st `BigStep` st'))\n evalCFL ((Abs x z) >- y) = ((Clos y (Abs x z)) >- y ** LamEv)\n\n evalCFR : (st : CF RecLam) -> Maybe (Sigma (CF Done) (\\st' => st `BigStep` st'))\n evalCFR ((Rec x z) >- y) = do\n ((stateN >- y') ** transN) <- [[z, (insert x (Right $ Rec x z) y)]]\n pure (stateN >- y' ** RecEv transN)\n\n evalCF : (s : Status) -> (st : CF s) -> Maybe (Sigma (CF Done) (\\st' => st `BigStep` st'))\n evalCF Inter st = evalCFI st\n evalCF Done st = Just $ evalCFD st\n evalCF Lam st = Just $ evalCFL st\n evalCF RecLam st = evalCFR st\n\nevalErase : (Exp s) -> Maybe (CF Done)\nevalErase x = [[x, emptyEnv]] >>= (\\ (cf ** _) => pure cf)\n\n\n", "meta": {"hexsha": "e9353456f423d14ba8f23960538207ed1009c5bc", "size": 5989, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "FLK_bos.idr", "max_stars_repo_name": "ezrosent/FLK-Semantics", "max_stars_repo_head_hexsha": "8198a567b2b96ee6658573e48359a195ba42151c", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 3, "max_stars_repo_stars_event_min_datetime": "2016-12-21T09:46:31.000Z", "max_stars_repo_stars_event_max_datetime": "2016-12-21T15:37:59.000Z", "max_issues_repo_path": "FLK_bos.idr", "max_issues_repo_name": "ezrosent/FLK-Semantics", "max_issues_repo_head_hexsha": "8198a567b2b96ee6658573e48359a195ba42151c", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "FLK_bos.idr", "max_forks_repo_name": "ezrosent/FLK-Semantics", "max_forks_repo_head_hexsha": "8198a567b2b96ee6658573e48359a195ba42151c", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 36.9691358025, "max_line_length": 104, "alphanum_fraction": 0.4608448823, "num_tokens": 2306, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7310585903489891, "lm_q2_score": 0.5428632831725052, "lm_q1q2_score": 0.39686486654831576}} {"text": "data Format = Number Format\n | Str Format\n | Character Format\n | Decimal Format\n | Lit String Format\n | End\n\n\nPrintfType : Format -> Type\nPrintfType (Number fmt) = (i:Int) -> PrintfType fmt\nPrintfType (Str fmt) = (s:String) -> PrintfType fmt\nPrintfType (Character fmt) = (c:Char) -> PrintfType fmt\nPrintfType (Decimal fmt) = (d:Double) -> PrintfType fmt\nPrintfType (Lit str fmt) = PrintfType fmt\nPrintfType End = String\n\n\nprintfFmt : (fmt : Format) -> (acc : String) -> PrintfType fmt\nprintfFmt (Number fmt) acc = \\i => printfFmt fmt (acc ++ show i)\nprintfFmt (Str fmt) acc = \\s => printfFmt fmt (acc ++ s)\nprintfFmt (Character fmt) acc = \\c => printfFmt fmt (acc ++ show c)\nprintfFmt (Decimal fmt) acc = \\d => printfFmt fmt (acc ++ show d)\nprintfFmt (Lit lit fmt) acc = printfFmt fmt (acc ++ lit)\nprintfFmt End acc = acc\n\ntoFormat : (xs : List Char) -> Format\ntoFormat [] = End\ntoFormat ('%' :: 'd' :: chars) = Number (toFormat chars)\ntoFormat ('%' :: 's' :: chars) = Str (toFormat chars)\ntoFormat ('%' :: 'c' :: chars) = Character (toFormat chars)\ntoFormat ('%' :: 'f' :: chars) = Decimal (toFormat chars)\ntoFormat (c :: chars) = case toFormat chars of\n Lit lit chars' => Lit (strCons c lit) chars'\n fmt => Lit (strCons c \"\") fmt\n\nprintf : (fmt : String) -> PrintfType (toFormat (unpack fmt))\nprintf fmt = printfFmt _ \"\"\n", "meta": {"hexsha": "955499099dd434f3792fe6e3c61bceeb0b543ee1", "size": 1434, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "format.idr", "max_stars_repo_name": "janschultecom/idris-examples", "max_stars_repo_head_hexsha": "c0bf0105d69f07492c6b99f14e9ca3c4cd7443c8", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2016-05-05T15:26:06.000Z", "max_stars_repo_stars_event_max_datetime": "2016-05-05T15:26:06.000Z", "max_issues_repo_path": "format.idr", "max_issues_repo_name": "janschultecom/idris-examples", "max_issues_repo_head_hexsha": "c0bf0105d69f07492c6b99f14e9ca3c4cd7443c8", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "format.idr", "max_forks_repo_name": "janschultecom/idris-examples", "max_forks_repo_head_hexsha": "c0bf0105d69f07492c6b99f14e9ca3c4cd7443c8", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 37.7368421053, "max_line_length": 73, "alphanum_fraction": 0.6073919107, "num_tokens": 398, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6370307944803831, "lm_q2_score": 0.6224593312018546, "lm_q1q2_score": 0.39652576228724534}} {"text": "public export\ndata Phase = Gas | Liquid | Solid\n\npublic export\ndata ChangePhase : Phase -> Phase -> Type where\n\tSequence : ChangePhase a b -> ChangePhase b c -> ChangePhase a c\n\tCondense : ChangePhase Gas Liquid\n\tFreeze : ChangePhase Liquid Solid\n\tMelt : ChangePhase Solid Liquid\n\tVaporize : ChangePhase Liquid Gas\n\tSublimate : ChangePhase Solid Gas\n\npublic export\ninferred : { auto transition : ChangePhase l r } -> ChangePhase l r\ninferred { transition } = transition\n\ntest : ChangePhase Gas Solid\ntest = inferred\n", "meta": {"hexsha": "bc61cc23def9cefc5bac43a19cf6668824acbfb0", "size": 516, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris2/tests/idris2/perf003/Auto.idr", "max_stars_repo_name": "Qqwy/Idris2-Erlang", "max_stars_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 396, "max_stars_repo_stars_event_min_datetime": "2016-07-17T08:00:45.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-21T22:47:13.000Z", "max_issues_repo_path": "idris2/tests/idris2/perf003/Auto.idr", "max_issues_repo_name": "Qqwy/Idris2-Erlang", "max_issues_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 54, "max_issues_repo_issues_event_min_datetime": "2016-08-04T06:13:36.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-03T04:00:31.000Z", "max_forks_repo_path": "idris2/tests/idris2/perf003/Auto.idr", "max_forks_repo_name": "Qqwy/Idris2-Erlang", "max_forks_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 28, "max_forks_repo_forks_event_min_datetime": "2016-09-15T15:19:03.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-27T13:05:48.000Z", "avg_line_length": 27.1578947368, "max_line_length": 67, "alphanum_fraction": 0.753875969, "num_tokens": 129, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.6859494550081926, "lm_q2_score": 0.5774953651858118, "lm_q1q2_score": 0.3961326310189648}} {"text": "module Quantities.NonSIUnits\n\nimport Quantities.FreeAbelianGroup\nimport Quantities.Core\nimport Quantities.SIBaseQuantities\nimport Quantities.SIDerivedQuantities\nimport Quantities.SIPrefixes\nimport Quantities.SIBaseUnits\nimport Quantities.SIDerivedUnits\n\n%default total\n%access public export\n\n\n-- Based on http://en.wikipedia.org/wiki/Non-SI_units_mentioned_in_the_SI\n\nMinute : ElemUnit Time\nMinute = < one \"min\" equals 60 Second >\nMin : ElemUnit Time\nMin = Minute\n\nHour : ElemUnit Time\nHour = < one \"h\" equals 60 Minute >\nH : ElemUnit Time\nH = Hour\n\nDay : ElemUnit Time\nDay = < one \"d\" equals 24 Hour >\nD : ElemUnit Time\nD = Day\n\nWeek : ElemUnit Time\nWeek = < one \"week\" equals 7 Day >\n\n-- Julian year\nYear : ElemUnit Time\nYear = < one \"a\" equals 365.25 Day >\nJulianYear : ElemUnit Time\nJulianYear = Year\nA : ElemUnit Time\nA = Year\n\nCentury : Unit Time\nCentury = hecto Year\n\nMillenium : Unit Time\nMillenium = kilo Year\n\nTonne : ElemUnit Mass\nTonne = < one \"t\" equals 1000 Kg >\nT : ElemUnit Mass\nT = Tonne\n\nDegree : ElemUnit PlaneAngle\nDegree = < one \"deg\" equals (pi / 180) Rad >\nDeg : ElemUnit PlaneAngle\nDeg = Degree\n\nArcmin : ElemUnit PlaneAngle\nArcmin = < one \"arcmin\" equals (1/60) Degree >\n\nArcsec : ElemUnit PlaneAngle\nArcsec = < one \"arcsec\" equals (1/60) Arcmin >\n\n-- Ångström (Å)\nAngstrom : ElemUnit Length\nAngstrom = < one \"angstrom\" equals 0.1 (nano Metre) >\n\nAstronomicalUnit : ElemUnit Length\nAstronomicalUnit = < one \"au\" equals 149597870700 Metre >\nAu : ElemUnit Length\nAu = AstronomicalUnit\n\nStandardGravity : ElemUnit Acceleration\n--StandardGravity = < one \"g_0\" equals 9.80665 (Metre (Second ^^ 2)) >\nStandardGravity = defineAsMultipleOf \"g_0\" 9.80665 (Metre (Second ^^ 2))\nG_0 : ElemUnit Acceleration\nG_0 = StandardGravity\n\nRotationsPerMinute : Unit Frequency\nRotationsPerMinute = One Minute\nRpm : Unit Frequency\nRpm = RotationsPerMinute\n\n-- Use this only for relative temparature! Not suitable for conversions of\n-- absolute temperature!\n\nFahrenheit : ElemUnit Temperature\nFahrenheit = < one \"dF\" equals (5/9) K > -- °F\nDF : ElemUnit Temperature\nDF = Fahrenheit\n\nAre : ElemUnit Area\nAre = < one \"are\" equals 100 (Metre ^^ 2) >\n\nHectare : ElemUnit Area\nHectare = < one \"ha\" equals 1 ((hecto Metre) ^^ 2) >\nHa : ElemUnit Area\nHa = Hectare\n\nBarn : ElemUnit Area\nBarn = < one \"b\" equals 100 ((femto Metre) ^^ 2) >\nB : ElemUnit Area\nB = Barn\n\nLitre : ElemUnit Volume\nLitre = < one \"l\" equals 1 (milli (Metre ^^ 3)) >\nLiter : ElemUnit Volume\nLiter = Litre\nL : ElemUnit Volume\nL = Litre\n\nBar : ElemUnit Pressure\nBar = < one \"bar\" equals 100 (kilo Pascal) >\n\nMillimetreOfMercury : ElemUnit Pressure\nMillimetreOfMercury = < one \"mmHg\" equals 133.322 Pascal >\nMmHg : ElemUnit Pressure\nMmHg = MillimetreOfMercury\n\nCalorie : ElemUnit Energy\nCalorie = < one \"cal\" equals 4.18400 Joule >\nThermochemicalCalorie : ElemUnit Energy\nThermochemicalCalorie = Calorie\nCal : ElemUnit Energy\nCal = Calorie\n\n\n-- Non-SI units whose values in SI must be determined experimentally\n\nElectronvolt : ElemUnit Energy\nElectronvolt = < one \"eV\" equals 1.60217653 (Ten ^^ -19 <**> Joule) >\nEV : ElemUnit Energy\nEV = Electronvolt\n\nDalton : ElemUnit Mass\nDalton = < one \"Da\" equals 1.66053886 (Ten ^^ -27 <**> Kilogram) >\nDa : ElemUnit Mass\nDa = Dalton\nUnifiedAtomicMassUnit : ElemUnit Mass\nUnifiedAtomicMassUnit = Dalton\nU : ElemUnit Mass\nU = Dalton\n\n-- Atomic and natural units\n\nElementaryCharge : ElemUnit ElectricCharge\nElementaryCharge = < one \"e\" equals 1.60217653 (Ten ^^ -19 <**> Coulomb) >\nE : ElemUnit ElectricCharge\nE = ElementaryCharge\n\nMassOfElectron : ElemUnit Mass\nMassOfElectron = < one \"m_e\" equals 9.1093826 (Ten ^^ -31 <**> Kilogram) >\nElectronMass : ElemUnit Mass\nElectronMass = MassOfElectron\nM_e : ElemUnit Mass\nM_e = MassOfElectron\n\nBohrRadius : ElemUnit Length\nBohrRadius = < one \"a_0\" equals 0.5291772108 (Ten ^^ -10 <**> Metre) >\nBohr : ElemUnit Length\nBohr = BohrRadius\nA_0 : ElemUnit Length\nA_0 = BohrRadius\n\nHartreeEnergy : ElemUnit Energy\nHartreeEnergy = < one \"E_h\" equals 4.35974417 (Ten ^^ -18 <**> Joule) >\nHartree : ElemUnit Energy\nHartree = HartreeEnergy\nE_h : ElemUnit Energy\nE_h = HartreeEnergy\n\nPlanckConstant : ElemUnit (Energy <*> Time)\nPlanckConstant = < one \"h\" equals 6.62606957 (Joule <**> Second) >\nH_ : ElemUnit (Energy <*> Time)\nH_ = PlanckConstant\n\nReducedPlanckConstant : ElemUnit (Energy <*> Time)\nReducedPlanckConstant = < one \"hBar\" equals (1 / (2*pi)) (Joule <**> Second) >\nHBar : ElemUnit (Energy <*> Time)\nHBar = ReducedPlanckConstant\n\nAtomicUnitOfTime : ElemUnit Time\nAtomicUnitOfTime = < one \"auOfTime\" equals 1 (HBar Hartree) >\nAuOfTime : ElemUnit Time\nAuOfTime = AtomicUnitOfTime\n\nSpeedOfLight : ElemUnit Speed\nSpeedOfLight = < one \"c_0\" equals 299792458 (Metre Second) >\nC_0 : ElemUnit Speed\nC_0 = SpeedOfLight\n\nNaturalUnitOfTime : ElemUnit Time\nNaturalUnitOfTime = < one \"nuOfTime\" equals 1 (HBar (M_e <**> (C_0 ^^ 2))) >\nNuOfTime : ElemUnit Time\nNuOfTime = NaturalUnitOfTime\n\nLightSecond : ElemUnit Length\nLightSecond = < one \"ls\" equals 1 (Second <**> SpeedOfLight) >\nLs : ElemUnit Length\nLs = LightSecond\n\nLightMinute : ElemUnit Length\nLightMinute = < one \"lmin\" equals 1 (Minute <**> SpeedOfLight) >\nLmin : ElemUnit Length\nLmin = LightMinute\n\nLightHour : ElemUnit Length\nLightHour = < one \"lh\" equals 1 (Hour <**> SpeedOfLight) >\nLh : ElemUnit Length\nLh = LightHour\n\nLightDay : ElemUnit Length\nLightDay = < one \"ld\" equals 1 (Day <**> SpeedOfLight) >\nLd : ElemUnit Length\nLd = LightDay\n\nLightWeek : ElemUnit Length\nLightWeek = < one \"ld\" equals 1 (Week <**> SpeedOfLight) >\nLw : ElemUnit Length\nLw = LightWeek\n\nLightYear : ElemUnit Length\nLightYear = < one \"ly\" equals 1 (Year <**> SpeedOfLight) >\nLy : ElemUnit Length\nLy = LightYear\n\n\n-- Non-SI units associated with the CGS and the CGS-Gaussian system of units\n\nErg : Unit Energy\nErg = Ten ^^ -7 <**> Joule\n\nDyne : Unit Force'\nDyne = Ten ^^ -5 <**> Newton\nDyn : Unit Force'\nDyn = Dyne\n\nPoise : Unit DynamicViscosity\nPoise = Dyne <**> Second (Centimetre ^^ 2)\nP : Unit DynamicViscosity\nP = Poise\n\nStokes : Unit KinematicViscosity\nStokes = Centimetre ^^ 2 Second\nSt : Unit KinematicViscosity\nSt = Stokes\n\nStilb : Unit Luminance\nStilb = Candela (Centimetre ^^ 2)\nSb : Unit Luminance\nSb = Stilb\n\nPhot : Unit Illuminance\nPhot = Candela <**> Steradian (Centimetre ^^ 2)\nPh : Unit Illuminance\nPh = Phot\n\nGal : Unit Acceleration\nGal = Centimetre (Second ^^ 2)\n\nMaxwell : Unit MagneticFlux\nMaxwell = Ten ^^ -8 <**> Weber\nMx : Unit MagneticFlux\nMx = Maxwell\n\nGauss : Unit MagneticFluxDensity\nGauss = Maxwell (Centimetre ^^ 2)\nG : Unit MagneticFluxDensity\nG = Gauss\n\nOersted : ElemUnit MagneticFieldStrength\nOersted = < one \"oe\" equals (250 / pi) (Ampere Metre) >\nOe : ElemUnit MagneticFieldStrength\nOe = Oersted", "meta": {"hexsha": "e189ba6418b5fbfcb15fcef93dd9c4acd47d57d9", "size": 6768, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Quantities/NonSIUnits.idr", "max_stars_repo_name": "timjb/quantities", "max_stars_repo_head_hexsha": "140357c3ec06e5b29b5d369cb59f1f5925f000a5", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 112, "max_stars_repo_stars_event_min_datetime": "2015-01-18T13:52:27.000Z", "max_stars_repo_stars_event_max_datetime": "2021-11-08T14:15:46.000Z", "max_issues_repo_path": "Quantities/NonSIUnits.idr", "max_issues_repo_name": "timjb/quantities", "max_issues_repo_head_hexsha": "140357c3ec06e5b29b5d369cb59f1f5925f000a5", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 7, "max_issues_repo_issues_event_min_datetime": "2015-11-04T08:51:41.000Z", "max_issues_repo_issues_event_max_datetime": "2018-04-17T09:52:29.000Z", "max_forks_repo_path": "Quantities/NonSIUnits.idr", "max_forks_repo_name": "timjb/quantities", "max_forks_repo_head_hexsha": "140357c3ec06e5b29b5d369cb59f1f5925f000a5", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 9, "max_forks_repo_forks_event_min_datetime": "2015-04-28T23:49:30.000Z", "max_forks_repo_forks_event_max_datetime": "2021-09-01T17:28:34.000Z", "avg_line_length": 24.6109090909, "max_line_length": 81, "alphanum_fraction": 0.7191193853, "num_tokens": 2204, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6992544085240401, "lm_q2_score": 0.5660185351961015, "lm_q1q2_score": 0.3957909560421935}} {"text": "module TypedContainers.RBTree.Index\n\nimport Data.Nat\nimport Data.DPair\nimport Data.List\nimport TypedContainers.In\nimport TypedContainers.LawfulOrd\nimport TypedContainers.RBTree.Base\n\n%default total\n\npublic export\ndata Erased : Type -> Type where\n MkErased : (0 _ : a) -> Erased a\n\n0 helper : LawfulOrd a => (x : a) -> (y : a) -> (z : a) -> (x > y = True) -> (y == z = True) -> (x > z = True)\nhelper x y z p1 p2 =\n let p1' = convGT x y p1 in\n let p2' = convEQ y z p2 in\n let p3 = equality2 y z x p2' in\n let p4 : (compare x z = GT) = replace {p = \\arg => arg = GT} p3 p1' in\n cong (\\case {GT => True; _ => False}) p4\n\npublic export\nindexG : {0 keys : List kt} -> {kord : LawfulOrd kt} -> (k : kt) -> {0 k_in_keys : In (k ==) keys} -> GoodTree {kt, kord, keys, vt} -> Exists $ \\k' => Exists $ \\_ : compare k' k = EQ => vt k'\nindexG k (Empty Refl) impossible\nindexG k (RedNode k' v l r) = case the (Subset Ordering (compare k' k ===)) $ Element (compare k' k) Refl of\n Element EQ p0 => Evidence k' $ Evidence p0 v\n Element GT p0 =>\n let 0 p1 = \\x, p => helper k' k x (cong (\\case {GT => True; _ => False}) p0) p in\n let 0 p2 : In (k ==) (filter (k' >) keys) = inFilter (k' >) (k ==) p1 keys k_in_keys in\n indexG k l {k_in_keys = p2}\n Element LT p0 =>\n let 0 p1 = \\x, p => ( let p1' = replace {p = \\arg => arg = LT} (equality2 k x k' (convEQ k x p)) p0 in let p1'' = cong (\\case {LT => True; _ => False}) p1' in the (k' < x = True) p1'' ) in\n let 0 p2 : In (k ==) (filter (k' <) keys) = inFilter (k' <) (k ==) p1 keys k_in_keys in\n indexG k r {k_in_keys = p2}\nindexG k (BlackNode k' v l r) = case the (Subset Ordering (compare k' k ===)) $ Element (compare k' k) Refl of\n Element EQ p0 => Evidence k' $ Evidence p0 v\n Element GT p0 =>\n let 0 p1 = \\x, p => helper k' k x (cong (\\case {GT => True; _ => False}) p0) p in\n let 0 p2 : In (k ==) (filter (k' >) keys) = inFilter (k' >) (k ==) p1 keys k_in_keys in\n indexG k l {k_in_keys = p2}\n Element LT p0 =>\n let 0 p1 = \\x, p => ( let p1' = replace {p = \\arg => arg = LT} (equality2 k x k' (convEQ k x p)) p0 in let p1'' = cong (\\case {LT => True; _ => False}) p1' in the (k' < x = True) p1'' ) in\n let 0 p2 : In (k ==) (filter (k' <) keys) = inFilter (k' <) (k ==) p1 keys k_in_keys in\n indexG k r {k_in_keys = p2}\n\npublic export\nindexGMaybe : {0 b : kt -> Type} -> {0 keys : List kt} -> {kord : LawfulOrd kt} -> (k : kt)\n -> {0 foldLeft : (Not $ In (k ==) keys) -> a}\n -> {0 foldRight : (k' : kt) -> (compare k' k = EQ, In (k' ==) keys) -> b k'}\n -> GoodTree {kt, kord, keys, vt}\n -> Either (Erased $ a) (DPair kt $ \\k' => Exists $ \\_ : b k' => vt k')\nindexGMaybe k (Empty Refl) = Left $ MkErased $ foldLeft $ \\p => case p of\n MkIn _ _ _ impossible\n MkInCons _ _ _ impossible\nindexGMaybe k (RedNode k' v l r {kp}) = case the (Subset Ordering (compare k' k ===)) $ Element (compare k' k) Refl of\n Element EQ p0 => Right $ MkDPair k' $ Evidence (foldRight k' (p0, kp)) v\n Element GT p0 =>\n let\n 0 p1 : (x : kt) -> (k == x = True) -> (k' > x = True)\n p1 x pp0 = cong (\\case { GT => True; _ => False }) $ sym $ trans (sym p0) (equality2 k x k' (convEQ k x pp0))\n\n 0 foldLeft' : (In (k ==) (filter (k' >) keys) -> Void) -> a\n foldLeft' pp0 = foldLeft $ \\pp1 => pp0 $ inFilter (k' >) (k ==) p1 keys pp1\n\n 0 foldRight' : (k'' : kt) -> (compare k'' k = EQ, In (k'' ==) (filter (k' >) keys)) -> b k''\n foldRight' k'' (pp0, pp1) = foldRight k'' (pp0, outFilter pp1)\n in\n indexGMaybe k {foldLeft = foldLeft', foldRight = foldRight'} l\n Element LT p0 =>\n let\n 0 p1 : (x : kt) -> (k == x = True) -> (k' < x = True)\n p1 x pp0 = cong (\\case { LT => True; _ => False }) $ sym $ trans (sym p0) (equality2 k x k' (convEQ k x pp0))\n\n 0 foldLeft' : (In (k ==) (filter (k' <) keys) -> Void) -> a\n foldLeft' pp0 = foldLeft $ \\pp1 => pp0 $ inFilter (k' <) (k ==) p1 keys pp1\n\n 0 foldRight' : (k'' : kt) -> (compare k'' k = EQ, In (k'' ==) (filter (k' <) keys)) -> b k''\n foldRight' k'' (pp0, pp1) = foldRight k'' (pp0, outFilter pp1)\n in\n indexGMaybe k {foldLeft = foldLeft', foldRight = foldRight'} r\nindexGMaybe k (BlackNode k' v l r {kp}) = case the (Subset Ordering (compare k' k ===)) $ Element (compare k' k) Refl of\n Element EQ p0 => Right $ MkDPair k' $ Evidence (foldRight k' (p0, kp)) v\n Element GT p0 =>\n let\n 0 p1 : (x : kt) -> (k == x = True) -> (k' > x = True)\n p1 x pp0 = cong (\\case { GT => True; _ => False }) $ sym $ trans (sym p0) (equality2 k x k' (convEQ k x pp0))\n\n 0 foldLeft' : (In (k ==) (filter (k' >) keys) -> Void) -> a\n foldLeft' pp0 = foldLeft $ \\pp1 => pp0 $ inFilter (k' >) (k ==) p1 keys pp1\n\n 0 foldRight' : (k'' : kt) -> (compare k'' k = EQ, In (k'' ==) (filter (k' >) keys)) -> b k''\n foldRight' k'' (pp0, pp1) = foldRight k'' (pp0, outFilter pp1)\n in\n indexGMaybe k {foldLeft = foldLeft', foldRight = foldRight'} l\n Element LT p0 =>\n let\n 0 p1 : (x : kt) -> (k == x = True) -> (k' < x = True)\n p1 x pp0 = cong (\\case { LT => True; _ => False }) $ sym $ trans (sym p0) (equality2 k x k' (convEQ k x pp0))\n\n 0 foldLeft' : (In (k ==) (filter (k' <) keys) -> Void) -> a\n foldLeft' pp0 = foldLeft $ \\pp1 => pp0 $ inFilter (k' <) (k ==) p1 keys pp1\n\n 0 foldRight' : (k'' : kt) -> (compare k'' k = EQ, In (k'' ==) (filter (k' <) keys)) -> b k''\n foldRight' k'' (pp0, pp1) = foldRight k'' (pp0, outFilter pp1)\n in\n indexGMaybe k {foldLeft = foldLeft', foldRight = foldRight'} r\n", "meta": {"hexsha": "2117367ff31f1dbf101d49719e75f50844c83bfa", "size": 5544, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "TypedContainers/RBTree/Index.idr", "max_stars_repo_name": "L-as/idris-rbtree", "max_stars_repo_head_hexsha": "1c9bab3c5f54ab431c379bf54cec5b548e09f0d3", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 3, "max_stars_repo_stars_event_min_datetime": "2021-08-25T15:48:22.000Z", "max_stars_repo_stars_event_max_datetime": "2022-01-10T05:31:53.000Z", "max_issues_repo_path": "TypedContainers/RBTree/Index.idr", "max_issues_repo_name": "L-as/idris-rbtree", "max_issues_repo_head_hexsha": "1c9bab3c5f54ab431c379bf54cec5b548e09f0d3", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "TypedContainers/RBTree/Index.idr", "max_forks_repo_name": "L-as/idris-rbtree", "max_forks_repo_head_hexsha": "1c9bab3c5f54ab431c379bf54cec5b548e09f0d3", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 50.8623853211, "max_line_length": 192, "alphanum_fraction": 0.542027417, "num_tokens": 2141, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7853085808877581, "lm_q2_score": 0.5039061705290805, "lm_q1q2_score": 0.39572183967877683}} {"text": "import Data.Vect\nimport Data.Vect.Elem\nimport Decidable.Equality\nimport Data.String\nimport RemoveElem\n\ndata WordState : (guesses_remaining : Nat) -> (letters : Nat) -> Type where\n MkWordState : (word : String) ->\n (missing : Vect letters Char) ->\n WordState guesses_remaining letters\n\ndata Finished : Type where\n Lost : (game : WordState 0 (S letters)) -> Finished\n Won : (game : WordState (S guesses) 0) -> Finished\n\ndata ValidInput : List Char -> Type where\n Letter : (c : Char) -> ValidInput [c]\n\n-- proofs\nisValidInput : (cs : List Char) -> Dec (ValidInput cs)\nisValidInput [] = No isValidNil where\n isValidNil : ValidInput [] -> Void\n isValidNil (Letter c) impossible \nisValidInput (x :: []) = Yes (Letter x)\nisValidInput (x :: (y :: xs)) = No isValidTooLong where\n isValidTooLong : ValidInput (x :: y :: xs) -> Void\n isValidTooLong (Letter _ ) impossible\n\nisValidString : (s : String) -> Dec (ValidInput (unpack s))\nisValidString s = isValidInput (unpack s)\n\n-- game logic\nreadGuess : IO (x ** ValidInput x)\nreadGuess = do putStr \"Guess: \"\n x <- getLine\n case isValidString (toUpper x) of\n Yes prf => pure (_ ** prf)\n No contra => do putStrLn \"Invalid guess\"\n readGuess\n\nprocessGuess : {letters : _} ->\n (letter : Char) -> \n WordState (S guesses) (S letters) ->\n Either (WordState guesses (S letters))\n (WordState (S guesses) letters)\nprocessGuess letter (MkWordState word missing) = case isElem letter missing of\n Yes prf => Right (MkWordState word (removeElem letter missing))\n No contra => Left (MkWordState word missing)\n\ngame : {guesses : _} -> {letters : _} -> WordState (S guesses) (S letters) -> IO Finished\ngame st = do (_ ** Letter letter) <- readGuess\n case processGuess letter st of\n Left l => do putStrLn \"Wrong!\"\n case guesses of\n 0 => pure (Lost l)\n (S k) => game l\n Right r => do putStrLn \"Right!\"\n case letters of\n 0 => pure (Won r)\n (S k) => game r\n\nmain : IO ()\nmain = do result <- game {guesses = 2} (MkWordState \"Test\" ['T', 'E', 'S'])\n case result of\n Lost (MkWordState word missing) => putStrLn (\"You lost. The word was \" ++ word)\n Won (MkWordState word missing) => putStrLn (\"You won! The word was \" ++ word)", "meta": {"hexsha": "6c3b065092a4b377937ce0251834a82d170822af", "size": 2856, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/ch9/Hangman.idr", "max_stars_repo_name": "trevarj/tdd_idris_examples", "max_stars_repo_head_hexsha": "63a7128a797b64cb0ba54562778cdf9712b4d9f5", "max_stars_repo_licenses": ["Unlicense"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "src/ch9/Hangman.idr", "max_issues_repo_name": "trevarj/tdd_idris_examples", "max_issues_repo_head_hexsha": "63a7128a797b64cb0ba54562778cdf9712b4d9f5", "max_issues_repo_licenses": ["Unlicense"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/ch9/Hangman.idr", "max_forks_repo_name": "trevarj/tdd_idris_examples", "max_forks_repo_head_hexsha": "63a7128a797b64cb0ba54562778cdf9712b4d9f5", "max_forks_repo_licenses": ["Unlicense"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 43.2727272727, "max_line_length": 117, "alphanum_fraction": 0.5087535014, "num_tokens": 636, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7718434978390747, "lm_q2_score": 0.5117166047041654, "lm_q1q2_score": 0.3949651340771981}} {"text": "module ContT\n\nimport Control.Monad.Identity\nimport Control.Monad.Trans\n\n%access public export\n\ndata ContT : (r : Type) -> (m : Type -> Type) -> (a : Type) -> Type where\n ContK : ((a -> m r) -> m r) -> ContT r m a\n\nCont : Type -> Type -> Type\nCont r a = ContT r Identity a\n\nFunctor (ContT r m) where\n map f (ContK c) = ContK (\\k => c (\\a => k (f a)))\n\nApplicative (ContT r m) where\n pure a = ContK (\\k => k a)\n (ContK cf) <*> (ContK c) = ContK (\\k => c (\\a => cf (\\f => k (f a))))\n\nMonad (ContT r m) where\n (ContK c) >>= f = ContK (\\k => c (\\a => let (ContK k') = f a in k' k))\n\nMonadTrans (ContT r) where\n lift x = ContK (\\k => x >>= k)\n\n\nrun : (a -> m r) -> ContT r m a -> m r\nrun f (ContK c) = c f\n\nreset : Monad m => ContT r m r -> m r\nreset (ContK c) = c (\\x => pure x)\n\nshift : Monad m => ((a -> m r) -> ContT r m r) -> ContT r m a\nshift f = ContK (\\k => reset (f k))\n\ncallCC : ((a -> ContT r m b) -> ContT r m a) -> ContT r m a\ncallCC f = ContK (\\k => let (ContK c) = f (\\a => ContK (\\k' => k a)) in c k)\n", "meta": {"hexsha": "fb10e346ce9cf3eaedf044c2d8ace449974423a8", "size": 1017, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/ContT.idr", "max_stars_repo_name": "STELIORD/idris-snippets", "max_stars_repo_head_hexsha": "f5ca6fa86370d24587040af9871ae850bbc630c2", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2017-11-21T22:28:51.000Z", "max_stars_repo_stars_event_max_datetime": "2020-10-05T18:25:18.000Z", "max_issues_repo_path": "src/ContT.idr", "max_issues_repo_name": "stjordanis/idris-snippets", "max_issues_repo_head_hexsha": "d92734b8624ae27be21a63fcb041077b38eaaecb", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/ContT.idr", "max_forks_repo_name": "stjordanis/idris-snippets", "max_forks_repo_head_hexsha": "d92734b8624ae27be21a63fcb041077b38eaaecb", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-05-06T13:39:44.000Z", "max_forks_repo_forks_event_max_datetime": "2020-10-21T15:39:16.000Z", "avg_line_length": 26.0769230769, "max_line_length": 76, "alphanum_fraction": 0.5280235988, "num_tokens": 388, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6926419958239132, "lm_q2_score": 0.5698526514141572, "lm_q1q2_score": 0.39470387780105054}} {"text": "module Main\n\ndata State : (stateType : Type) -> Type -> Type where\n Get : State stateType stateType\n Put : stateType -> State stateType ()\n\n Pure : ty -> State stateType ty\n Bind : State stateType a -> (a -> State stateType b) -> State stateType b\n\n(>>=) : State stateType a -> (a -> State stateType b) -> State stateType b\n(>>=) = Bind\n\nrunState : State stateType a -> (st : stateType) -> (a, stateType)\nrunState Get st = (st, st)\nrunState (Put newState) st = ((), newState)\nrunState (Pure x) st = (x, st)\nrunState (Bind cmd prog) st =\n let (val, nextState) = runState cmd st\n in runState (prog val) nextState\n\nFunctor (State stateType) where\n map func x = Bind x (\\val => Pure (func val))\n\nApplicative (State stateType) where\n pure = Pure\n (<*>) f a =\n Bind f (\\f' =>\n Bind a (\\a' =>\n Pure (f' a')))\n\nMonad (State stateType) where\n (>>=) = Bind\n\ndata Tree a = Empty\n | Node (Tree a) a (Tree a)\n\nShow a => Show (Tree a) where\n show Empty = \"Empty\"\n show (Node left val right) = \"(Node \" ++ show left ++ \" \" ++ show val ++ \" \" ++ show right ++ \")\"\n\ntestTree : Tree String\ntestTree = Node (Node (Node Empty \"Jim\" Empty)\n \"Fred\"\n (Node Empty \"Sheila\" Empty))\n \"Alice\"\n (Node Empty \"Bob\" (Node Empty \"Eve\" Empty))\n\ntreeLabelWith : Tree a -> State (Stream labelType) (Tree (labelType, a))\ntreeLabelWith Empty = Pure Empty\ntreeLabelWith (Node left val right) = do\n leftLabelled <- treeLabelWith left\n (this :: rest) <- Get\n Put rest\n rightLabelled <- treeLabelWith right\n Pure (Node leftLabelled (this, val) rightLabelled)\n\ntreeLabel : Tree a -> Tree (Integer, a)\ntreeLabel tree = fst (runState (treeLabelWith tree) [1..])\n\nmain : IO ()\nmain = do\n printLn $ treeLabel testTree\n", "meta": {"hexsha": "11928f823f25ed0f4e0ebd891ef1ba0634892958", "size": 1811, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "test/tdd/chapter12/05_TreeLabelType.idr", "max_stars_repo_name": "luc-tielen/idris-grin", "max_stars_repo_head_hexsha": "b259e8861a2a5f66ebf9a545e6d9620b3f0ec969", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 36, "max_stars_repo_stars_event_min_datetime": "2019-06-06T10:35:31.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-21T08:48:30.000Z", "max_issues_repo_path": "test/tdd/chapter12/05_TreeLabelType.idr", "max_issues_repo_name": "luc-tielen/idris-grin", "max_issues_repo_head_hexsha": "b259e8861a2a5f66ebf9a545e6d9620b3f0ec969", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 4, "max_issues_repo_issues_event_min_datetime": "2019-11-21T20:45:22.000Z", "max_issues_repo_issues_event_max_datetime": "2022-02-02T12:29:23.000Z", "max_forks_repo_path": "test/tdd/chapter12/05_TreeLabelType.idr", "max_forks_repo_name": "luc-tielen/idris-grin", "max_forks_repo_head_hexsha": "b259e8861a2a5f66ebf9a545e6d9620b3f0ec969", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-06-14T13:14:47.000Z", "max_forks_repo_forks_event_max_datetime": "2019-12-07T06:20:45.000Z", "avg_line_length": 28.746031746, "max_line_length": 99, "alphanum_fraction": 0.602981778, "num_tokens": 532, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6926419704455589, "lm_q2_score": 0.5698526514141571, "lm_q1q2_score": 0.39470386333912794}} {"text": "import Data.Vect\n\ninfixr 5 .+.\n\ndata Schema = SString\n | SInt\n | SChar\n | (.+.) Schema Schema\n\nSchemaType : Schema -> Type\nSchemaType SString = String\nSchemaType SInt = Int\nSchemaType SChar = Char\nSchemaType (x .+. y) = (SchemaType x, SchemaType y)\n\nrecord DataStore where\n constructor MkData\n schema : Schema\n size : Nat\n items : Vect size (SchemaType schema)\n\naddToStore : (store : DataStore) -> SchemaType (schema store) -> DataStore\naddToStore (MkData schema size items) newItem =\n MkData schema _ (addToData items) \n where\n addToData : Vect oldsize (SchemaType schema) -> Vect (S oldsize) (SchemaType schema)\n addToData [] = [newItem]\n addToData (x :: xs) = x :: addToData xs\n\ndisplay : SchemaType schema -> String\ndisplay {schema = SString} item = show item\ndisplay {schema = SInt} item = show item\ndisplay {schema = SChar} item = show item\ndisplay {schema = (y .+. z)} (itemL, itemR) = display itemL ++ \", \" ++ display itemR\n\ngetEntry : (pos : Integer) -> (store : DataStore) -> Maybe (String, DataStore)\ngetEntry pos store =\n let store_items = items store in\n case integerToFin pos (size store) of\n Nothing => Just (\"Out of range\\n\", store)\n Just id => Just (display (index id (items store)) ++ \"\\n\", store)\n\ndata Command : Schema -> Type where\n SetSchema : (newSchema : Schema) -> Command schema\n Add : SchemaType schema -> Command schema\n Get : Maybe Integer -> Command schema\n Quit : Command schema\n\nparsePrefix : (schema : Schema) -> String -> Maybe (SchemaType schema, String)\nparsePrefix SString input = getQuoted (unpack input)\n where\n getQuoted : List Char -> Maybe (String, String)\n getQuoted ('\"' :: xs) = case span (/= '\"') xs of\n (quoted, '\"' :: rest) => Just (pack quoted, ltrim (pack rest))\n _ => Nothing\n getQuoted _ = Nothing\n\nparsePrefix SInt input = case span isDigit input of\n (\"\", rest) => Nothing\n (num, rest) => Just (cast num, ltrim rest)\n\nparsePrefix SChar input = getChar (unpack input)\n where\n getChar : List Char -> Maybe (Char, String)\n getChar (char :: ' ' :: rest) = Just (char, pack rest)\n getChar (char :: []) = Just (char, \"\")\n getChar _ = Nothing \n\nparsePrefix (schemaL .+. schemaR) input =\n do\n (lVal, input') <- parsePrefix schemaL input\n (rVal, input'') <- parsePrefix schemaR input'\n Just ((lVal, rVal), input'')\n\nparseBySchema : (schema : Schema) -> String -> Maybe (SchemaType schema)\nparseBySchema schema input = case parsePrefix schema input of\n Just (res, \"\") => Just res\n Just _ => Nothing\n Nothing => Nothing\n\nparseSchema : List String -> Maybe Schema\nparseSchema (\"String\" :: xs) =\n case xs of\n [] => Just SString\n _ =>\n do\n restSchema <- parseSchema xs\n Just (SString .+. restSchema)\nparseSchema (\"Int\" :: xs) =\n case xs of\n [] => Just SInt\n _ =>\n do\n restSchema <- parseSchema xs\n Just (SInt .+. restSchema)\nparseSchema (\"Char\" :: xs) =\n case xs of\n [] => Just SChar\n _ =>\n do\n restSchema <- parseSchema xs\n Just (SChar .+. restSchema)\nparseSchema _ = Nothing\n\nparseCommand : (schema : Schema) -> String -> String -> Maybe (Command schema)\nparseCommand schema \"add\" rest =\n do\n restOk <- parseBySchema schema rest\n Just (Add restOk)\nparseCommand schema \"get\" \"\" = Just (Get Nothing)\nparseCommand schema \"get\" val =\n case all isDigit (unpack val) of\n False => Nothing\n True => Just (Get $ Just (cast val))\nparseCommand schema \"schema\" val =\n do\n schemaok <- parseSchema (words val)\n Just (SetSchema schemaok)\nparseCommand schema \"quit\" \"\" = Just Quit\nparseCommand _ _ _ = Nothing\n\nparse : (schema : Schema) -> (input : String) -> Maybe (Command schema)\nparse schema input = case span (/= ' ') input of\n (cmd, args) => parseCommand schema cmd (ltrim args)\n\nsetSchema : (store : DataStore) -> Schema -> Maybe DataStore\nsetSchema store schema = case size store of\n Z => Just (MkData schema _ [])\n S k => Nothing\n\nshowItems : Vect len (SchemaType schema) -> String\nshowItems [] = \"\"\nshowItems (item :: items') = display item ++ \"\\n\" ++ showItems items'\n\nprocessInput : DataStore -> String -> Maybe (String, DataStore)\nprocessInput store input\n = case parse (schema store) input of\n Nothing => Just (\"Invalid command\\n\", store)\n Just (Add item) =>\n Just (\"ID \" ++ show (size store) ++ \"\\n\", addToStore store item)\n Just (Get Nothing) => Just (showItems $ items store, store)\n Just (Get $ Just pos) => getEntry pos store\n Just (SetSchema schema') =>\n case setSchema store schema' of\n Nothing => Just (\"Can't update schema\\n\", store)\n Just store' => Just (\"OK\\n\", store')\n Just Quit => Nothing\n\nmain : IO ()\nmain = replWith (MkData (SString .+. SInt) _ []) \"Command: \" processInput", "meta": {"hexsha": "33bf94479418605930a746fb18a668f428520297", "size": 5375, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris-exercises/DataStoreOld.idr", "max_stars_repo_name": "0nkery/tt-tutorials", "max_stars_repo_head_hexsha": "a39926989c2f39c718893b99bd857b6d51a172b0", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "idris-exercises/DataStoreOld.idr", "max_issues_repo_name": "0nkery/tt-tutorials", "max_issues_repo_head_hexsha": "a39926989c2f39c718893b99bd857b6d51a172b0", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "idris-exercises/DataStoreOld.idr", "max_forks_repo_name": "0nkery/tt-tutorials", "max_forks_repo_head_hexsha": "a39926989c2f39c718893b99bd857b6d51a172b0", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 35.8333333333, "max_line_length": 98, "alphanum_fraction": 0.5717209302, "num_tokens": 1318, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6859494550081925, "lm_q2_score": 0.5736784074525096, "lm_q1q2_score": 0.3935143909420168}} {"text": "-- --------------------------------------------------------------- [ BTree.idr ]\n-- Module : BTree.idr\n-- Copyright : (c) 2015,2016 See CONTRIBUTORS.md\n-- License : see LICENSE\n-- --------------------------------------------------------------------- [ EOH ]\n||| Implementation of a Binary Tree an AVL Binary Search Tree.\n|||\n||| The underlying AVL Tree is a Key-Value Tree, this library just\n||| wraps this up as a simple Binary tree for values i.e. keys.\nmodule Data.AVL.BTree\n\nimport Data.AVL\n\n%access export\n\n-- ------------------------------------------------------------- [ Definitions ]\n\n||| A Binary Search Tree.\n|||\n||| @ty The type of the elements in the tree.\ndata BTree : (ty : Type) -> Type\n where\n MkTree : {a : Type } -> AVLTree n a Unit -> BTree a\n\n-- --------------------------------------------------------------------- [ API ]\n\n||| Return an empty BTree.\nempty : Ord a => BTree a\nempty = MkTree (Element Empty AVLEmpty)\n\n||| Insert an element into the Tree.\ninsert : (Ord a) => a -> BTree a -> BTree a\ninsert a (MkTree t) = MkTree (snd $ AVL.API.insert a () t)\n\n||| Does the tree contain the given element?\ncontains : (Ord a) => a -> BTree a -> Bool\ncontains a (MkTree t) = isJust (AVL.API.lookup a t)\n\n||| How many nodes are in the tree?\nsize : BTree a -> Nat\nsize (MkTree t) = AVL.API.size t\n\n||| Construct an ordered list containing the elements of the tree.\ntoList : BTree a -> List a\ntoList (MkTree t) = map fst $ AVL.API.toList t\n\n||| Construct a tree from a list of elements.\nfromList : (Ord a) => List a -> BTree a\nfromList xs = (foldl (\\t,k => BTree.insert k t) empty xs)\n\n-- --------------------------------------------------------------- [ Instances ]\n\nFoldable BTree where\n foldr f i (MkTree t) = foldr (\\x,_,p => f x p) i t\n\nEq a => Eq (BTree a) where\n (==) (MkTree (Element t _)) (MkTree (Element t' _)) = t == t'\n\nShow a => Show (BTree a) where\n show s = \"{ \" ++ (unwords . intersperse \",\" . map show . BTree.toList $ s) ++ \" }\"\n\nnamespace Quantifier\n\n data All : (predicate : type -> Type) -> (set : BTree type) -> Type where\n Satisfies : (prf : AllKeys p tree) -> All p (MkTree tree)\n\nnamespace Predicate\n\n data Elem : (value : type) -> (tree : BTree type) -> Type where\n IsElem : (prf : HasKey value tree)\n -> Elem value (MkTree tree)\n\n private\n elemNotInTree : (prfIsNotElem : HasKey value tree -> Void) -> Elem value (MkTree tree) -> Void\n elemNotInTree prfIsNotElem (IsElem prf) = prfIsNotElem prf\n\n isElem : DecEq type\n => (value : type)\n -> (tree : BTree type)\n -> Dec (Elem value tree)\n isElem value (MkTree tree) with (isKey value tree)\n isElem value (MkTree tree) | (Yes prf) = Yes (IsElem prf)\n isElem value (MkTree tree) | (No prfIsNotElem) = No (elemNotInTree prfIsNotElem)\n\n-- --------------------------------------------------------------------- [ EOF ]\n", "meta": {"hexsha": "96251cc978f641c7cdfb09eabdaa62e074b162a6", "size": 2869, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Data/AVL/BTree.idr", "max_stars_repo_name": "elba/idris-containers", "max_stars_repo_head_hexsha": "b92d489abcb32774fb6adfd7f26a28c082cc4bef", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "Data/AVL/BTree.idr", "max_issues_repo_name": "elba/idris-containers", "max_issues_repo_head_hexsha": "b92d489abcb32774fb6adfd7f26a28c082cc4bef", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Data/AVL/BTree.idr", "max_forks_repo_name": "elba/idris-containers", "max_forks_repo_head_hexsha": "b92d489abcb32774fb6adfd7f26a28c082cc4bef", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2020-05-19T12:29:49.000Z", "max_forks_repo_forks_event_max_datetime": "2020-05-19T12:29:49.000Z", "avg_line_length": 33.3604651163, "max_line_length": 96, "alphanum_fraction": 0.5433949111, "num_tokens": 803, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.672331699179286, "lm_q2_score": 0.5851011542032312, "lm_q1q2_score": 0.39338205319721986}} {"text": "-- exercises in \"Type-Driven Development with Idris\"\n-- chapter 6\n\nimport Data.Vect\n\n-- check that all functions are total\n%default total\n\ninfixr 5 .+.\n\ndata Schema = SString\n | SInt\n | SChar\n | (.+.) Schema Schema\n\nSchemaType : Schema -> Type\nSchemaType SString = String\nSchemaType SInt = Int\nSchemaType SChar = Char\nSchemaType (x .+. y) = (SchemaType x, SchemaType y)\n\nrecord DataStore where\n constructor MkData\n schema : Schema\n size : Nat\n items : Vect size (SchemaType schema)\n\naddToStore : (store : DataStore) -> SchemaType (schema store) -> DataStore\naddToStore (MkData schema size store) newItem\n = MkData schema _ (addToData store)\n where\n addToData : Vect oldsize (SchemaType schema) ->\n Vect (S oldsize) (SchemaType schema)\n addToData [] = [newItem]\n addToData (x :: xs) = x :: addToData xs\n\n||| Supported commands\ndata Command : Schema -> Type where\n ||| Set schema\n SetSchema : (newSchema : Schema) -> Command schema\n ||| Add an item\n Add : SchemaType schema -> Command schema\n ||| Get an item by its id\n Get : Integer -> Command schema\n ||| List the contents of the store\n List : Command schema\n ||| Get the number of items\n Size : Command schema\n |||| Quit\n Quit : Command schema\n\nparseSchema : List String -> Maybe Schema\nparseSchema (\"String\" :: xs) =\n case xs of\n [] => Just SString\n _ => parseSchema xs >>= Just . (SString .+.)\nparseSchema (\"Int\" :: xs) =\n case xs of\n [] => Just SInt\n _ => parseSchema xs >>= Just . (SInt .+.)\nparseSchema (\"Char\" :: xs) =\n case xs of\n [] => Just SChar\n _ => parseSchema xs >>= Just . (SChar .+.)\nparseSchema _ = Nothing\n\nparsePrefix : (schema : Schema) -> String -> Maybe (SchemaType schema, String)\nparsePrefix SString input = getQuoted (unpack input)\n where\n getQuoted : List Char -> Maybe (String, String)\n getQuoted ('\"' :: xs)\n = case span (/= '\"') xs of\n (quoted, '\"' :: rest) => Just (pack quoted, ltrim (pack rest))\n _ => Nothing\n getQuoted _ = Nothing\nparsePrefix SInt input = case span isDigit input of\n (\"\", rest) => Nothing\n (num, rest) => Just (cast num, ltrim rest)\nparsePrefix SChar input = case unpack input of\n [] => Nothing\n (x :: rest) => Just (x, ltrim (pack rest))\nparsePrefix (schema1 .+. schema2) input =\n do (val1, rest1) <- parsePrefix schema1 input\n (val2, rest2) <- parsePrefix schema2 rest1\n Just ((val1, val2), rest2)\n\nparseBySchema : (schema : Schema) -> String -> Maybe (SchemaType schema)\nparseBySchema schema input =\n do (res, rest) <- parsePrefix schema input\n if rest == \"\" then Just res else Nothing\n\nparseCommand : (schema : Schema) -> String -> String -> Maybe (Command schema)\nparseCommand schema \"schema\" rest\n = parseSchema (words rest) >>= Just . SetSchema\nparseCommand schema \"add\" rest\n = parseBySchema schema rest >>= Just . Add\nparseCommand schema \"get\" \"\" = Just List\nparseCommand schema \"get\" val = case all isDigit (unpack val) of\n False => Nothing\n True => Just (Get (cast val))\nparseCommand schema \"size\" \"\" = Just Size\nparseCommand schema \"quit\" \"\" = Just Quit\nparseCommand _ _ _ = Nothing\n\nparse : (schema : Schema) -> (input : String) -> Maybe (Command schema)\nparse schema input = case span (/= ' ') input of\n (cmd, args) => parseCommand schema cmd (ltrim args)\n\ndisplay : SchemaType schema -> String\ndisplay {schema = SString} item = item\ndisplay {schema = SInt} item = show item\ndisplay {schema = SChar} item = show item\ndisplay {schema = (x .+. y)} (item1, item2)\n = display item1 ++ \", \" ++ display item2\n\ngetEntry : (pos : Integer) -> (store : DataStore) -> Maybe (String, DataStore)\ngetEntry pos store\n = let store_items = items store in\n case integerToFin pos (size store) of\n Nothing => Just (\"Out of range \\n\", store)\n Just id => Just (display (index id store_items) ++ \"\\n\", store)\n\nsetSchema : (store : DataStore) -> Schema -> Maybe DataStore\nsetSchema store schema = case size store of\n Z => Just (MkData schema _ [])\n S k => Nothing\n\npresentResults : Vect _ (Nat, SchemaType schema) -> String\npresentResults results = foldl (++) \"\" $ map helper results\n where\n helper : (Nat, SchemaType schema) -> String\n helper (x, res) = show x ++ \": \" ++ (display res) ++ \"\\n\"\n\nlistStore : (store : DataStore) -> String\nlistStore store = presentResults $ helper (items store) 0\n where\n helper : Vect size' (SchemaType (schema store)) ->\n Nat ->\n Vect size' (Nat, SchemaType (schema store))\n helper [] _ = []\n helper (x :: xs) k = (k, x) :: helper xs (S k)\n\nprocessInput : DataStore -> String -> Maybe (String, DataStore)\nprocessInput store input\n = case parse (schema store) input of\n Nothing => Just (\"Invalid command\\n\", store)\n Just (SetSchema schema') =>\n case setSchema store schema' of\n Nothing => Just (\"Can't update schema\\n\", store)\n Just store' => Just (\"OK\\n\", store')\n Just (Add item) =>\n Just (\"ID \" ++ show (size store) ++ \"\\n\", addToStore store item)\n Just (Get pos) => getEntry pos store\n Just List => Just (listStore store, store)\n Just Size => Just (show (size store) ++ \"\\n\", store)\n Just Quit => Nothing\n\npartial\nmain : IO ()\nmain = replWith (MkData SString _ []) \"Command: \" processInput\n", "meta": {"hexsha": "c88640c337f96b6146d7d7217708752a74cab5e8", "size": 5692, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "chapter6/DataStore.idr", "max_stars_repo_name": "pascalpoizat/idris-book", "max_stars_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 4, "max_stars_repo_stars_event_min_datetime": "2018-08-16T00:58:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-15T01:07:37.000Z", "max_issues_repo_path": "chapter6/DataStore.idr", "max_issues_repo_name": "pascalpoizat/idris-book", "max_issues_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "chapter6/DataStore.idr", "max_forks_repo_name": "pascalpoizat/idris-book", "max_forks_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-01-23T03:15:39.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-23T03:15:39.000Z", "avg_line_length": 35.3540372671, "max_line_length": 78, "alphanum_fraction": 0.594869993, "num_tokens": 1465, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7122321964553657, "lm_q2_score": 0.5506073655352404, "lm_q1q2_score": 0.3921602933396667}} {"text": "-- ------------------------------------------------- [ InteractivePrograms.idr ]\n-- Module : Exercises.InteractivePrograms\n-- Description : Solutions to the Chapter 5 exercises in Edwin Brady's\n-- book, \"Type-Driven Development with Idris.\"\n-- --------------------------------------------------------------------- [ EOH ]\nmodule Exercises.InteractivePrograms\n\nimport Control.Arrow\nimport Control.Category\nimport Data.Morphisms\nimport Data.Vect\n\nimport Effects\nimport Effect.Random\n\n%access export\n\n-- --------------------------------------------------------- [ 5.2.4 Exercises ]\n\n||| Attempt to convert a string to a natural number.\n|||\n||| If `s` contains only digits, return `Just` the natural number it represents,\n||| otherwise `Nothing`.\n|||\n||| ```idris example\n||| stringToNat \"123\"\n||| ```\n||| ```idris example\n||| stringToNat \"bad\"\n||| ```\n|||\n||| @ string the string to try to convert\nstringToNat : (string : String) -> Maybe Nat\nstringToNat s = if all isDigit (unpack s)\n then Just (cast s)\n else Nothing\n\nhandleGuess : Nat -> IO () -> Maybe Nat -> IO ()\nhandleGuess _ loop Nothing = putStrLn \"Invalid number\" *> loop\nhandleGuess target loop (Just guess) =\n case compare guess target of\n LT => putStrLn \"Too low!\" *> loop\n EQ => putStrLn \"Correct!\"\n GT => putStrLn \"Too high!\" *> loop\n\nreadNumber : IO (Maybe Nat)\nreadNumber = stringToNat <$> getLine\n\nnamespace Simple\n\n ||| A simple \"guess the number\" game.\n |||\n ||| Repeatedly ask the user to guess a number and display whether the guess\n ||| is too high, too low, or correct. When the guess is correct, exit.\n |||\n ||| @ target the number to be guessed\n partial\n guess : (target : Nat) -> IO ()\n guess target = putStrLn \"===> Guess the number\" *> loop\n where\n partial\n loop : IO ()\n loop = putStr \"> \" *> handleGuess target loop !readNumber\n\n partial\n main : IO ()\n main = guess $ fromIntegerNat !(run (rndInt 1 100))\n\nnamespace Counting\n\n partial\n guess : (target, guesses : Nat) -> IO ()\n guess target guesses = putStrLn \"===> Guess the number\" *> loop\n where\n partial\n loop : IO ()\n loop = do putStrLn $ \"Guesses so far: \" ++ show guesses\n putStr \"> \" *> handleGuess target loop !readNumber\n\n partial\n main : IO ()\n main = guess $ fromIntegerNat !(run (rndInt 1 100))\n\nnamespace DIY\n\n %hide Prelude.Interactive.replWith\n\n partial\n replWith : a -> String -> (a -> String -> Maybe (String, a)) -> IO ()\n replWith state prompt func =\n do putStr prompt\n case func state !getLine of\n Just (output, newState) => do putStr output\n replWith newState prompt func\n Nothing => pure ()\n\n %hide Prelude.Interactive.repl\n\n partial\n repl : String -> (String -> String) -> IO ()\n repl prompt func = replWith () prompt (flip (curry go))\n where\n go : (String, a) -> Maybe (String, a)\n go = applyMor $ first (arrow func) >>> arrow pure\n\n-- --------------------------------------------------------- [ 5.3.5 Exercises ]\n\n||| Read input from the console until the user enters a blank line.\npartial\nreadToBlank : IO (List String)\nreadToBlank = case !getLine of\n \"\" => pure []\n x => pure (x :: !readToBlank)\n\n||| Read input from the console until the user enters a blank line,\n||| then read a file name from the console, and write the input to the file.\npartial\nreadAndSave : IO ()\nreadAndSave = do putStrLn \"Input:\"\n contents <- unlines <$> readToBlank\n putStr \"Filename: \"\n Right file <- writeFile !getLine contents\n | Left err => printLn err\n putStrLn \"done\"\n\nnamespace ReadVectFile\n\n ||| Read the contents of a file into a dependent pair containing a length\n ||| and a `Vect` of that length.\n ||| If there are any errors, return the empty vector.\n partial\n readVectFile : (filename : String) -> IO (n ** Vect n String)\n readVectFile filename = do Right xs <- map lines <$> readFile filename\n | Left err => (printLn err *> pure (_ ** []))\n pure (_ ** fromList xs)\n\n main : IO ()\n main = putStr \"Filename: \" *> printLn !(readVectFile !getLine)\n\n-- --------------------------------------------------------------------- [ EOF ]\n", "meta": {"hexsha": "ce380014cbdf1fab5c6e8b65aa7ef661dbf532c6", "size": 4544, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Exercises/InteractivePrograms.idr", "max_stars_repo_name": "yurrriq/tdd-with-idris", "max_stars_repo_head_hexsha": "873c6c719706d06179527c5d93982bb7c184da90", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2019-04-15T01:29:36.000Z", "max_stars_repo_stars_event_max_datetime": "2019-04-15T01:29:36.000Z", "max_issues_repo_path": "src/Exercises/InteractivePrograms.idr", "max_issues_repo_name": "yurrriq/tdd-with-idris", "max_issues_repo_head_hexsha": "873c6c719706d06179527c5d93982bb7c184da90", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 3, "max_issues_repo_issues_event_min_datetime": "2016-11-21T23:42:45.000Z", "max_issues_repo_issues_event_max_datetime": "2016-12-01T05:43:10.000Z", "max_forks_repo_path": "src/Exercises/InteractivePrograms.idr", "max_forks_repo_name": "yurrriq/tdd-with-idris", "max_forks_repo_head_hexsha": "873c6c719706d06179527c5d93982bb7c184da90", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 32.2269503546, "max_line_length": 80, "alphanum_fraction": 0.5470950704, "num_tokens": 1040, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6406358411176238, "lm_q2_score": 0.611381973294151, "lm_q1q2_score": 0.3916732047054511}} {"text": "module Sub13Apply108x36\n\nimport ProofColDivSeqBase\nimport ProofColDivSeqPostulate\nimport ProofColDivSeqPostuProof\n\n%default total\n-- %language ElabReflection\n\n\n-- 3(36x+12) --F[5,-2]->B[1,-2]--> 3(16x+5)\nexport\napply108x36 : (Not . P) (S (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o))))))))))))\n -> (m : Nat **\n (LTE (S m)\n (S (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))))))),\n (Not . P) m))\napply108x36 {o} col = ((S (S (S (S (S (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))))))))\n ** (lte108x36 o, fb108x36To48x15 o col)) where\n lte108x36 : (o:Nat) -> LTE (S (S (S (S (S (S (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))))))))\n (S (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o))))))))))))\n lte108x36 Z = (lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc) LTEZero\n lte108x36 (S o) = let lemma = lte108x36 o in\n\n rewrite (sym (plusSuccRightSucc o o)) in\n\n rewrite (sym (plusSuccRightSucc (plus o o) (S (plus o o)))) in\n rewrite (sym (plusSuccRightSucc (plus o o) (plus o o))) in\n\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (S (S (plus (plus o o) (plus o o))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (S (plus (plus o o) (plus o o)))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (plus (plus o o) (plus o o))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))) in\n\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (S (S (S (S (S (S (S (plus (plus (plus o o) (plus o o))\n (plus (plus o o) (plus o o)))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (S (S (S (S (S (S (plus (plus (plus o o) (plus o o))\n (plus (plus o o) (plus o o))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (S (S (S (S (S (plus (plus (plus o o) (plus o o))\n (plus (plus o o) (plus o o)))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (S (S (S (S (plus (plus (plus o o) (plus o o))\n (plus (plus o o) (plus o o))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (S (S (S (plus (plus (plus o o) (plus o o))\n (plus (plus o o) (plus o o)))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (S (S (plus (plus (plus o o) (plus o o))\n (plus (plus o o) (plus o o))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (S (plus (plus (plus o o) (plus o o))\n (plus (plus o o) (plus o o)))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (plus (plus (plus o o) (plus o o))\n (plus (plus o o) (plus o o))))) in\n\n rewrite (sym (plusSuccRightSucc (plus o o) o)) in\n\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (S (S (plus (plus o o) o))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (S (plus (plus o o) o)))) in\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (plus (plus o o) o))) in\n\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (S (S (S (S (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (S (S (S (S (plus (plus (plus o o) o) (plus (plus o o) o))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (S (S (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (S (S (plus (plus (plus o o) o) (plus (plus o o) o))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (S (plus (plus (plus o o) o) (plus (plus o o) o)))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))) in\n\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o))))))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o)))))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o))))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o)))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o)))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o)))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o)))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o)\n (plus (plus o o) o)))))))) in\n\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o))))))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o)))))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o))))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o)))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o))))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o)))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o))))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o)))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o))))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o)))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o))))))))) in\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\n (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o))))\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\n (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))\n (S (S (plus (plus (plus (plus o o) o)\n (plus (plus o o) o)) (S (plus (plus (plus o o)\n o)\n (plus (plus o o)\n o)))))))) in\n\n (lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc) lemma\n\n\n\n", "meta": {"hexsha": "0d0a91f0bba14c8a38b3a8d1bf1aed748d0cde5f", "size": 23793, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "program2/Sub13Apply108x36.idr", "max_stars_repo_name": "righ1113/collatzProof_DivSeq", "max_stars_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "program2/Sub13Apply108x36.idr", "max_issues_repo_name": "righ1113/collatzProof_DivSeq", "max_issues_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 3, "max_issues_repo_issues_event_min_datetime": "2019-01-26T12:59:21.000Z", "max_issues_repo_issues_event_max_datetime": "2019-10-19T07:02:00.000Z", "max_forks_repo_path": "program2/Sub13Apply108x36.idr", "max_forks_repo_name": "righ1113/collatzProof_DivSeq", "max_forks_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 90.125, "max_line_length": 471, "alphanum_fraction": 0.3265246081, "num_tokens": 6000, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.8080672181749422, "lm_q2_score": 0.48438008427698437, "lm_q1q2_score": 0.3914116672410468}} {"text": "module LeftPad\n\nimport Data.Vect\nimport Data.Vect.Quantifiers\n\nsimpleLeftPad : Char -> Int -> String -> Int\nsimpleLeftPad = 2\n\ntesting : String -> Type\ntesting \"Give me text\" = String\ntesting _ = Int\n\n-- `minus` is saturating subtraction, so this works like we want it to\neq_max : (n, k : Nat) -> maximum k n = plus (n `minus` k) k\neq_max n Z = rewrite minusZeroRight n in\n rewrite plusZeroRightNeutral n in Refl\neq_max Z (S _) = Refl\neq_max (S n) (S k) = rewrite sym $ plusSuccRightSucc (n `minus` k) k in rewrite eq_max n k in Refl\n\n-- The type here says \"the result is\" padded to (maximum k n), and is padding plus the original\nleftPad : (x : a) -> (n : Nat) -> (xs : Vect k a)\n -> (ys : Vect (maximum k n) a ** m : Nat ** ys = replicate m x ++ xs)\nleftPad {k} x n xs = rewrite eq_max n k in (replicate (n `minus` k) x ++ xs ** n `minus` k ** Refl)\n\n-- helperProof : (m : Fin n) -> Vect n a -> Vect (cast m) a\n-- helperProof FZ v = []\n-- helperProof (FS x) (y :: xs) = y :: helperProof x xs\n\n-- minusItselfZero : (a : Nat) -> (b : Nat) -> LTE b a -> Vect (a - b + b) Char = Vect a Char\n-- minusItselfZero a b p = ?minusItselfZero_rhs1\n\n-- leftPad : (c : Char)\n-- -> (s : List Char)\n-- -> (n : Nat)\n-- -> (case isLTE (length s) (S n) of\n-- No _ => (x : List Char ** (x = s))\n-- Yes _ => (v : Vect (S n) Char\n-- **\n-- (y : Vect ((S n) - (length s)) Char ** (y ++ (fromList s) = v))))\n-- leftPad padChar s n with (isLTE (length s) (S n))\n-- leftPad padChar s n | No _ = (s ** Refl)\n-- leftPad padChar s n | Yes lteproof = let paddingVec = replicate ((S n) - (length s)) padChar\n-- newVec = paddingVec ++ (fromList s)\n-- in rewrite sym (minusItselfZero (S n) (length s) lteproof) in (newVec ** (paddingVec ** ?jotain))\n", "meta": {"hexsha": "6e9ad74e0cc17a2bd1582b8955ae57493f5941f0", "size": 1973, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "LeftPad.idr", "max_stars_repo_name": "neurogoo/idris-intro-presentation", "max_stars_repo_head_hexsha": "dc710fa9ef8b19b43b32577b800d9fcfc8c4f52c", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "LeftPad.idr", "max_issues_repo_name": "neurogoo/idris-intro-presentation", "max_issues_repo_head_hexsha": "dc710fa9ef8b19b43b32577b800d9fcfc8c4f52c", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "LeftPad.idr", "max_forks_repo_name": "neurogoo/idris-intro-presentation", "max_forks_repo_head_hexsha": "dc710fa9ef8b19b43b32577b800d9fcfc8c4f52c", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 43.8444444444, "max_line_length": 139, "alphanum_fraction": 0.5301571211, "num_tokens": 610, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7057850402140659, "lm_q2_score": 0.5544704649604273, "lm_q1q2_score": 0.39133695940960694}} {"text": "import Data.Vect\n\nexport\ndata StackCmd : Type -> Nat -> Nat -> Type where\n Push : Integer -> StackCmd () height (S height)\n Pop : StackCmd Integer (S height) height\n Top : StackCmd Integer (S height) (S height)\n\n GetStr : StackCmd String height height\n PutStr : String -> StackCmd () height height\n\n Pure : ty -> StackCmd ty height height\n (>>=) : StackCmd a height1 height2 ->\n (a -> StackCmd b height2 height3) ->\n StackCmd b height1 height3\n\nrunStack : (stk : Vect inHeight Integer) ->\n StackCmd ty inHeight outHeight ->\n IO (ty, Vect outHeight Integer)\nrunStack stk (Push val) = pure ((), val :: stk)\nrunStack (val :: stk) Pop = pure (val, stk)\nrunStack (val :: stk) Top = pure (val, val :: stk)\nrunStack stk GetStr = do x <- getLine\n pure (x, stk)\nrunStack stk (PutStr x) = do putStr x\n pure ((), stk)\nrunStack stk (Pure x) = pure (x, stk)\nrunStack stk (x >>= f) = do (x', newStk) <- runStack stk x\n runStack newStk (f x')\n\ntestAdd : StackCmd () 0 0\ntestAdd = do Push 10\n x <- GetStr\n Push (cast x)\n val1 <- Pop\n val2 <- Pop\n PutStr (show (val1 + val2) ++ \"\\n\")\n\nexport\ndata StackIO : Nat -> Type where\n Do : StackCmd a height1 height2 ->\n (a -> Inf (StackIO height2)) -> StackIO height1\n\nnamespace StackDo\n export\n (>>=) : StackCmd a height1 height2 ->\n (a -> Inf (StackIO height2)) -> StackIO height1\n (>>=) = Do\n\ndata Fuel = Dry | More (Lazy Fuel)\n\npartial\nforever : Fuel\nforever = More forever\n\nrun : Fuel -> Vect height Integer -> StackIO height -> IO ()\nrun Dry _ _ = pure ()\nrun (More fuel) stk (Do c f) = do (res, newStk) <- runStack stk c\n run fuel newStk (f res)\n\ndoAdd : StackCmd () (S (S height)) (S height)\ndoAdd = do val1 <- Pop\n val2 <- Pop\n Push (val1 + val2)\n\ndata StkInput = Number Integer\n | Add\n\nstrToInput : String -> Maybe StkInput\nstrToInput \"\" = Nothing\nstrToInput \"add\" = Just Add\nstrToInput x = if all isDigit (unpack x)\n then Just (Number $ cast x)\n else Nothing\n\nmutual\n tryAdd : {height : _} -> StackIO height\n tryAdd {height = S (S h)} = do doAdd\n result <- Top\n PutStr (show result ++ \"\\n\")\n stackCalc\n tryAdd = do PutStr \"Fewer than two items on the stack\\n\"\n stackCalc\n\n stackCalc : {height : _} -> StackIO height\n stackCalc = do PutStr \"> \"\n input <- GetStr\n case strToInput input of\n Nothing => do PutStr \"Invalid input\\n\"\n stackCalc\n Just (Number x) => do Push x\n stackCalc\n Just Add => tryAdd\n\nmain : IO ()\nmain = run forever [] stackCalc\n", "meta": {"hexsha": "fc6095ebfc10d165a3d630b66c9ead7341a8ddaf", "size": 3004, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris2/tests/typedd-book/chapter13/StackIO.idr", "max_stars_repo_name": "Qqwy/Idris2-Erlang", "max_stars_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "idris2/tests/typedd-book/chapter13/StackIO.idr", "max_issues_repo_name": "Qqwy/Idris2-Erlang", "max_issues_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "idris2/tests/typedd-book/chapter13/StackIO.idr", "max_forks_repo_name": "Qqwy/Idris2-Erlang", "max_forks_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 30.9690721649, "max_line_length": 65, "alphanum_fraction": 0.5226364847, "num_tokens": 786, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7090191214879992, "lm_q2_score": 0.5506073655352404, "lm_q1q2_score": 0.3903911505966178}} {"text": "module Scheme.Core\n\nimport Control.Isomorphism\nimport Data.Vect\n\n%default total\n%access public export\n\n-- TODO Integer <= Rational <= Real <= Complex\n-- TODO Exact | Inexact\n||| [S]cheme [Num]ber\ndata SNum : Type where\n SNExactInt : Integer -> SNum\n\n||| [S]ymbolic [Exp]ression\ndata SExp : Type where\n ||| Symbols are just identifiers or pointers\n ||| They evaluate to something if defined in current scope\n ||| Some are special forms that are evaluated under different rules\n SESymbol : String -> SExp\n ||| Unit is an empty list\n SEUnit : SExp\n ||| Cons is the basic building block and the only way to apply a function\n SECons : SExp -> SExp -> SExp\n ||| Vector should be just an O(1) access List\n ||| Vectors are terminal\n SEVect : Vect n SExp -> SExp\n ||| Booleans are terminal\n SEBool : Bool -> SExp\n ||| Chars are terminal\n SEChar : Char -> SExp\n ||| Strings are terminal\n SEStr : String -> SExp\n ||| Numbers are terminal\n SENum : SNum -> SExp\n\nlistify : SExp -> (List SExp, Maybe SExp)\nlistify SEUnit = ([], Nothing)\nlistify (SECons x y) = let (ls, md) = listify y\n in (x :: ls, md)\nlistify x = ([], Just x)\n\nunListify : (List SExp, Maybe SExp) -> SExp\nunListify (xs, ms) = foldr SECons (maybe SEUnit id ms) xs\n\n-- unListify : (List SExp, Maybe SExp) -> SExp\n-- unListify ([] , Nothing) = SEUnit\n-- unListify ([] , Just s ) = s\n-- unListify (x :: xs, ms ) = SECons x $ assert_total $ unListify (xs, ms)\n\n-- ||| A theorem about lists and dotted lists\n-- lispIso : Iso SExp (List SExp, Maybe SExp)\n-- lispIso = MkIso to from toFrom fromTo\n-- where\n-- to : SExp -> (List SExp, Maybe SExp)\n-- to = listify\n-- from : (List SExp, Maybe SExp) -> SExp\n-- from = unListify\n-- toFrom : (p : (List SExp, Maybe SExp)) -> to (from p) = p\n-- toFrom ([] , Nothing) = Refl\n-- toFrom ([] , Just s ) = ?toFrom_rhs_5\n-- toFrom (x :: xs, Nothing) = ?toFrom_rhs_4\n-- toFrom (x :: xs, Just s ) = ?toFrom_rhs_1\n-- fromTo : (s : SExp) -> from (to s) = s\n-- fromTo SEUnit = Refl\n-- fromTo (SESymbol x) = Refl\n-- fromTo (SEVect xs ) = Refl\n-- fromTo (SEBool x ) = Refl\n-- fromTo (SEChar x ) = Refl\n-- fromTo (SEStr x ) = Refl\n-- fromTo (SENum x ) = Refl\n-- fromTo (SECons x y) = ?whasdasd\n\n", "meta": {"hexsha": "1cb9d80f168eedb4df68629d752ee4d4ddb57c5f", "size": 2360, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Scheme/Core.idr", "max_stars_repo_name": "cmcmA20/descheme", "max_stars_repo_head_hexsha": "2392b45acaac6f12491fcafb223482f314218fc6", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "Scheme/Core.idr", "max_issues_repo_name": "cmcmA20/descheme", "max_issues_repo_head_hexsha": "2392b45acaac6f12491fcafb223482f314218fc6", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Scheme/Core.idr", "max_forks_repo_name": "cmcmA20/descheme", "max_forks_repo_head_hexsha": "2392b45acaac6f12491fcafb223482f314218fc6", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 31.8918918919, "max_line_length": 78, "alphanum_fraction": 0.5936440678, "num_tokens": 786, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6261241772283034, "lm_q2_score": 0.6224593312018546, "lm_q1q2_score": 0.3897368366068412}} {"text": "\n%default total\n\ndata Foo : Type where\n Fee : Foo\n\nx : Foo\nx = Fee\n\ndata Nat : Type where\n Z : Nat\n S : (k:Nat) -> Nat\n \n\n", "meta": {"hexsha": "7b3172ad6099d721fa3d473837de9c739ff11e75", "size": 134, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Learn/z.idr", "max_stars_repo_name": "redfish64/NomicCoin201710", "max_stars_repo_head_hexsha": "1bcdcc1bc160aa70dafcff5030077021c61d9c38", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 4, "max_stars_repo_stars_event_min_datetime": "2018-05-22T03:25:59.000Z", "max_stars_repo_stars_event_max_datetime": "2020-02-24T08:57:47.000Z", "max_issues_repo_path": "Learn/z.idr", "max_issues_repo_name": "redfish64/AN201710", "max_issues_repo_head_hexsha": "1bcdcc1bc160aa70dafcff5030077021c61d9c38", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Learn/z.idr", "max_forks_repo_name": "redfish64/AN201710", "max_forks_repo_head_hexsha": "1bcdcc1bc160aa70dafcff5030077021c61d9c38", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 8.9333333333, "max_line_length": 28, "alphanum_fraction": 0.5223880597, "num_tokens": 48, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7217432182679957, "lm_q2_score": 0.5389832206876841, "lm_q1q2_score": 0.3890074842915785}} {"text": "\ndata Format = Num Format\n | Str Format\n | Lit String Format\n | End\n\nPrintfType : Format -> Type\nPrintfType (Num fmt) = Int -> PrintfType fmt\nPrintfType (Str fmt) = String -> PrintfType fmt\nPrintfType (Lit x fmt) = PrintfType fmt\nPrintfType End = String\n\nparseFormat : List Char -> Format\nparseFormat [] = End\nparseFormat ('%' :: 'd' :: xs) = Num (parseFormat xs)\nparseFormat ('%' :: 's' :: xs) = Str (parseFormat xs)\nparseFormat ('%' :: xs) = Lit \"%\" (parseFormat xs)\nparseFormat (x :: xs) = case parseFormat xs of\n Lit lit xs' => Lit (strCons x lit) xs'\n fmt => Lit (strCons x \"\") fmt\n\nprintfFmt : (fmt : Format) -> String -> PrintfType fmt\nprintfFmt (Num y) x = \\i => printfFmt y (x ++ show i)\nprintfFmt (Str y) x = \\s => printfFmt y (x ++ s)\nprintfFmt (Lit y z) x = printfFmt z (x ++ y)\nprintfFmt End x = x\n\n\nprintf : (s: String) -> PrintfType (parseFormat (unpack s))\nprintf s = printfFmt (parseFormat (unpack s)) \"\"\n", "meta": {"hexsha": "9e299bb2a6edf08ef435d844578123a4d1232600", "size": 1022, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "format.idr", "max_stars_repo_name": "fthomas/tdd-talk", "max_stars_repo_head_hexsha": "988657bc2055e2b0d270198a58b1af0531eb8413", "max_stars_repo_licenses": ["CC0-1.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "format.idr", "max_issues_repo_name": "fthomas/tdd-talk", "max_issues_repo_head_hexsha": "988657bc2055e2b0d270198a58b1af0531eb8413", "max_issues_repo_licenses": ["CC0-1.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "format.idr", "max_forks_repo_name": "fthomas/tdd-talk", "max_forks_repo_head_hexsha": "988657bc2055e2b0d270198a58b1af0531eb8413", "max_forks_repo_licenses": ["CC0-1.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 32.9677419355, "max_line_length": 65, "alphanum_fraction": 0.5821917808, "num_tokens": 290, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6688802735722128, "lm_q2_score": 0.5813030906443133, "lm_q1q2_score": 0.3888221702985411}} {"text": "import Data.Vect\n\n-- Chapter 3.2 Exercises\n\nmy_length : List a -> Nat\nmy_length [] = Z\nmy_length (x :: xs) = S (my_length xs)\n\nmy_reverse : List a -> List a\nmy_reverse [] = []\nmy_reverse [x] = [x]\nmy_reverse (x :: xs) = my_reverse xs ++ [x]\n\nmy_map : (a -> b) -> List a -> List b\nmy_map _ [] = []\nmy_map f (x :: xs) = f x :: my_map f xs\n\nmy_vect_map : (a -> b) -> Vect n a -> Vect n b\nmy_vect_map _ [] = []\nmy_vect_map f (x :: xs) = f x :: my_vect_map f xs", "meta": {"hexsha": "7020a1da27e7a3bb69c1a80287af0b80dedbc753", "size": 456, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/ch3/ex_3_2.idr", "max_stars_repo_name": "trevarj/tdd_idris_examples", "max_stars_repo_head_hexsha": "63a7128a797b64cb0ba54562778cdf9712b4d9f5", "max_stars_repo_licenses": ["Unlicense"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "src/ch3/ex_3_2.idr", "max_issues_repo_name": "trevarj/tdd_idris_examples", "max_issues_repo_head_hexsha": "63a7128a797b64cb0ba54562778cdf9712b4d9f5", "max_issues_repo_licenses": ["Unlicense"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/ch3/ex_3_2.idr", "max_forks_repo_name": "trevarj/tdd_idris_examples", "max_forks_repo_head_hexsha": "63a7128a797b64cb0ba54562778cdf9712b4d9f5", "max_forks_repo_licenses": ["Unlicense"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.8, "max_line_length": 49, "alphanum_fraction": 0.5811403509, "num_tokens": 160, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6688802603710086, "lm_q2_score": 0.5813030906443133, "lm_q1q2_score": 0.38882216262464026}} {"text": "import Data.IORef\n\ncount : Nat -> IORef Integer -> IO ()\ncount Z ref\n = do x <- readIORef ref\n printLn x\ncount (S k) ref\n = do modifyIORef ref (+1)\n count k ref\n\nmain : IO ()\nmain = do r <- newIORef 0\n count 100 r\n", "meta": {"hexsha": "7f92c06c0db5fbe34cd5288375b3c4d166f872b2", "size": 245, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "test/idris-dev/basic021/basic021.idr", "max_stars_repo_name": "grin-compiler/idris-grin", "max_stars_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 36, "max_stars_repo_stars_event_min_datetime": "2019-06-06T10:35:31.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-21T08:48:30.000Z", "max_issues_repo_path": "test/idris-dev/basic021/basic021.idr", "max_issues_repo_name": "grin-compiler/idris-grin", "max_issues_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 4, "max_issues_repo_issues_event_min_datetime": "2019-11-21T20:45:22.000Z", "max_issues_repo_issues_event_max_datetime": "2022-02-02T12:29:23.000Z", "max_forks_repo_path": "test/idris-dev/basic021/basic021.idr", "max_forks_repo_name": "grin-compiler/idris-grin", "max_forks_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-06-14T13:14:47.000Z", "max_forks_repo_forks_event_max_datetime": "2019-12-07T06:20:45.000Z", "avg_line_length": 17.5, "max_line_length": 37, "alphanum_fraction": 0.5551020408, "num_tokens": 77, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.6959583376458152, "lm_q2_score": 0.5583269943353745, "lm_q1q2_score": 0.3885723268404317}} {"text": "module Prelude.EqOrd\n\nimport Builtin\nimport Prelude.Basics\nimport Prelude.Ops\n\n%default total\n\n------------------------\n-- EQUALITY, ORDERING --\n------------------------\n\n||| The Eq interface defines inequality and equality.\npublic export\ninterface Eq ty where\n constructor MkEq\n (==) : ty -> ty -> Bool\n (/=) : ty -> ty -> Bool\n\n x == y = not (x /= y)\n x /= y = not (x == y)\n\npublic export\nEq Void where\n _ == _ impossible\n\npublic export\nEq () where\n _ == _ = True\n\npublic export\nEq Bool where\n True == True = True\n False == False = True\n _ == _ = False\n\npublic export\nEq Int where\n x == y = intToBool (prim__eq_Int x y)\n\npublic export\nEq Integer where\n x == y = intToBool (prim__eq_Integer x y)\n\npublic export\nEq Bits8 where\n x == y = intToBool (prim__eq_Bits8 x y)\n\npublic export\nEq Bits16 where\n x == y = intToBool (prim__eq_Bits16 x y)\n\npublic export\nEq Bits32 where\n x == y = intToBool (prim__eq_Bits32 x y)\n\npublic export\nEq Bits64 where\n x == y = intToBool (prim__eq_Bits64 x y)\n\npublic export\nEq Int8 where\n x == y = intToBool (prim__eq_Int8 x y)\n\npublic export\nEq Int16 where\n x == y = intToBool (prim__eq_Int16 x y)\n\npublic export\nEq Int32 where\n x == y = intToBool (prim__eq_Int32 x y)\n\npublic export\nEq Int64 where\n x == y = intToBool (prim__eq_Int64 x y)\n\npublic export\nEq Double where\n x == y = intToBool (prim__eq_Double x y)\n\npublic export\nEq Char where\n x == y = intToBool (prim__eq_Char x y)\n\npublic export\nEq String where\n x == y = intToBool (prim__eq_String x y)\n\npublic export\nEq a => Eq b => Eq (a, b) where\n (x1, y1) == (x2, y2) = x1 == x2 && y1 == y2\n\npublic export\ndata Ordering = LT | EQ | GT\n\npublic export\nEq Ordering where\n LT == LT = True\n EQ == EQ = True\n GT == GT = True\n _ == _ = False\n\n||| The Ord interface defines comparison operations on ordered data types.\npublic export\ninterface Eq ty => Ord ty where\n constructor MkOrd\n compare : ty -> ty -> Ordering\n compare x y = if x < y then LT else if x == y then EQ else GT\n\n (<) : ty -> ty -> Bool\n (<) x y = compare x y == LT\n\n (>) : ty -> ty -> Bool\n (>) x y = compare x y == GT\n\n (<=) : ty -> ty -> Bool\n (<=) x y = compare x y /= GT\n\n (>=) : ty -> ty -> Bool\n (>=) x y = compare x y /= LT\n\n max : ty -> ty -> ty\n max x y = if x > y then x else y\n\n min : ty -> ty -> ty\n min x y = if (x < y) then x else y\n\nexport\ncomparing : Ord a => (b -> a) -> b -> b -> Ordering\ncomparing p x y = compare (p x) (p y)\n\npublic export\nOrd Void where\n compare _ _ impossible\n\npublic export\nOrd () where\n compare _ _ = EQ\n\npublic export\nOrd Bool where\n compare False False = EQ\n compare False True = LT\n compare True False = GT\n compare True True = EQ\n\npublic export\nOrd Int where\n (<) x y = intToBool (prim__lt_Int x y)\n (<=) x y = intToBool (prim__lte_Int x y)\n (>) x y = intToBool (prim__gt_Int x y)\n (>=) x y = intToBool (prim__gte_Int x y)\n\npublic export\nOrd Integer where\n (<) x y = intToBool (prim__lt_Integer x y)\n (<=) x y = intToBool (prim__lte_Integer x y)\n (>) x y = intToBool (prim__gt_Integer x y)\n (>=) x y = intToBool (prim__gte_Integer x y)\n\n-- Used for the nat hack\npublic export\ncompareInteger : (x, y : Integer) -> Ordering\ncompareInteger = compare\n\npublic export\nOrd Bits8 where\n (<) x y = intToBool (prim__lt_Bits8 x y)\n (<=) x y = intToBool (prim__lte_Bits8 x y)\n (>) x y = intToBool (prim__gt_Bits8 x y)\n (>=) x y = intToBool (prim__gte_Bits8 x y)\n\npublic export\nOrd Bits16 where\n (<) x y = intToBool (prim__lt_Bits16 x y)\n (<=) x y = intToBool (prim__lte_Bits16 x y)\n (>) x y = intToBool (prim__gt_Bits16 x y)\n (>=) x y = intToBool (prim__gte_Bits16 x y)\n\npublic export\nOrd Bits32 where\n (<) x y = intToBool (prim__lt_Bits32 x y)\n (<=) x y = intToBool (prim__lte_Bits32 x y)\n (>) x y = intToBool (prim__gt_Bits32 x y)\n (>=) x y = intToBool (prim__gte_Bits32 x y)\n\npublic export\nOrd Bits64 where\n (<) x y = intToBool (prim__lt_Bits64 x y)\n (<=) x y = intToBool (prim__lte_Bits64 x y)\n (>) x y = intToBool (prim__gt_Bits64 x y)\n (>=) x y = intToBool (prim__gte_Bits64 x y)\n\npublic export\nOrd Int8 where\n (<) x y = intToBool (prim__lt_Int8 x y)\n (<=) x y = intToBool (prim__lte_Int8 x y)\n (>) x y = intToBool (prim__gt_Int8 x y)\n (>=) x y = intToBool (prim__gte_Int8 x y)\n\npublic export\nOrd Int16 where\n (<) x y = intToBool (prim__lt_Int16 x y)\n (<=) x y = intToBool (prim__lte_Int16 x y)\n (>) x y = intToBool (prim__gt_Int16 x y)\n (>=) x y = intToBool (prim__gte_Int16 x y)\n\npublic export\nOrd Int32 where\n (<) x y = intToBool (prim__lt_Int32 x y)\n (<=) x y = intToBool (prim__lte_Int32 x y)\n (>) x y = intToBool (prim__gt_Int32 x y)\n (>=) x y = intToBool (prim__gte_Int32 x y)\n\npublic export\nOrd Int64 where\n (<) x y = intToBool (prim__lt_Int64 x y)\n (<=) x y = intToBool (prim__lte_Int64 x y)\n (>) x y = intToBool (prim__gt_Int64 x y)\n (>=) x y = intToBool (prim__gte_Int64 x y)\n\npublic export\nOrd Double where\n (<) x y = intToBool (prim__lt_Double x y)\n (<=) x y = intToBool (prim__lte_Double x y)\n (>) x y = intToBool (prim__gt_Double x y)\n (>=) x y = intToBool (prim__gte_Double x y)\n\npublic export\nOrd String where\n (<) x y = intToBool (prim__lt_String x y)\n (<=) x y = intToBool (prim__lte_String x y)\n (>) x y = intToBool (prim__gt_String x y)\n (>=) x y = intToBool (prim__gte_String x y)\n\npublic export\nOrd Char where\n (<) x y = intToBool (prim__lt_Char x y)\n (<=) x y = intToBool (prim__lte_Char x y)\n (>) x y = intToBool (prim__gt_Char x y)\n (>=) x y = intToBool (prim__gte_Char x y)\n\npublic export\nOrd a => Ord b => Ord (a, b) where\n compare (x1, y1) (x2, y2)\n = if x1 /= x2 then compare x1 x2\n else compare y1 y2\n", "meta": {"hexsha": "f4c6fb4eff594bc5fee9c236610ffa6b2cf8569d", "size": 5644, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "libs/prelude/Prelude/EqOrd.idr", "max_stars_repo_name": "ska80/idris-jvm", "max_stars_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "libs/prelude/Prelude/EqOrd.idr", "max_issues_repo_name": "ska80/idris-jvm", "max_issues_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "libs/prelude/Prelude/EqOrd.idr", "max_forks_repo_name": "ska80/idris-jvm", "max_forks_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 22.7580645161, "max_line_length": 74, "alphanum_fraction": 0.6364280652, "num_tokens": 2008, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6513548646660542, "lm_q2_score": 0.5964331462646255, "lm_q1q2_score": 0.38848963126754404}} {"text": "module Data.Validated\n\nimport Data.List1\n\nimport Decidable.Equality\n\n%default total\n\n||| `Validated` is like an `Either` but accumulates all errors with semigroup operation.\npublic export\ndata Validated e a = Valid a | Invalid e\n\n--- Instances of standard interfaces ---\n\npublic export\n(Eq e, Eq a) => Eq (Validated e a) where\n Valid x == Valid y = x == y\n Invalid e == Invalid f = e == f\n _ == _ = False\n\nexport\n(Show e, Show a) => Show (Validated e a) where\n showPrec d $ Valid x = showCon d \"Valid\" $ showArg x\n showPrec d $ Invalid e = showCon d \"Invalid\" $ showArg e\n\npublic export\nFunctor (Validated e) where\n map f $ Valid x = Valid $ f x\n map _ $ Invalid e = Invalid e\n\npublic export\nBifunctor Validated where\n bimap _ s $ Valid x = Valid $ s x\n bimap f _ $ Invalid e = Invalid $ f e\n\npublic export\nBifoldable Validated where\n bifoldr _ g acc (Valid a) = g a acc\n bifoldr f _ acc (Invalid e) = f e acc\n\n bifoldl _ g acc (Valid a) = g acc a\n bifoldl f _ acc (Invalid e) = f acc e\n\n binull _ = False\n\npublic export\nBitraversable Validated where\n bitraverse _ g (Valid a) = Valid <$> g a\n bitraverse f _ (Invalid e) = Invalid <$> f e\n\n||| Applicative composition preserves invalidity sequentially accumulating all errors.\npublic export\nSemigroup e => Applicative (Validated e) where\n pure = Valid\n\n Valid f <*> Valid x = Valid $ f x\n Invalid e1 <*> Invalid e2 = Invalid $ e1 <+> e2\n Invalid e <*> Valid _ = Invalid e\n Valid _ <*> Invalid e = Invalid e\n\n-- There is no `Monad` implementation because it can't be coherent with the accumulating `Applicative` one.\n\n||| Semigroup operation selects the leftmost valid value.\n||| If both sides are invalid, errors are accumulated.\npublic export\nSemigroup e => Semigroup (Validated e a) where\n l@(Valid _) <+> _ = l\n _ <+> r@(Valid _) = r\n Invalid e1 <+> Invalid e2 = Invalid $ e1 <+> e2\n\npublic export\nMonoid e => Monoid (Validated e a) where\n neutral = Invalid neutral\n\n||| Alternative composition preserves validity selecting the leftmost valid value.\n||| If both sides are invalid, errors are accumulated.\npublic export\nMonoid e => Alternative (Validated e) where\n empty = neutral\n l@(Valid _) <|> _ = l\n _ <|> r@(Valid _) = r\n Invalid e1 <|> Invalid e2 = Invalid $ e1 <+> e2\n\npublic export\nFoldable (Validated e) where\n foldr op init $ Valid x = x `op` init\n foldr _ init $ Invalid _ = init\n\n foldl op init $ Valid x = init `op` x\n foldl _ init $ Invalid _ = init\n\n null $ Valid _ = False\n null $ Invalid _ = True\n\npublic export\nTraversable (Validated e) where\n traverse f $ Valid x = Valid <$> f x\n traverse _ $ Invalid e = pure $ Invalid e\n\npublic export\nSemigroup e => Zippable (Validated e) where\n zipWith f (Valid l) (Valid r) = Valid $ f l r\n zipWith _ (Valid _) (Invalid r) = Invalid r\n zipWith _ (Invalid l) (Valid _) = Invalid l\n zipWith _ (Invalid l) (Invalid r) = Invalid $ l <+> r\n\n zipWith3 f (Valid x) (Valid y) (Valid z) = Valid $ f x y z\n zipWith3 _ (Valid _) (Valid _) (Invalid z) = Invalid z\n zipWith3 _ (Valid _) (Invalid y) (Valid _) = Invalid y\n zipWith3 _ (Valid _) (Invalid y) (Invalid z) = Invalid $ y <+> z\n zipWith3 _ (Invalid x) (Valid _) (Valid _) = Invalid x\n zipWith3 _ (Invalid x) (Valid _) (Invalid z) = Invalid $ x <+> z\n zipWith3 _ (Invalid x) (Invalid y) (Valid _) = Invalid $ x <+> y\n zipWith3 _ (Invalid x) (Invalid y) (Invalid z) = Invalid $ x <+> y <+> z\n\n unzipWith f (Valid x) = let (a, b) = f x in (Valid a, Valid b)\n unzipWith _ (Invalid e) = (Invalid e, Invalid e)\n\n unzipWith3 f (Valid x) = let (a, b, c) = f x in (Valid a, Valid b, Valid c)\n unzipWith3 _ (Invalid e) = (Invalid e, Invalid e, Invalid e)\n\npublic export\nUninhabited (Valid x = Invalid e) where\n uninhabited Refl impossible\n\npublic export\nUninhabited (Invalid e = Valid x) where\n uninhabited Refl impossible\n\npublic export\n(DecEq e, DecEq a) => DecEq (Validated e a) where\n decEq (Valid x) (Invalid y) = No uninhabited\n decEq (Invalid x) (Valid y) = No uninhabited\n decEq (Valid x) (Valid y) with (decEq x y)\n decEq (Valid _) (Valid _) | Yes p = rewrite p in Yes Refl\n decEq (Valid _) (Valid _) | No up = No $ \\case Refl => up Refl\n decEq (Invalid x) (Invalid y) with (decEq x y)\n decEq (Invalid _) (Invalid _) | Yes p = rewrite p in Yes Refl\n decEq (Invalid _) (Invalid _) | No up = No $ \\case Refl => up Refl\n\n--- Convenience representations ---\n\n||| Special case of `Validated` with a `List` as an error accumulator.\npublic export %inline\nValidatedL : Type -> Type -> Type\nValidatedL = Validated . List1\n\npublic export %inline\noneInvalid : Applicative f => e -> Validated (f e) a\noneInvalid = Invalid . pure\n\n--- Conversions to and from `Either` ---\n\npublic export %inline\nfromEither : Either e a -> Validated e a\nfromEither $ Right x = Valid x\nfromEither $ Left e = Invalid e\n\npublic export %inline\nfromEitherL : Either e a -> ValidatedL e a\nfromEitherL $ Right x = Valid x\nfromEitherL $ Left e = oneInvalid e\n\npublic export %inline\ntoEither : Validated e a -> Either e a\ntoEither $ Valid x = Right x\ntoEither $ Invalid e = Left e\n\n--- Conversions to and from `Maybe` ---\n\npublic export %inline\nfromMaybe : Monoid e => Maybe a -> Validated e a\nfromMaybe $ Just x = Valid x\nfromMaybe $ Nothing = empty\n\npublic export %inline\ntoMaybe : Validated e a -> Maybe a\ntoMaybe $ Valid x = Just x\ntoMaybe $ Invalid _ = Nothing\n\n--- Property of being valid ---\n\npublic export\ndata IsValid : Validated e a -> Type where\n ItIsValid : IsValid $ Valid x\n\nexport\nUninhabited (IsValid $ Invalid e) where\n uninhabited ItIsValid impossible\n\npublic export\nisItValid : (v : Validated e a) -> Dec (IsValid v)\nisItValid $ Valid _ = Yes ItIsValid\nisItValid $ Invalid _ = No absurd\n", "meta": {"hexsha": "85d915970c8010c8f0a6effdcc921f3f72714115", "size": 5826, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "libs/contrib/Data/Validated.idr", "max_stars_repo_name": "ska80/idris-jvm", "max_stars_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 128, "max_stars_repo_stars_event_min_datetime": "2020-06-09T21:25:49.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-31T23:50:24.000Z", "max_issues_repo_path": "libs/contrib/Data/Validated.idr", "max_issues_repo_name": "ska80/idris-jvm", "max_issues_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 9, "max_issues_repo_issues_event_min_datetime": "2020-08-26T03:38:49.000Z", "max_issues_repo_issues_event_max_datetime": "2021-09-23T21:32:49.000Z", "max_forks_repo_path": "libs/contrib/Data/Validated.idr", "max_forks_repo_name": "ska80/idris-jvm", "max_forks_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 8, "max_forks_repo_forks_event_min_datetime": "2020-08-28T04:16:04.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-20T12:47:16.000Z", "avg_line_length": 29.8769230769, "max_line_length": 107, "alphanum_fraction": 0.6613456917, "num_tokens": 1797, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6723316991792861, "lm_q2_score": 0.5774953651858117, "lm_q1q2_score": 0.3882684401435391}} {"text": "module Main\n\nh : Bool -> Nat\nh False = r1 where\n r : Nat\n r = S Z\n r1 : Nat\n r1 = r\nh True = r2 where\n r : Nat\n r = Z\n r2 : Nat\n r2 = r\n\nmain : IO ()\nmain = do printLn (h True); printLn (h False)\n", "meta": {"hexsha": "7110462aa23b4a77c81ae516793c122111e4dd8a", "size": 204, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "test/idris-dev/reg004/reg004.idr", "max_stars_repo_name": "grin-compiler/idris-grin", "max_stars_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 36, "max_stars_repo_stars_event_min_datetime": "2019-06-06T10:35:31.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-21T08:48:30.000Z", "max_issues_repo_path": "test/idris-dev/reg004/reg004.idr", "max_issues_repo_name": "grin-compiler/idris-grin", "max_issues_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 4, "max_issues_repo_issues_event_min_datetime": "2019-11-21T20:45:22.000Z", "max_issues_repo_issues_event_max_datetime": "2022-02-02T12:29:23.000Z", "max_forks_repo_path": "test/idris-dev/reg004/reg004.idr", "max_forks_repo_name": "grin-compiler/idris-grin", "max_forks_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-06-14T13:14:47.000Z", "max_forks_repo_forks_event_max_datetime": "2019-12-07T06:20:45.000Z", "avg_line_length": 12.0, "max_line_length": 45, "alphanum_fraction": 0.5343137255, "num_tokens": 87, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.6926419831347362, "lm_q2_score": 0.5583269943353745, "lm_q1q2_score": 0.38672071659411045}} {"text": "module Issue524\n\n%logging totality 20\n\ndata Bad = MkBad (Not Bad)\n\nhmmm : Bad -> Not Bad\nhmmm (MkBad n) = n\n\nok : Not Bad\nok bad = hmmm bad bad\n\nbad : Bad\nbad = MkBad ok\n\ntotal\nohno : Void\nohno = ok bad\n", "meta": {"hexsha": "783a90dcf963386d9f0d7959e9cc691c71f3f94b", "size": 203, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "tests/idris2/positivity004/Issue524.idr", "max_stars_repo_name": "mmhelloworld/idris-jvm", "max_stars_repo_head_hexsha": "cb0c87d0f65c86636322224d496fef55af92d6b1", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 396, "max_stars_repo_stars_event_min_datetime": "2016-07-17T08:00:45.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-21T22:47:13.000Z", "max_issues_repo_path": "tests/idris2/positivity004/Issue524.idr", "max_issues_repo_name": "mmhelloworld/idris-jvm", "max_issues_repo_head_hexsha": "cb0c87d0f65c86636322224d496fef55af92d6b1", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 54, "max_issues_repo_issues_event_min_datetime": "2016-08-04T06:13:36.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-03T04:00:31.000Z", "max_forks_repo_path": "tests/idris2/positivity004/Issue524.idr", "max_forks_repo_name": "mmhelloworld/idris-jvm", "max_forks_repo_head_hexsha": "cb0c87d0f65c86636322224d496fef55af92d6b1", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 28, "max_forks_repo_forks_event_min_datetime": "2016-09-15T15:19:03.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-27T13:05:48.000Z", "avg_line_length": 10.6842105263, "max_line_length": 26, "alphanum_fraction": 0.6600985222, "num_tokens": 75, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO\n\n", "lm_q1_score": 0.7981867873410141, "lm_q2_score": 0.4843800842769844, "lm_q1q2_score": 0.3866257833210159}} {"text": "%default total\n\ndata Tag = A | B | C | Unknown | Unchecked\n\ndata Doutput : Tag -> Type where \n Ca : Doutput A \n Cb : Doutput B\n Cc : Doutput C\n Cu : Doutput Unknown\n Cs : String -> Doutput Unchecked \n\n{- Based on output from database you construct type -}\ntypelevel : (a : Doutput Unchecked) -> Type\ntypelevel (Cs \"A\") = Doutput A\ntypelevel (Cs \"B\") = Doutput B\ntypelevel (Cs \"C\") = Doutput C\ntypelevel (Cs s) = Doutput Unknown\n\n{- Check value takes a type of Doutput Unchecked and transforms into one the known or unknown file format -}\ncheckValue : (a : Doutput Unchecked) -> typelevel a\ncheckValue (Cs \"A\") = Ca\ncheckValue (Cs \"B\") = Cb\ncheckValue (Cs \"C\") = Cc\ncheckValue (Cs s) = ?Cu {- I am leaving it as meta variable beacause Idris is refusing to simplify it -}\n\n{- \n\n*Typefromdatabase> :r\nType checking ./Typefromdatabase.idr\nHoles: Main.Cu1\n*Typefromdatabase> ch\nchangeDir check checkValue choice choiceMap chr\n*Typefromdatabase> checkValue (Cs \"A\")\nCa : Doutput A\nHoles: Main.Cu1\n*Typefromdatabase> checkValue (Cs \"B\")\nCb : Doutput B\nHoles: Main.Cu1\n*Typefromdatabase> checkValue (Cs \"C\")\nCc : Doutput C\nHoles: Main.Cu1\n*Typefromdatabase> checkValue (Cs \"Hello Wrold\")\n?Cu1 : Doutput Unknown\nHoles: Main.Cu1\n*Typefromdatabase> -}\n\n\n", "meta": {"hexsha": "d8f1a69ace446baa3bce7e94327946203940fff2", "size": 1267, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Idris/Typefromdatabase.idr", "max_stars_repo_name": "mukeshtiwari/Typelevel-Haskell", "max_stars_repo_head_hexsha": "88eac4c16830172c867621f10095c0d3926b808b", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "Idris/Typefromdatabase.idr", "max_issues_repo_name": "mukeshtiwari/Typelevel-Haskell", "max_issues_repo_head_hexsha": "88eac4c16830172c867621f10095c0d3926b808b", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Idris/Typefromdatabase.idr", "max_forks_repo_name": "mukeshtiwari/Typelevel-Haskell", "max_forks_repo_head_hexsha": "88eac4c16830172c867621f10095c0d3926b808b", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 26.3958333333, "max_line_length": 108, "alphanum_fraction": 0.7000789266, "num_tokens": 407, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6370308082623217, "lm_q2_score": 0.6039318337259584, "lm_q1q2_score": 0.38472318417379336}} {"text": "-- Write the signature of a function, typeNamed, that will take the name of a type and return that type. For example, typeNamed \"Int\" would return the type Int.\n-- Implement your typeNamed function for a few different types.\n-- Add the keyword total to the beginning of your typeNamed function signature from the Easy section—that is, total typeNamed : .... Reload your file, and see that your function is not total (defined for all inputs). Make your function total by giving it behavior for bad inputs such as \"ThisIsNotAType\".\n\ntotal typeNamed : String -> Type\ntypeNamed \"String\" = String\ntypeNamed \"Int\" = Int\ntypeNamed _ = String\n", "meta": {"hexsha": "e56fde77f78a80a666a231820854d774b455a2c5", "size": 635, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris/day3/day3.idr", "max_stars_repo_name": "hemslo/seven-in-seven", "max_stars_repo_head_hexsha": "5c772abf8e0887675e56a9478be663807c79c3a8", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "idris/day3/day3.idr", "max_issues_repo_name": "hemslo/seven-in-seven", "max_issues_repo_head_hexsha": "5c772abf8e0887675e56a9478be663807c79c3a8", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "idris/day3/day3.idr", "max_forks_repo_name": "hemslo/seven-in-seven", "max_forks_repo_head_hexsha": "5c772abf8e0887675e56a9478be663807c79c3a8", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 70.5555555556, "max_line_length": 304, "alphanum_fraction": 0.768503937, "num_tokens": 144, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.5736783928749127, "lm_q2_score": 0.6688802669716107, "lm_q1q2_score": 0.3837221565820162}} {"text": "module Proofs.TranslationInvarianceTheory\n\nimport Common.Util\nimport Specifications.DiscreteOrderedGroup\nimport Proofs.GroupCancelationLemmas\nimport Proofs.GroupTheory\nimport Proofs.TranslationInvarianceTheory\nimport Proofs.DiscreteOrderTheory\nimport Symmetry.Opposite\n\n%default total\n%access export\n\ninfixl 8 #\n\nrewriteBetween : a = c -> b = d -> Between leq (a,b) x -> Between leq (c,d) x\nrewriteBetween p q given = rewrite sym p in rewrite sym q in given\n\n\nweakenR : PartialOrderSpec rel ->\n rel b c -> Between rel (a,b) x -> Between rel (a,c) x\nweakenR spec bc (MkBetween ax xb) =\n MkBetween ax (transitive spec _ _ _ xb bc)\n\n\ninvertBetween : PartiallyOrderedGroupSpec _ _ inv rel ->\n Between rel (a,b) x -> Between rel (inv b, inv a) (inv x)\ninvertBetween spec (MkBetween ax xb) =\n MkBetween (inverseReversesOrder spec xb)\n (inverseReversesOrder spec ax)\n\n\ninvertSymRange : PartiallyOrderedGroupSpec _ _ inv rel ->\n InSymRange rel inv b x -> InSymRange rel inv b (inv x)\ninvertSymRange {b} spec given = rewriteBetween Refl o2 o1 where\n o1 : Between rel (inv b, inv (inv b)) (inv x)\n o1 = invertBetween spec given\n o2 : inv (inv b) = b\n o2 = groupInverseInvolution (group spec) b\n\n\ntranslateIntervalR : {(#) : Binop s} ->\n PartiallyOrderedMagmaSpec (#) leq -> (c : s) ->\n Between leq (a,b) x -> Between leq (a # c, b # c) (x # c)\ntranslateIntervalR spec c (MkBetween ax xb) = MkBetween\n (translationInvariantR spec _ _ _ ax)\n (translationInvariantR spec _ _ _ xb)\n\n\ntranslateIntervalL : {(#) : Binop s} ->\n PartiallyOrderedMagmaSpec (#) leq -> (c : s) ->\n Between leq (a,b) x -> Between leq (c # a, c # b) (c # x)\ntranslateIntervalL spec = translateIntervalR (opposite spec)\n\n\ncomposeIntervals : {(#) : Binop s} ->\n PartiallyOrderedMagmaSpec (#) leq ->\n Between leq (a,b) x ->\n Between leq (c,d) y ->\n Between leq (a # c, b # d) (x # y)\ncomposeIntervals spec (MkBetween ax xb) (MkBetween cy yd) = MkBetween\n (composeOrder spec _ _ _ _ ax cy)\n (composeOrder spec _ _ _ _ xb yd)\n\n\naddInSymRange : {(+) : Binop s} -> PartiallyOrderedGroupSpec (+) _ neg leq ->\n InSymRange leq neg a x ->\n InSymRange leq neg a y ->\n InSymRange leq neg (a + a) (x + y)\naddInSymRange {a} spec p q =\n rewrite groupInverseAnti (group spec) a a in\n composeIntervals (invariantOrder spec) p q\n\n\npublic export\ndecideBetween : Decidable [s,s] leq => (a,b,x : s) -> Dec (Between leq (a,b) x)\ndecideBetween a b x =\n decideBoth MkBetween betweenL betweenR\n (decision {rel = leq} a x)\n (decision {rel = leq} x b)\n\npublic export\ndecidePivot : Decidable [s,s] leq =>\n DiscreteOrderedGroupSpec add zero neg leq unit ->\n (p,x : s) ->\n Between leq (a,b) x ->\n EitherErased (Between leq (a,p) x)\n (Between leq (add unit p, b) x)\ndecidePivot {s} spec p x (MkBetween ax xb) =\n case separate spec x p of\n Left xp => Left (MkBetween ax xp)\n Right px => Right (MkBetween px xb)\n\npublic export\ndecidePivotBis : Decidable [s,s] leq =>\n DiscreteOrderedGroupSpec add zero neg leq unit ->\n (p,x : s) ->\n Between leq (a,b) x ->\n EitherErased (Between leq (a, add (neg unit) p) x)\n (Between leq (p, b) x)\ndecidePivotBis {s} spec p x (MkBetween ax xb) =\n case separateBis spec x p of\n Left xp => Left (MkBetween ax xp)\n Right px => Right (MkBetween px xb)\n\npublic export\ndecidePartition3 : Decidable [s,s] leq =>\n DiscreteOrderedGroupSpec add zero neg leq unit ->\n (p,q,x : s) ->\n Between leq (a,b) x ->\n Either3Erased (Between leq (a,p) x)\n (Between leq (add unit p, add (neg unit) q) x)\n (Between leq (q,b) x)\ndecidePartition3 spec p q x axb =\n case decidePivot spec p x axb of\n Left l => Left l\n Right pxb =>\n case decidePivotBis spec q x pxb of\n Left m => Middle m\n Right r => Right r\n", "meta": {"hexsha": "b3e5d6dac80194a31d82fe582b63b08f64e48a3c", "size": 3831, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Proofs/Interval.idr", "max_stars_repo_name": "jeroennoels/verified-algebra", "max_stars_repo_head_hexsha": "85dfd88fecaf32bd20de72923d2d10de59d8b859", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "src/Proofs/Interval.idr", "max_issues_repo_name": "jeroennoels/verified-algebra", "max_issues_repo_head_hexsha": "85dfd88fecaf32bd20de72923d2d10de59d8b859", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Proofs/Interval.idr", "max_forks_repo_name": "jeroennoels/verified-algebra", "max_forks_repo_head_hexsha": "85dfd88fecaf32bd20de72923d2d10de59d8b859", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 31.6611570248, "max_line_length": 79, "alphanum_fraction": 0.6601409554, "num_tokens": 1221, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6513548646660543, "lm_q2_score": 0.588889130767832, "lm_q1q2_score": 0.3835758000745916}} {"text": "module Sessions.Projection\n\nimport Decidable.Equality\nimport Data.List\nimport Data.List.Elem\n\nimport Data.List1\n\nimport Sessions.Meta\n\nimport Sessions.Global\nimport Sessions.Global.Involved\n\nimport Sessions.Local\nimport Sessions.Local.Same\nimport Sessions.Local.Same.All\n\nimport public Sessions.Projection.Error\n\n%hide Data.List.merge\n\n%default total\n\nmutual\n\n namespace Term\n public export\n data Project : (tyHowMerge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type)\n -> (role : typeR)\n -> (termG : Global typeR typeL typeM rs g)\n -> (termL : Local typeR typeL typeM rs g)\n -> Type\n where\n End : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> Project merge whom End End\n\n Call : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> Project merge whom (Call idx) (Call idx)\n\n Rec : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (rec : Term.Project merge whom x y)\n -> Term.Project merge whom (Rec x) (Rec y)\n\n ChoiceSelect : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (prfS : whom = s)\n -> (ss : List1.Project merge whom bs cs)\n\n -> Project merge whom (Choice s r notsr bs)\n (Choice SELECT r cs)\n\n ChoiceBranch : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (prfR : whom = r)\n -> (cs : List1.Project merge whom bs bs')\n -> Term.Project merge whom (Choice s r notsr bs)\n (Choice BRANCH s bs')\n\n\n ChoiceMerge : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (prfWS : Not (whom = s))\n -> (prfWR : Not (whom = r))\n\n -> (ss : List1.Project merge whom bs ((cl,cm,c):::cs))\n\n -> (prf : merge ((cl,cm,c):::cs) d)\n -> Project merge whom (Choice s r notsr bs)\n d\n\n namespace List\n\n public export\n data Project : (tyHowMerge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type)\n -> (role : typeR)\n -> (bs : List (typeL, typeM, Global typeR typeL typeM rs g))\n -> (bs' : List (typeL, typeM, Local typeR typeL typeM rs g))\n -> Type\n where\n Empty : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> Project merge whom Nil Nil\n\n Ext : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (this : Term.Project merge whom x y)\n -> (rest : List.Project merge whom xs ys)\n -> List.Project merge whom ((xl,xm,x)::xs) ((xl,xm,y)::ys)\n\n namespace List1\n\n public export\n data Project : (tyHowMerge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type)\n -> (role : typeR)\n -> (bs : List1 (typeL, typeM, Global typeR typeL typeM rs g))\n -> (bs' : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> Type\n where\n Proj : {merge : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (what : List.Project merge whom (b ::bs) (c ::cs))\n -> List1.Project merge whom (b:::bs) (c:::cs)\n\nmutual\n namespace Term\n\n public export\n project : DecEq typeR typeL typeM\n => {mergeTy : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (mergeOp : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> Maybe (that ** mergeTy this that))\n -> {rs : List Ty}\n -> {g : Ty}\n -> (role : typeR)\n -> (termG : Global typeR typeL typeM rs g)\n -> Maybe (termL ** Project mergeTy role termG termL)\n\n project _ _ End\n = Just (End ** End)\n\n project _ _ (Call x)\n = Just (Call x ** Call)\n\n project mergeOp role (Rec x)\n = do (x' ** prf) <- project mergeOp role x\n pure (Rec x' ** Rec prf)\n\n project mergeOp role (Choice s r notSR cs) with (involved role s r notSR)\n project mergeOp role (Choice role r notSR cs) | (Sends Refl)\n = do (cs' ** prf) <- project mergeOp role cs\n pure (Choice SELECT r cs' ** ChoiceSelect Refl prf)\n\n project mergeOp role (Choice s role notSR cs) | (Recvs Refl)\n = do (cs' ** prf) <- project mergeOp role cs\n pure (Choice BRANCH s cs' ** ChoiceBranch Refl prf)\n\n project mergeOp role (Choice s r notSR cs) | (Skips prfSNot prfRNot)\n = do ((l,(m,c')) ::: tail ** prfProj) <- project mergeOp role cs\n (c ** prfMerge) <- mergeOp ((l,(m,c')) ::: tail)\n pure (c ** ChoiceMerge prfSNot prfRNot prfProj prfMerge)\n\n namespace List\n\n public export\n project : DecEq typeR typeL typeM\n => {mergeTy : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (mergeOp : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> Maybe (that ** mergeTy this that))\n\n -> {rs : List Ty}\n -> {g : Ty}\n -> (role : typeR)\n -> (bs : List (typeL, typeM, Global typeR typeL typeM rs g))\n -> Maybe (bs' ** List.Project mergeTy role bs bs')\n\n project _ _ []\n = pure (Nil ** Empty)\n\n project mergeOp role ((l,(m,x)) :: xs)\n\n = do (x' ** prfX) <- Term.project mergeOp role x\n (xs' ** prfXs) <- List.project mergeOp role xs\n\n pure ((l,(m,x')) :: xs' ** Ext prfX prfXs)\n\n namespace List1\n\n public export\n project : DecEq typeR typeL typeM\n => {mergeTy : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> (that : Local typeR typeL typeM rs g)\n -> Type}\n -> (mergeOp : {rs : List Ty}\n -> {g : Ty}\n -> (this : List1 (typeL, typeM, Local typeR typeL typeM rs g))\n -> Maybe (that ** mergeTy this that))\n\n -> {rs : List Ty}\n -> {g : Ty}\n -> (role : typeR)\n -> (termG : List1 (typeL, typeM, Global typeR typeL typeM rs g))\n -> Maybe (termL ** Project mergeTy role termG termL)\n\n project mergeOp role (head ::: tail)\n = do (x::xs ** prf) <- List.project mergeOp role (head::tail)\n pure (x:::xs ** Proj prf)\n\n-- [ EOF ]\n", "meta": {"hexsha": "38acafd5632784a70e764de452e39a2f00b45590", "size": 10335, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Sessions/Projection.idr", "max_stars_repo_name": "DSbD-AppControl/sessions-playground", "max_stars_repo_head_hexsha": "d304de2a5bf9a5268f3cd8aef9402face1bc7fdc", "max_stars_repo_licenses": ["BSD-3-Clause-Clear"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2021-08-19T13:13:10.000Z", "max_stars_repo_stars_event_max_datetime": "2021-08-19T13:13:10.000Z", "max_issues_repo_path": "Sessions/Projection.idr", "max_issues_repo_name": "DSbD-AppControl/sessions-playground", "max_issues_repo_head_hexsha": "d304de2a5bf9a5268f3cd8aef9402face1bc7fdc", "max_issues_repo_licenses": ["BSD-3-Clause-Clear"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Sessions/Projection.idr", "max_forks_repo_name": "DSbD-AppControl/sessions-playground", "max_forks_repo_head_hexsha": "d304de2a5bf9a5268f3cd8aef9402face1bc7fdc", "max_forks_repo_licenses": ["BSD-3-Clause-Clear"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 42.1836734694, "max_line_length": 93, "alphanum_fraction": 0.395065312, "num_tokens": 2493, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.743168019989179, "lm_q2_score": 0.5156199157230157, "lm_q1q2_score": 0.38319223183486095}} {"text": "module Data.DPair\n\n%default total\n\nnamespace Exists\n\n ||| A dependent pair in which the first field (witness) should be\n ||| erased at runtime.\n |||\n ||| We can use `Exists` to construct dependent types in which the\n ||| type-level value is erased at runtime but used at compile time.\n ||| This type-level value could represent, for instance, a value\n ||| required for an intrinsic invariant required as part of the\n ||| dependent type's representation.\n |||\n ||| @type The type of the type-level value in the proof.\n ||| @this The dependent type that requires an instance of `type`.\n public export\n data Exists : (this : type -> Type) -> Type where\n Evidence : (0 value : type)\n -> (prf : this value)\n -> Exists this\n\n ||| Return the type-level value (evidence) required by the dependent type.\n |||\n ||| We need to be in the Erased setting for this to work.\n |||\n ||| @type The type-level value's type.\n ||| @pred The dependent type that requires an instance of `type`.\n ||| @prf That there is a value that satisfies `prf`.\n public export\n 0\n fst : {0 type : Type}\n -> {0 pred : type -> Type}\n -> (1 prf : Exists pred)\n -> type\n fst (Evidence value _) = value\n\n ||| Return the dependently typed value.\n |||\n ||| @type The type-level value's type.\n ||| @pred The dependent type that requires an instance of `type`.\n ||| @prf That there is a value that satisfies `prf`.\n public export\n snd : {0 type : Type}\n -> {0 pred : type -> Type}\n -> (1 prf : Exists pred)\n -> pred (Exists.fst prf)\n snd (Evidence value prf) = prf\n\nnamespace Subset\n\n ||| A dependent pair in which the second field (evidence) should not\n ||| be required at runtime.\n |||\n ||| We can use `Subset` to provide extrinsic invariants about a\n ||| value and know that these invariants are erased at\n ||| runtime but used at compile time.\n |||\n ||| @type The type-level value's type.\n ||| @pred The dependent type that requires an instance of `type`.\n public export\n data Subset : (type : Type)\n -> (pred : type -> Type)\n -> Type\n where\n Element : (value : type)\n -> (0 prf : pred value)\n -> Subset type pred\n\n ||| Return the type-level value (evidence) required by the dependent type.\n |||\n ||| @type The type-level value's type.\n ||| @pred The dependent type that requires an instance of `type`.\n ||| @prf That there is a value that satisfies `prf`.\n public export\n fst : {0 type : Type}\n -> {0 pred : type -> Type}\n -> (1 prf : Subset type pred)\n -> type\n fst (Element value prf) = value\n\n ||| Return the dependently typed value.\n |||\n ||| We need to be in the erased setting for this to work.\n |||\n ||| @type The type-level value's type.\n ||| @pred The dependent type that requires an instance of `type`.\n ||| @prf That there is a value that satisfies `prf`.\n public export\n 0\n snd : {0 type : Type}\n -> {0 pred : type -> Type}\n -> (1 value : Subset type pred)\n -> pred (Subset.fst value)\n snd (Element value prf) = prf\n", "meta": {"hexsha": "9e2b06160f1846b824ae14091d3a4c17c1621ea6", "size": 3085, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris2/libs/base/Data/DPair.idr", "max_stars_repo_name": "Qqwy/Idris2-Erlang", "max_stars_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "idris2/libs/base/Data/DPair.idr", "max_issues_repo_name": "Qqwy/Idris2-Erlang", "max_issues_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "idris2/libs/base/Data/DPair.idr", "max_forks_repo_name": "Qqwy/Idris2-Erlang", "max_forks_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 31.8041237113, "max_line_length": 76, "alphanum_fraction": 0.6213938412, "num_tokens": 852, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.658417500561683, "lm_q2_score": 0.5813030906443134, "lm_q1q2_score": 0.3827401280108103}} {"text": "||| Module that provides fixed-point number to represent seconds in nanoseconds.\nmodule Fixed\n\npublic export\ndata Fixed a = MkFixed Integer\n\npublic export\ndata E12\ndata E9\ndata E2\n\npublic export\nDec : Type\nDec = Fixed E2\n\npublic export\nPico : Type\nPico = Fixed E12\n\npublic export\nNano : Type\nNano = Fixed E9\n\n\npublic export\nShow (Fixed a) where\n show (MkFixed x) = show x\n\nexport\nEq (Fixed a) where\n (MkFixed a) == (MkFixed b) = a == b\n\nexport\nOrd (Fixed a) where\n compare (MkFixed a) (MkFixed b) = compare a b\n\nexport\ninterface HasResolution (a: Type) where\n resolution : (f : Type -> Type) -> f a -> Integer\n\nexport\nHasResolution E12 where\n resolution _ _ = 1000000000000\n\nexport\nHasResolution E2 where\n resolution _ _ = 100\n\npublic export\nEnum (Fixed a) where\n pred (MkFixed x) = MkFixed (pred x)\n toNat (MkFixed x) = toNat x\n fromNat x = MkFixed (toIntegerNat x)\n\n-- Currently unable to express `*` in terms of `div` due to totality checking\n-- implementation (HasResolution a) => Num (Fixed a) where\n-- (+) (MkFixed x) (MkFixed y) = MkFixed (x + y)\n-- (*) fa@(MkFixed x) (MkFixed y) = MkFixed (div (x * y) (resolution {a} Fixed fa))\n-- fromInteger x = MkFixed x\n\nexport\nadd: Fixed a -> Fixed a -> Fixed a\nadd (MkFixed x) (MkFixed y) = MkFixed (x + y)\n\nexport\n(+) : Fixed a -> Fixed a -> Fixed a\n(+) = add\n\nexport\nsub : Fixed a -> Fixed a -> Fixed a\nsub (MkFixed x) (MkFixed y) = MkFixed (x - y)\n\nexport\n(-) : Fixed a -> Fixed a -> Fixed a\n(-) = sub\n\nexport\nnegate: Fixed a -> Fixed a\nnegate (MkFixed x) = MkFixed (negate x)\n\nexport\nabs : Fixed a -> Fixed a\nabs (MkFixed x) = MkFixed (abs x)\n\nexport\nfromInteger : Integer -> Fixed a\nfromInteger x = MkFixed x\n\nexport\ntoRational : (HasResolution a) => Fixed a -> Double\ntoRational {a} fa@(MkFixed x) = (cast x) / cast (resolution {a} Fixed fa)\n\nexport\nmultFixed : (HasResolution a) => Fixed a -> Fixed a -> Fixed a\nmultFixed {a} fa@(MkFixed x) (MkFixed y) =\n let\n result = div (x * y) (resolution {a} Fixed fa)\n in\n MkFixed result\n\n--MkFixed (x * y * cast (1 / (resolution {a} Fixed fa)))\n\nexport\n(*) : (HasResolution a) => Fixed a -> Fixed a -> Fixed a\n(*) = multFixed\n\n\nexport\nfracDiv : (HasResolution a) => Fixed a -> Fixed a -> Fixed a\nfracDiv fa@(MkFixed x) (MkFixed y) = MkFixed (div (x * (resolution {a} Fixed fa)) y)\n\nexport\n(/): (HasResolution a) => Fixed a -> Fixed a -> Fixed a\n(/) = fracDiv\n\nexport\nrecip : (HasResolution a) => Fixed a -> Fixed a\nrecip {a} fa@(MkFixed x) = MkFixed (div ((resolution {a} Fixed fa) * (resolution {a} Fixed fa)) x)\n\n\n-- TODO:\n-- fromRationalFixed:\n\n-- implementation (HasResolution a) => Num (Fixed a) where\n-- (+) (MkFixed x) (MkFixed y) = addFixed\n-- (*) fa@(MkFixed x) (MkFixed y) = MkFixed (x * y * (resolution {a} Fixed fa))\n-- fromInteger x = MkFixed x\n\n--(HasResolution a) => Fractional (Fixed a) where\n-- (/) = fraceDivFixed\n-- --recip fa@(MkFixed x) =\n\n-- -- MkFixed (div (res * res) x)\n-- -- where\n-- -- res = (resolution {a} Fixed fa)\n\n-- partial\n-- implementation (HasResolution a) => Integral (Fixed a) where\n-- div (MkFixed x) (MkFixed y) = MkFixed (div x y)\n-- mod (MkFixed x) (MkFixed y) = MkFixed (mod x y)\n\n\n --fromRational r = withResolution (\\res -> MkFixed (floor (r * (toRational res))))\n\n -- (MkFixed a) + (MkFixed b) = MkFixed (a + b)\n -- (MkFixed a) - (MkFixed b) = MkFixed (a - b)\n -- fa@(MkFixed a) * (MkFixed b) = MkFixed (div (a * b) (resolution fa))\n -- negate (MkFixed a) = MkFixed (negate a)\n -- abs (MkFixed a) = MkFixed (abs a)\n -- signum (MkFixed a) = fromInteger (signum a)\n -- fromInteger i = withResolution (\\res -> MkFixed (i * res))\n", "meta": {"hexsha": "0ed2f37c25383813ca4f4faa918ca73e29b17df5", "size": 3671, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Data/Time/Clock/Internal/Fixed.idr", "max_stars_repo_name": "gdevanla/idris-time", "max_stars_repo_head_hexsha": "96a488057863d6c3049f62a1ac70734090e50b66", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2020-08-18T11:02:58.000Z", "max_stars_repo_stars_event_max_datetime": "2020-08-18T11:02:58.000Z", "max_issues_repo_path": "src/Data/Time/Clock/Internal/Fixed.idr", "max_issues_repo_name": "gdevanla/idris-time", "max_issues_repo_head_hexsha": "96a488057863d6c3049f62a1ac70734090e50b66", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 2, "max_issues_repo_issues_event_min_datetime": "2020-07-28T21:13:55.000Z", "max_issues_repo_issues_event_max_datetime": "2021-12-20T19:56:41.000Z", "max_forks_repo_path": "src/Data/Time/Clock/Internal/Fixed.idr", "max_forks_repo_name": "gdevanla/idris-time", "max_forks_repo_head_hexsha": "96a488057863d6c3049f62a1ac70734090e50b66", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 24.1513157895, "max_line_length": 98, "alphanum_fraction": 0.6281667121, "num_tokens": 1243, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7310585903489892, "lm_q2_score": 0.523420348936324, "lm_q1q2_score": 0.3826509424533651}} {"text": "module IxFreer\n\nEff : Type -> Type\nEff r = r -> (a : Type) -> (a -> r) -> Type\n\ndata IxFreer : {r : Type} -> (f : Eff r) -> Eff r where\n Pure : (x : a) -> IxFreer f (s' x) a s'\n Bind : {f : Eff r} -> f s a s' -> ((x : a) -> IxFreer f (s' x) b s'') -> IxFreer f s b s''\n\n\n(>>=) : IxFreer f s a s' -> ((x : a) -> IxFreer f (s' x) b s'') -> IxFreer f s b s''\n(>>=) (Pure x) f = f x\n(>>=) (Bind x f) g = Bind x (\\y => f y >>= g)\n\n-- Example from https://www.idris-lang.org/drafts/sms.pdf\ndata Access = LoggedOut | LoggedIn\ndata LoginResult = OK | BadPassword\n\ndata Store : Access -> (ty : Type) -> (ty -> Access) -> Type where\n Login : Store LoggedOut LoginResult (\\res => case res of\n OK => LoggedIn\n BadPassword => LoggedOut)\n\n Logout : Store LoggedIn () (const LoggedOut)\n ReadSecret : Store LoggedIn String (const LoggedIn)\n Lift : IO ty -> Store st ty (const st)\n\n\nlogin : IxFreer Store LoggedOut LoginResult (\\res => case res of\n OK => LoggedIn\n BadPassword => LoggedOut)\nlogin = Bind Login Pure\n\nlogout : IxFreer Store LoggedIn () (const LoggedOut)\nlogout = Bind Logout Pure\n\nreadSecret : IxFreer Store LoggedIn String (const LoggedIn)\nreadSecret = Bind ReadSecret Pure\n\nlift : IO ty -> IxFreer Store st ty (const st)\nlift io = Bind (Lift io) Pure\n\ngetData : IxFreer Store LoggedOut () (const LoggedOut)\ngetData = do result <- login\n case result of\n OK => do secret <- readSecret\n lift (putStr (\"Secret: \" ++ show secret ++ \"\\n\"))\n logout\n BadPassword => lift (putStr \"Failure\\n\")\n\nrun : IxFreer Store s () s' -> IO ()\nrun (Pure x) = pure x\nrun (Bind Login g) = run (g OK)\nrun (Bind Logout g) = run (g ())\nrun (Bind ReadSecret g) = run (g \"secret\")\nrun (Bind (Lift io) g) = io >>= \\x => run (g x)\n\ntest : IO ()\ntest = run getData\n", "meta": {"hexsha": "295bb1b5f84ce132413a0e86d7d577fb54309d28", "size": 2029, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/IxFreer.idr", "max_stars_repo_name": "STELIORD/idris-snippets", "max_stars_repo_head_hexsha": "f5ca6fa86370d24587040af9871ae850bbc630c2", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2017-11-21T22:28:51.000Z", "max_stars_repo_stars_event_max_datetime": "2020-10-05T18:25:18.000Z", "max_issues_repo_path": "src/IxFreer.idr", "max_issues_repo_name": "stjordanis/idris-snippets", "max_issues_repo_head_hexsha": "d92734b8624ae27be21a63fcb041077b38eaaecb", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/IxFreer.idr", "max_forks_repo_name": "stjordanis/idris-snippets", "max_forks_repo_head_hexsha": "d92734b8624ae27be21a63fcb041077b38eaaecb", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-05-06T13:39:44.000Z", "max_forks_repo_forks_event_max_datetime": "2020-10-21T15:39:16.000Z", "avg_line_length": 33.8166666667, "max_line_length": 92, "alphanum_fraction": 0.5288319369, "num_tokens": 589, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7520125848754472, "lm_q2_score": 0.5078118642792044, "lm_q1q2_score": 0.3818809126870243}} {"text": "-- Implementation based on https://www.newspipe.org/article/public/309714\n\nmodule Crypto.Hash.Poly1305\n\nimport Data.Vect\nimport Utils.Misc\nimport Utils.Bytes\nimport Data.Bits\nimport Crypto.Hash\n\nexport\nrecord Poly1305 where\n constructor MkPoly1305\n buffer : List Bits8\n h : Vect 3 Bits64\n r : Vect 2 Bits64\n s : Vect 2 Bits64\n\nrecord Bits128 where\n constructor MkBits128\n lo : Bits64\n hi : Bits64\n\nmask_low_2_bits : Bits64\nmask_low_2_bits = 0x0000000000000003\n\nmask_not_low_2_bits : Bits64\nmask_not_low_2_bits = complement mask_low_2_bits\n\np0 : Bits64\np0 = 0xFFFFFFFFFFFFFFFB\n\np1 : Bits64\np1 = 0xFFFFFFFFFFFFFFFF\n\np2 : Bits64\np2 = 0x0000000000000003\n\nadd64 : Bits64 -> Bits64 -> Bits64 -> (Bits64, Bits64)\nadd64 x y carry =\n let sum = x + y + carry\n carry = shiftR ((x .&. y) .|. ((x .|. y) .&. (complement sum))) 63\n in (sum, carry)\n\nsub64 : Bits64 -> Bits64 -> Bits64 -> (Bits64, Bits64)\nsub64 x y borrow =\n let diff = x - y - borrow\n borrow_out = shiftR ((complement x .&. y) .|. (diff .&. complement (x `xor` y))) 63\n in (diff, borrow_out)\n\nmul64_mask32 : Bits64\nmul64_mask32 = cast (the Bits32 oneBits)\n\nmul64 : Bits64 -> Bits64 -> Bits128\nmul64 x y =\n let x0 = x .&. mul64_mask32\n x1 = shiftR x 32\n y0 = y .&. mul64_mask32\n y1 = shiftR y 32\n w0 = x0 * y0\n t = (x1 * y0) + (shiftR w0 32)\n w1 = t .&. mul64_mask32\n w2 = shiftR t 32\n w1 = w1 + (x0 * y1)\n in MkBits128 (x * y) (x1 * y1 + w2 + (shiftR w1 32))\n\nadd128 : Bits128 -> Bits128 -> Bits128\nadd128 a b =\n let (lo, c) = add64 a.lo b.lo 0\n (hi, _) = add64 a.hi b.hi c\n in MkBits128 lo hi\n\nshiftr2 : Bits128 -> Bits128\nshiftr2 a = MkBits128 ((shiftR a.lo 2) .|. (shiftL (a.hi .&. 3) 62)) (shiftR a.hi 2)\n\n-- select64 returns x if v == 1 and y if v == 0, in constant time\nselect64 : Bits64 -> Bits64 -> Bits64 -> Bits64\nselect64 v x y = (x .&. complement (v - 1)) .|. (y .&. (v - 1))\n\ncore : Poly1305 -> Bits64 -> Bits64 -> Bits64 -> (Bits64, Bits64, Bits64)\ncore state h0 h1 h2 =\n let [r0, r1] = state.r\n\n h0r0 = mul64 h0 r0\n h1r0 = mul64 h1 r0\n h2r0 = mul64 h2 r0\n h0r1 = mul64 h0 r1\n h1r1 = mul64 h1 r1\n h2r1 = mul64 h2 r1\n\n m0 = h0r0\n m1 = add128 h1r0 h0r1\n m2 = add128 h2r0 h1r1\n m3 = h2r1\n\n t0 = m0.lo\n (t1, c) = add64 m1.lo m0.hi 0\n (t2, c) = add64 m2.lo m1.hi c\n (t3, _) = add64 m3.lo m2.hi c\n\n h0 = t0\n h1 = t1\n h2 = t2 .&. mask_low_2_bits\n cc = MkBits128 (t2 .&. mask_not_low_2_bits) t3\n\n (h0, c) = add64 h0 cc.lo 0\n (h1, c) = add64 h1 cc.hi c\n h2 = h2 + c\n\n cc = shiftr2 cc\n\n (h0, c) = add64 h0 cc.lo 0\n (h1, c) = add64 h1 cc.hi c\n h2 = h2 + c\n in (h0, h1, h2)\n\nupdate' : Poly1305 -> Poly1305\nupdate' state =\n case splitAtExact 16 state.buffer of\n Just (buf, rest) =>\n let (a, b) = bimap from_le from_le (splitAt 8 buf)\n [h0, h1, h2] = state.h\n (h0, c) = add64 h0 a 0\n (h1, c) = add64 h1 b c\n h2 = h2 + c + 1\n (h0, h1, h2) = core state h0 h1 h2\n in {h := [h0, h1, h2]} state\n Nothing => state\n\nfinalize' : Poly1305 -> Vect 16 Bits8\nfinalize' state =\n case exactLength 16 (fromList state.buffer) of\n Just buf =>\n let (a, b) = bimap from_le from_le (splitAt 8 buf)\n [h0, h1, h2] = state.h\n (h0, c) = add64 h0 a 0\n (h1, c) = add64 h1 b c\n h2 = h2 + c\n (h0, h1, h2) = core state h0 h1 h2\n\n (t0, b) = sub64 h0 p0 0\n (t1, b) = sub64 h1 p1 b\n (_ , b) = sub64 h2 p2 b\n\n h0 = select64 b h0 t0\n h1 = select64 b h1 t1\n\n [s0, s1] = state.s\n (h0, c) = add64 h0 s0 0\n (h1, _) = add64 h1 s1 c\n in to_le {n=8} h0 ++ to_le {n=8} h1\n Nothing =>\n finalize' $ { buffer := pad_zero 16 (state.buffer <+> [ 0x01 ]) } (update' state)\n\nexport\nDigest Poly1305 where\n digest_nbyte = 16\n update message state = update' $ {buffer := state.buffer <+> message} state\n finalize = finalize'\n\nexport\nMAC (Vect 32 Bits8) Poly1305 where\n initialize_mac key =\n let ([r0, r1], s) = splitAt 2 $ map from_le $ group 4 8 key\n r0 = r0 .&. 0x0FFFFFFC0FFFFFFF\n r1 = r1 .&. 0x0FFFFFFC0FFFFFFC\n in MkPoly1305 [] [0,0,0] [r0, r1] s\n", "meta": {"hexsha": "9282409f2d294b99d3e6a2c832185fe60dd511fa", "size": 4276, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Crypto/Hash/Poly1305.idr", "max_stars_repo_name": "octeep/idris2-tls", "max_stars_repo_head_hexsha": "951bef674c41f059d5ccddf568b45588b5dbceee", "max_stars_repo_licenses": ["ISC"], "max_stars_count": 28, "max_stars_repo_stars_event_min_datetime": "2021-12-23T15:57:17.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-26T11:00:15.000Z", "max_issues_repo_path": "src/Crypto/Hash/Poly1305.idr", "max_issues_repo_name": "octeep/idris2-tls", "max_issues_repo_head_hexsha": "951bef674c41f059d5ccddf568b45588b5dbceee", "max_issues_repo_licenses": ["ISC"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Crypto/Hash/Poly1305.idr", "max_forks_repo_name": "octeep/idris2-tls", "max_forks_repo_head_hexsha": "951bef674c41f059d5ccddf568b45588b5dbceee", "max_forks_repo_licenses": ["ISC"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 25.4523809524, "max_line_length": 89, "alphanum_fraction": 0.5713283442, "num_tokens": 1727, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.746138993030751, "lm_q2_score": 0.5117166047041654, "lm_q1q2_score": 0.38181171215108084}} {"text": "module Data.Bits\n\nimport Data.DPair\nimport public Data.Nat\n\n%default total\n\ninfixl 8 `shiftL`, `shiftR`\ninfixl 7 .&.\ninfixl 6 `xor`\ninfixl 5 .|.\n\n||| Utility for using bitwise operations at compile\n||| time.\n|||\n||| ```idris example\n||| the Bits8 13 `shiftL` fromNat 3\n||| ```\nexport\nfromNat : (k : Nat)\n -> {n : Nat}\n -> {auto 0 prf : lt k n === True}\n -> Subset Nat (`LT` n)\nfromNat k = Element k (ltReflectsLT k n prf)\n\n--------------------------------------------------------------------------------\n-- Interface Bits\n--------------------------------------------------------------------------------\n\n||| The `Bits` interface defines bitwise operations over integral types.\npublic export\ninterface Bits a where\n 0 Index : Type\n\n ||| Bitwise \"and\"\n (.&.) : a -> a -> a\n\n ||| Bitwise \"or\"\n (.|.) : a -> a -> a\n\n ||| Bitwise \"xor\".\n xor : a -> a -> a\n\n ||| Shift the argument left by the specified number of bits.\n shiftL : a -> Index -> a\n\n ||| Shift the argument right by the specified number of bits.\n shiftR : a -> Index -> a\n\n ||| Sets the `i`-th bit.\n bit : (i : Index) -> a\n\n ||| The value with all bits unset.\n zeroBits : a\n\n ||| Returns the bitwise complement of a value.\n complement : a -> a\n\n ||| The value with all bits set..\n oneBits : a\n oneBits = complement zeroBits\n\n ||| `complementBit x i` is the same as `xor x (bit i)`.\n complementBit : (x : a) -> (i : Index) -> a\n complementBit x i = x `xor` bit i\n\n ||| `clearBit x i` is the same as `x .&. complement (bit i)`\n clearBit : (x : a) -> (i : Index) -> a\n clearBit x i = x `xor` (bit i .&. x)\n\n ||| Tests, whether the i-th bit is set in the given value.\n testBit : a -> Index -> Bool\n\n ||| Sets the i-th bit of a value.\n setBit : a -> (i : Index) -> a\n setBit x i = x .|. bit i\n\npublic export %inline\nBits Bits8 where\n Index = Subset Nat (`LT` 8)\n (.&.) = prim__and_Bits8\n (.|.) = prim__or_Bits8\n xor = prim__xor_Bits8\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Bits8 x . cast . fst\n shiftL x = prim__shl_Bits8 x . cast . fst\n complement = xor 0xff\n oneBits = 0xff\n\npublic export %inline\nBits Bits16 where\n Index = Subset Nat (`LT` 16)\n (.&.) = prim__and_Bits16\n (.|.) = prim__or_Bits16\n xor = prim__xor_Bits16\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Bits16 x . cast . fst\n shiftL x = prim__shl_Bits16 x . cast . fst\n complement = xor 0xffff\n oneBits = 0xffff\n\npublic export %inline\nBits Bits32 where\n Index = Subset Nat (`LT` 32)\n (.&.) = prim__and_Bits32\n (.|.) = prim__or_Bits32\n xor = prim__xor_Bits32\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Bits32 x . cast . fst\n shiftL x = prim__shl_Bits32 x . cast . fst\n complement = xor 0xffffffff\n oneBits = 0xffffffff\n\npublic export %inline\nBits Bits64 where\n Index = Subset Nat (`LT` 64)\n (.&.) = prim__and_Bits64\n (.|.) = prim__or_Bits64\n xor = prim__xor_Bits64\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Bits64 x . cast . fst\n shiftL x = prim__shl_Bits64 x . cast . fst\n complement = xor 0xffffffffffffffff\n oneBits = 0xffffffffffffffff\n\npublic export %inline\nBits Int where\n Index = Subset Nat (`LT` 64)\n (.&.) = prim__and_Int\n (.|.) = prim__or_Int\n xor = prim__xor_Int\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Int x . cast . fst\n shiftL x = prim__shl_Int x . cast . fst\n complement = xor (-1)\n oneBits = (-1)\n\npublic export %inline\nBits Int8 where\n Index = Subset Nat (`LT` 8)\n (.&.) = prim__and_Int8\n (.|.) = prim__or_Int8\n xor = prim__xor_Int8\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Int8 x . cast . fst\n shiftL x = prim__shl_Int8 x . cast . fst\n complement = xor (-1)\n oneBits = (-1)\n\npublic export %inline\nBits Int16 where\n Index = Subset Nat (`LT` 16)\n (.&.) = prim__and_Int16\n (.|.) = prim__or_Int16\n xor = prim__xor_Int16\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Int16 x . cast . fst\n shiftL x = prim__shl_Int16 x . cast . fst\n complement = xor (-1)\n oneBits = (-1)\n\npublic export %inline\nBits Int32 where\n Index = Subset Nat (`LT` 32)\n (.&.) = prim__and_Int32\n (.|.) = prim__or_Int32\n xor = prim__xor_Int32\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Int32 x . cast . fst\n shiftL x = prim__shl_Int32 x . cast . fst\n complement = xor (-1)\n oneBits = (-1)\n\npublic export %inline\nBits Int64 where\n Index = Subset Nat (`LT` 64)\n (.&.) = prim__and_Int64\n (.|.) = prim__or_Int64\n xor = prim__xor_Int64\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Int64 x . cast . fst\n shiftL x = prim__shl_Int64 x . cast . fst\n complement = xor (-1)\n oneBits = (-1)\n\npublic export %inline\nBits Integer where\n Index = Nat\n (.&.) = prim__and_Integer\n (.|.) = prim__or_Integer\n xor = prim__xor_Integer\n bit = (1 `shiftL`)\n zeroBits = 0\n testBit x i = (x .&. bit i) /= 0\n shiftR x = prim__shr_Integer x . natToInteger\n shiftL x = prim__shl_Integer x . natToInteger\n complement = xor (-1)\n oneBits = (-1)\n\n--------------------------------------------------------------------------------\n-- FiniteBits\n--------------------------------------------------------------------------------\n\npublic export\ninterface Bits a => FiniteBits a where\n ||| Return the number of bits in values of type `t`.\n bitSize : Nat\n\n ||| Properly correlates `bitSize` and `Index`.\n bitsToIndex : Subset Nat (`LT` bitSize) -> Index {a}\n\n ||| Return the number of set bits in the argument. This number is\n ||| known as the population count or the Hamming weight.\n popCount : a -> Nat\n\npublic export %inline\nFiniteBits Bits8 where\n bitSize = 8\n bitsToIndex = id\n\n popCount x0 =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\n let x1 = (x0 .&. 0x55) + ((x0 `shiftR` fromNat 1) .&. 0x55)\n x2 = (x1 .&. 0x33) + ((x1 `shiftR` fromNat 2) .&. 0x33)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F)\n in cast x3\n\npublic export %inline\nFiniteBits Bits16 where\n bitSize = 16\n bitsToIndex = id\n\n popCount x0 =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\n let x1 = (x0 .&. 0x5555) + ((x0 `shiftR` fromNat 1) .&. 0x5555)\n x2 = (x1 .&. 0x3333) + ((x1 `shiftR` fromNat 2) .&. 0x3333)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F0F)\n x4 = (x3 * 0x0101) `shiftR` fromNat 8\n in cast x4\n\npublic export %inline\nFiniteBits Bits32 where\n bitSize = 32\n bitsToIndex = id\n\n popCount x0 =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\n let x1 = (x0 .&. 0x55555555) + ((x0 `shiftR` fromNat 1) .&. 0x55555555)\n x2 = (x1 .&. 0x33333333) + ((x1 `shiftR` fromNat 2) .&. 0x33333333)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F0F0F0F)\n x4 = (x3 * 0x01010101) `shiftR` fromNat 24\n in cast x4\n\npublic export %inline\nFiniteBits Bits64 where\n bitSize = 64\n bitsToIndex = id\n\n popCount x0 =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-64-bit-integer\n let x1 = (x0 .&. 0x5555555555555555) +\n ((x0 `shiftR` fromNat 1) .&. 0x5555555555555555)\n x2 = (x1 .&. 0x3333333333333333)\n + ((x1 `shiftR` fromNat 2) .&. 0x3333333333333333)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F0F0F0F)\n x4 = (x3 * 0x0101010101010101) `shiftR` fromNat 56\n in cast x4\n\npublic export %inline\nFiniteBits Int where\n bitSize = 64\n bitsToIndex = id\n\n popCount x =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\n -- We have to treat negative numbers separately in order to\n -- prevent overflows in the first addition.\n -- The top bit is therefore cleared and 1 is added in the end\n -- in case of a negative number\n let x0 = x `clearBit` fromNat 63\n x1 = (x0 .&. 0x5555555555555555)\n + ((x0 `shiftR` fromNat 1) .&. 0x5555555555555555)\n x2 = (x1 .&. 0x3333333333333333)\n + ((x1 `shiftR` fromNat 2) .&. 0x3333333333333333)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F0F0F0F0F0F0F0F)\n x4 = (x3 * 0x0101010101010101) `shiftR` fromNat 56\n x5 = if x < 0 then x4 + 1 else x4\n in cast x5\n\npublic export %inline\nFiniteBits Int8 where\n bitSize = 8\n bitsToIndex = id\n\n popCount x =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\n -- We have to treat negative numbers separately in order to\n -- prevent overflows in the first addition.\n -- The top bit is therefore cleared and 1 is added in the end\n -- in case of a negative number\n let x0 = x `clearBit` fromNat 7\n x1 = (x0 .&. 0x55) + ((x0 `shiftR` fromNat 1) .&. 0x55)\n x2 = (x1 .&. 0x33) + ((x1 `shiftR` fromNat 2) .&. 0x33)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F)\n x4 = if x < 0 then x3 + 1 else x3\n in cast x4\n\npublic export %inline\nFiniteBits Int16 where\n bitSize = 16\n bitsToIndex = id\n\n popCount x =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\n -- We have to treat negative numbers separately in order to\n -- prevent overflows in the first addition.\n -- The top bit is therefore cleared and 1 is added in the end\n -- in case of a negative number\n let x0 = x `clearBit` fromNat 15\n x1 = (x0 .&. 0x5555) + ((x0 `shiftR` fromNat 1) .&. 0x5555)\n x2 = (x1 .&. 0x3333) + ((x1 `shiftR` fromNat 2) .&. 0x3333)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F0F)\n x4 = (x3 * 0x0101) `shiftR` fromNat 8\n x5 = if x < 0 then x4 + 1 else x4\n in cast x5\n\npublic export %inline\nFiniteBits Int32 where\n bitSize = 32\n bitsToIndex = id\n\n popCount x =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\n -- We have to treat negative numbers separately in order to\n -- prevent overflows in the first addition.\n -- The top bit is therefore cleared and 1 is added in the end\n -- in case of a negative number\n let x0 = x `clearBit` fromNat 31\n x1 = (x0 .&. 0x55555555) + ((x0 `shiftR` fromNat 1) .&. 0x55555555)\n x2 = (x1 .&. 0x33333333) + ((x1 `shiftR` fromNat 2) .&. 0x33333333)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F0F0F0F)\n x4 = (x3 * 0x01010101) `shiftR` fromNat 24\n x5 = if x < 0 then x4 + 1 else x4\n in cast x5\n\npublic export %inline\nFiniteBits Int64 where\n bitSize = 64\n bitsToIndex = id\n\n popCount x =\n -- see https://stackoverflow.com/questions/109023/how-to-count-the-number-of-set-bits-in-a-32-bit-integer\n -- We have to treat negative numbers separately in order to\n -- prevent overflows in the first addition.\n -- The top bit is therefore cleared and 1 is added in the end\n -- in case of a negative number\n let x0 = x `clearBit` fromNat 63\n x1 = (x0 .&. 0x5555555555555555)\n + ((x0 `shiftR` fromNat 1) .&. 0x5555555555555555)\n x2 = (x1 .&. 0x3333333333333333)\n + ((x1 `shiftR` fromNat 2) .&. 0x3333333333333333)\n x3 = ((x2 + (x2 `shiftR` fromNat 4)) .&. 0x0F0F0F0F0F0F0F0F)\n x4 = (x3 * 0x0101010101010101) `shiftR` fromNat 56\n x5 = if x < 0 then x4 + 1 else x4\n in cast x5\n", "meta": {"hexsha": "800f4c65f116171bda3bce8e7027bd1bd3ac0fd6", "size": 12226, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "libs/base/Data/Bits.idr", "max_stars_repo_name": "ska80/idris-jvm", "max_stars_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "libs/base/Data/Bits.idr", "max_issues_repo_name": "ska80/idris-jvm", "max_issues_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "libs/base/Data/Bits.idr", "max_forks_repo_name": "ska80/idris-jvm", "max_forks_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 31.8385416667, "max_line_length": 109, "alphanum_fraction": 0.5768853264, "num_tokens": 4343, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7185943925708562, "lm_q2_score": 0.5312093733737563, "lm_q1q2_score": 0.3817240769874596}} {"text": "module SmallStepImp\n\nimport Expr\nimport Imp\nimport Maps\nimport SmallStepExpr\n\n%access public export\n\n%default total\n\ndata CStep : (Com, State) -> (Com, State) -> Type where\n CS_AssStep : AStep st a a' -> CStep (i ::= a, st) (i ::= a', st)\n CS_Ass : CStep (i ::= ANum n, st) (SKIP, t_update i n st)\n CS_SeqStep : CStep (c1, st) (c1', st') ->\n CStep ((do c1; c2), st) ((do c1'; c2), st')\n CS_SeqFinish : CStep ((do SKIP; c2), st) (c2, st)\n CS_IfStep : BStep st b b' -> CStep (CIf b c1 c2, st) (CIf b' c1 c2, st)\n CS_IfTrue : CStep (CIf BTrue c1 c2, st) (c1, st)\n CS_IfFalse : CStep (CIf BFalse c1 c2, st) (c2, st)\n CS_While : CStep (WHILE b c, st) (CIf b (do c; WHILE b c) SKIP, st)\n\nsyntax [t] \"/\" [st] \"-+>\" [t'] \"/\" [st'] = CStep (t, st) (t', st')\n", "meta": {"hexsha": "1fd7ac663a8634bc92ee27cbc79b36e8b33d10f0", "size": 771, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "SmallStepImp.idr", "max_stars_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_stars_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "SmallStepImp.idr", "max_issues_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_issues_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "SmallStepImp.idr", "max_forks_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_forks_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 32.125, "max_line_length": 73, "alphanum_fraction": 0.5784695201, "num_tokens": 318, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6926419704455589, "lm_q2_score": 0.5506073655352404, "lm_q1q2_score": 0.381373770606167}} {"text": "module Sub10Apply108x18\r\n\r\nimport ProofColDivSeqBase\r\nimport ProofColDivSeqPostulate\r\n\r\n%default total\r\n-- %language ElabReflection\r\n\r\n\r\n-- 3(36x+6) --F[5,-2]->E[2,-4]--> 3(8x+1)\r\nfe108x18To24x3 :\r\n (o:Nat) -> P (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o))))))))) 2\r\n -> P (S (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))) 2\r\nfe108x18To24x3 o prf =\r\n let prf2 = lvDown (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o))))))))) 2\r\n prf in\r\n let prf3 = fe108x18To24x3' o prf2 in lvDown (S (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))) 3 prf3\r\n\r\n\r\nexport\r\napply108x18 : P (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o))))))))) 2\r\n -> (m : Nat **\r\n (LTE (S m)\r\n (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o))))))))),\r\n P m 2))\r\napply108x18 {o} col = let col2 = fe108x18To24x3 o col in ((S (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n ** (lte108x18 o, col2)) where\r\n lte108x18 : (o:Nat) -> LTE (S (S (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))))\r\n (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))))))))\r\n lte108x18 Z = (lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . LTESucc . LTESucc) LTEZero\r\n lte108x18 (S o) = let lemma = lte108x18 o in\r\n rewrite (sym (plusSuccRightSucc o o)) in\r\n rewrite (sym (plusSuccRightSucc (plus o o) (S (plus o o)))) in\r\n rewrite (sym (plusSuccRightSucc (plus o o) (plus o o))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (S (S (plus (plus o o) (plus o o))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (S (plus (plus o o) (plus o o)))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (plus (plus o o) (plus o o))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus o o) o)) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (S (S (plus (plus o o) o))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (S (plus (plus o o) o)))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (plus (plus o o) o))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o)) (S (S (S (S (S (plus (plus (plus o o) o) (plus (plus o o) o))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o)) (S (S (S (S (plus (plus (plus o o) o) (plus (plus o o) o)))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o)) (S (S (S (plus (plus (plus o o) o) (plus (plus o o) o))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o)) (S (S (plus (plus (plus o o) o) (plus (plus o o) o)))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o)) (S (plus (plus (plus o o) o) (plus (plus o o) o))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (plus (plus o o) o)) (plus (plus (plus o o) o) (plus (plus o o) o)))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o)))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o)))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o)))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o)))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o)))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o) o)))))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o)))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o)))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o)))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o)))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o)))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))\r\n (S (plus (plus (plus (plus o o) o) (plus (plus o o) o))\r\n (plus (plus (plus o o) o) (plus (plus o o) o)))))\r\n (S (plus (plus (plus (plus o o) o)\r\n (plus (plus o o) o))\r\n (plus (plus (plus o o) o)\r\n (plus (plus o o)\r\n o)))))) in\r\n (lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc) lemma\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "meta": {"hexsha": "044fadedb94eaf5ac58d4ad777298fd0570b45a2", "size": 29476, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "program/Sub10Apply108x18.idr", "max_stars_repo_name": "righ1113/collatzProof_DivSeq", "max_stars_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "program/Sub10Apply108x18.idr", "max_issues_repo_name": "righ1113/collatzProof_DivSeq", "max_issues_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 3, "max_issues_repo_issues_event_min_datetime": "2019-01-26T12:59:21.000Z", "max_issues_repo_issues_event_max_datetime": "2019-10-19T07:02:00.000Z", "max_forks_repo_path": "program/Sub10Apply108x18.idr", "max_forks_repo_name": "righ1113/collatzProof_DivSeq", "max_forks_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 116.5059288538, "max_line_length": 512, "alphanum_fraction": 0.2451146696, "num_tokens": 5594, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.7956581000631542, "lm_q2_score": 0.476579651063676, "lm_q1q2_score": 0.37919445969408544}} {"text": "||| Module partially based on McBride's paper:\n||| Turing-Completeness Totally Free\n|||\n||| It gives us a type to describe computation using general recursion\n||| and functions to run these computations for a while or to completion\n||| if we are able to prove them total.\n|||\n||| The content of the Erased section is new. Instead of producing the\n||| domain/evaluation pair by computing a Dybjer-Setzer code we build a\n||| specialised structure that allows us to make the domain proof runtime\n||| irrelevant.\n\nmodule Data.Recursion.Free\n\nimport Data.Late\nimport Data.InductionRecursion.DybjerSetzer\n\n%default total\n\n------------------------------------------------------------------------\n-- Type\n\n||| Syntax for a program using general recursion\npublic export\ndata General : (a : Type) -> (b : a -> Type) -> (x : Type) -> Type where\n ||| We can return a value without performing any recursive call.\n Tell : x -> General a b x\n ||| Or we can pick an input and ask an oracle to give us a return value\n ||| for it. The second argument is a continuation explaining what we want\n ||| to do with the returned value.\n Ask : (i : a) -> (b i -> General a b x) -> General a b x\n\n||| Type of functions using general recursion\npublic export\nPiG : (a : Type) -> (b : a -> Type) -> Type\nPiG a b = (i : a) -> General a b (b i)\n\n||| Recursor for General\npublic export\nfold : (x -> y) -> ((i : a) -> (b i -> y) -> y) -> General a b x -> y\nfold pure ask (Tell x) = pure x\nfold pure ask (Ask i k) = ask i (\\ o => fold pure ask (k o))\n\n------------------------------------------------------------------------\n-- Basic functions\n\n||| Perform a recursive call and return the value provided by the oracle.\npublic export\ncall : PiG a b\ncall i = Ask i Tell\n\n||| Monadic bind (defined outside of the interface to be able to use it for\n||| map and (<*>)).\npublic export\nbind : General a b x -> (x -> General a b y) -> General a b y\nbind m f = fold f Ask m\n\n||| Given a monadic oracle we can give a monad morphism interpreting a\n||| function using general recursion as a monadic process.\npublic export\nmonadMorphism : Monad m => (t : (i : a) -> m (b i)) -> General a b x -> m x\nmonadMorphism t = fold pure (\\ i => (t i >>=))\n\n------------------------------------------------------------------------\n-- Instances\n\npublic export\nFunctor (General a b) where\n map f = fold (Tell . f) Ask\n\npublic export\nApplicative (General a b) where\n pure = Tell\n gf <*> gv = bind gf (\\ f => map (f $) gv)\n\npublic export\nMonad (General a b) where\n (>>=) = bind\n\n------------------------------------------------------------------------\n-- Fuel-based (partial) evaluation\n\n||| Check whehther we are ready to return a value\npublic export\nalready : General a b x -> Maybe x\nalready = monadMorphism (\\ i => Nothing)\n\n||| Use a function using general recursion to expand all of the oracle calls.\npublic export\nexpand : PiG a b -> General a b x -> General a b x\nexpand f = monadMorphism f\n\n||| Recursively call expand a set number of times.\npublic export\nengine : PiG a b -> Nat -> General a b x -> General a b x\nengine f Z = id\nengine f (S n) = engine f n . expand f\n\n||| Check whether recursively calling expand a set number of times is enough\n||| to produce a value.\npublic export\npetrol : PiG a b -> Nat -> (i : a) -> Maybe (b i)\npetrol f n i = already $ engine f n $ f i\n\n------------------------------------------------------------------------\n-- Late-based evaluation\n\n||| Rely on an oracle using general recursion to convert a function using\n||| general recursion into a process returning a value in the (distant) future.\npublic export\nlate : PiG a b -> General a b x -> Late x\nlate f = monadMorphism (\\ i => Later (assert_total $ late f (f i)))\n\n||| Interpret a function using general recursion as a process returning\n||| a value in the (distant) future.\npublic export\nlazy : PiG a b -> (i : a) -> Late (b i)\nlazy f i = late f (f i)\n\n------------------------------------------------------------------------\n-- Domain as a Dybjer-Setzer code and total evaluation function\n\nnamespace DybjerSetzer\n\n ||| Compute, as a Dybjer-Setzer code for an inductive-recursive type, the domain\n ||| of a function defined by general recursion.\n public export\n Domain : PiG a b -> (i : a) -> Code b (b i)\n Domain f i = monadMorphism ask (f i) where\n\n ask : (i : a) -> Code b (b i)\n ask i = Branch () (const i) $ \\ t => Yield (t ())\n\n ||| If a given input is in the domain of the function then we may evaluate\n ||| it fully on that input and obtain a pure return value.\n public export\n evaluate : (f : PiG a b) -> (i : a) -> Mu (Domain f) i -> b i\n evaluate f i inDom = Decode inDom\n\n ||| If every input value is in the domain then the function is total.\n public export\n totally : (f : PiG a b) -> ((i : a) -> Mu (Domain f) i) ->\n (i : a) -> b i\n totally f allInDomain i = evaluate f i (allInDomain i)\n\n------------------------------------------------------------------------\n-- Runtime irrelevant domain and total evaluation function\n\nnamespace Erased\n\n ------------------------------------------------------------------------\n -- Domain and evaluation functions\n\n ||| What it means to describe a terminating computation\n ||| @ f is the function used to answer questions put to the oracle\n ||| @ d is the description of the computation\n public export\n data Layer : (f : PiG a b) -> (d : General a b (b i)) -> Type\n\n ||| The domain of a function (i.e. the set of inputs for which it terminates)\n ||| as a predicate on inputs\n ||| @ f is the function whose domain is being described\n ||| @ i is the input that is purported to be in the domain\n Domain : (f : PiG a b) -> (i : a) -> Type\n\n ||| Fully evaluate a computation known to be terminating.\n ||| Because of the careful design of the inductive family Layer, we can make\n ||| the proof runtime irrelevant.\n evaluateLayer : (f : PiG a b) -> (d : General a b (b i)) -> (0 _ : Layer f d) -> b i\n\n ||| Fully evaluate a function call for an input known to be in its domain.\n evaluate : (f : PiG a b) -> (i : a) -> (0 _ : Domain f i) -> b i\n\n -- In a classic Dybjer-Setzer situation this is computed by induction over the\n -- index of type `General a b (b i)` and the fixpoint called `Domain` is the\n -- one thing defined as an inductive type.\n -- Here we have to flip the script because Idris will only trust inductive data\n -- as a legitimate source of termination metric for a recursive function. This\n -- makes our definition of `evaluateLayer` obviously terminating.\n data Layer : PiG a b -> General a b (b i) -> Type where\n ||| A computation returning a value is trivially terminating\n MkTell : {0 a : Type} -> {0 b : a -> Type} -> {0 f : PiG a b} -> {0 i : a} ->\n (o : b i) -> Layer f (Tell o)\n\n ||| Performing a call to the oracle is termnating if the input is in its\n ||| domain and if the rest of the computation is also finite.\n MkAsk : {0 a : Type} -> {0 b : a -> Type} -> {0 f : PiG a b} -> {0 i : a} ->\n (j : a) -> (jprf : Domain f j) ->\n (k : b j -> General a b (b i)) -> Layer f (k (evaluate f j jprf)) ->\n Layer f (Ask j k)\n\n -- Domain is simply defined as the top layer leading to a terminating\n -- computation with the function used as its own oracle.\n Domain f i = Layer f (f i)\n\n ||| A view that gives us a pattern-matching friendly presentation of the\n ||| @ d computation known to be terminating\n ||| @ l proof that it is\n ||| This may seem like a useless definition but the function `view`\n ||| demonstrates a very important use case: even if the proof is runtime\n ||| irrelevant, we can manufacture a satisfying view of it.\n data View : {d : General a b (b i)} -> (l : Layer f d) -> Type where\n TView : {0 b : a -> Type} -> {0 f : PiG a b} -> (o : b i) -> View (MkTell {b} {f} o)\n AView : {0 f : PiG a b} ->\n (j : a) -> (0 jprf : Domain f j) ->\n (k : b j -> General a b (b i)) -> (0 kprf : Layer f (k (evaluate f j jprf))) ->\n View (MkAsk j jprf k kprf)\n\n ||| Function computing the view by pattern-matching on the computation and\n ||| inverting the proof. Note that the proof is runtime irrelevant even though\n ||| the resulting view is not: this is possible because the relevant constructor\n ||| is uniquely determined by the shape of `d`.\n public export\n view : (d : General a b (b i)) -> (0 l : Layer f d) -> View l\n view (Tell o) (MkTell o) = TView o\n view (Ask j k) (MkAsk j jprf k kprf) = AView j jprf k kprf\n\n -- Just like `Domain` is defined in terms of `Layer`, the evaluation of a\n -- function call for an input in its domain can be reduced to the evaluation\n -- of a layer.\n evaluate f i l = evaluateLayer f (f i) l\n\n -- The view defined earlier allows us to pattern on the runtime irrelevant\n -- proof that the layer describes a terminating computation and therefore\n -- define `evaluateLayer` in a way that is purely structural.\n -- This becomes obvious if one spells out the (forced) pattern corresponding\n -- to `d` in each branch of the case.\n evaluateLayer f d l = case view d l of\n TView o => o\n AView j jprf k kprf => evaluateLayer f (k (evaluate f j jprf)) kprf\n\n ||| If a function's domain is total then it is a pure function.\n public export\n totally : (f : PiG a b) -> (0 _ : (i : a) -> Domain f i) ->\n (i : a) -> b i\n totally f dom i = evaluate f i (dom i)\n\n ------------------------------------------------------------------------\n -- Proofs\n\n ||| Domain is a singleton type\n export\n irrelevantDomain : (f : PiG a b) -> (i : a) -> (p, q : Domain f i) -> p === q\n\n ||| Layer is a singleton type\n irrelevantLayer\n : (f : PiG a b) -> (d : General a b (b i)) -> (l, m : Layer f d) -> l === m\n\n irrelevantDomain f i p q = irrelevantLayer f (f i) p q\n\n irrelevantLayer f (Tell o)\n (MkTell o) (MkTell o) = Refl\n irrelevantLayer f (Ask j k)\n (MkAsk j jprf1 k kprf1) (MkAsk j jprf2 k kprf2)\n with (irrelevantDomain f j jprf1 jprf2)\n irrelevantLayer f (Ask j k)\n (MkAsk j jprf k kprf1) (MkAsk j jprf k kprf2)\n | Refl = cong (MkAsk j jprf k)\n $ irrelevantLayer f (k (evaluate f j jprf)) kprf1 kprf2\n\n ||| The result of `evaluateLayer` does not depend on the specific proof that\n ||| `i` is in the domain of the layer of computation at hand.\n export\n evaluateLayerIrrelevance\n : (f : PiG a b) -> (d : General a b (b i)) -> (0 p, q : Layer f d) ->\n evaluateLayer f d p === evaluateLayer f d q\n evaluateLayerIrrelevance f d p q\n = rewrite irrelevantLayer f d p q in Refl\n\n ||| The result of `evaluate` does not depend on the specific proof that `i`\n ||| is in the domain of the function at hand.\n export\n evaluateIrrelevance\n : (f : PiG a b) -> (i : a) -> (0 p, q : Domain f i) ->\n evaluate f i p === evaluate f i q\n evaluateIrrelevance f i p q\n = evaluateLayerIrrelevance f (f i) p q\n\n ||| The result computed by a total function is independent from the proof\n ||| that it is total.\n export\n totallyIrrelevance\n : (f : PiG a b) -> (0 p, q : (i : a) -> Domain f i) ->\n (i : a) -> totally f p i === totally f q i\n totallyIrrelevance f p q i = evaluateIrrelevance f i (p i) (q i)\n", "meta": {"hexsha": "7a6b5a0bdf91ebee7c3d8ff32b222b65200a4697", "size": 11232, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "libs/contrib/Data/Recursion/Free.idr", "max_stars_repo_name": "ska80/idris-jvm", "max_stars_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 396, "max_stars_repo_stars_event_min_datetime": "2016-07-17T08:00:45.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-21T22:47:13.000Z", "max_issues_repo_path": "libs/contrib/Data/Recursion/Free.idr", "max_issues_repo_name": "ska80/idris-jvm", "max_issues_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 54, "max_issues_repo_issues_event_min_datetime": "2016-08-04T06:13:36.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-03T04:00:31.000Z", "max_forks_repo_path": "libs/contrib/Data/Recursion/Free.idr", "max_forks_repo_name": "ska80/idris-jvm", "max_forks_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 28, "max_forks_repo_forks_event_min_datetime": "2016-09-15T15:19:03.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-27T13:05:48.000Z", "avg_line_length": 39.2727272727, "max_line_length": 91, "alphanum_fraction": 0.6044337607, "num_tokens": 3185, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7025300573952054, "lm_q2_score": 0.5389832206876841, "lm_q1q2_score": 0.37865191296477135}} {"text": "module GenericFinal\n\n\ninterface Symantics (rep : Type -> Type) where\n int : rep Int\n bool : rep Bool\n tuple : rep a -> rep b -> rep (a, b)\n list : rep a -> rep (List a)\n maybe : rep a -> rep (Maybe a)\n\ndata Printer : Type -> Type where\n P : (a -> String) -> Printer a\n\nSymantics Printer where\n int = P (\\x => show x)\n bool = P (\\x => show x)\n tuple (P f) (P g) = P (\\(x, y) => \"(\" ++ (f x) ++ \", \" ++ (g y) ++ \")\")\n list (P f) = P (\\xs => let res = foldr (\\elem, acc => if acc == \"\" then f elem else (f elem) ++ \", \" ++ acc) \"\" xs in \"[\" ++ res ++ \"]\")\n maybe (P f) = P p\n where\n p : Maybe a -> String\n p Nothing = \"Nothing\"\n p (Just x) = \"Just \" ++ f x\n\nprint : Printer a -> a -> String\nprint (P f) = f\n\nexample : (List Int, Maybe Bool) -> String\nexample = print (tuple (list int) (maybe bool))\n", "meta": {"hexsha": "461f1fb0c4af5c202d39e497429fe78aa96fd5b4", "size": 825, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/GenericFinal.idr", "max_stars_repo_name": "STELIORD/idris-snippets", "max_stars_repo_head_hexsha": "f5ca6fa86370d24587040af9871ae850bbc630c2", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 16, "max_stars_repo_stars_event_min_datetime": "2017-11-21T22:28:51.000Z", "max_stars_repo_stars_event_max_datetime": "2020-10-05T18:25:18.000Z", "max_issues_repo_path": "src/GenericFinal.idr", "max_issues_repo_name": "stjordanis/idris-snippets", "max_issues_repo_head_hexsha": "d92734b8624ae27be21a63fcb041077b38eaaecb", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/GenericFinal.idr", "max_forks_repo_name": "stjordanis/idris-snippets", "max_forks_repo_head_hexsha": "d92734b8624ae27be21a63fcb041077b38eaaecb", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-05-06T13:39:44.000Z", "max_forks_repo_forks_event_max_datetime": "2020-10-21T15:39:16.000Z", "avg_line_length": 27.5, "max_line_length": 138, "alphanum_fraction": 0.5163636364, "num_tokens": 278, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6825737214979745, "lm_q2_score": 0.5544704649604273, "lm_q1q2_score": 0.37846696872875113}} {"text": "module Flexidisc.OrdList.Disjoint\n\nimport Flexidisc.Dec.IsYes\nimport Flexidisc.OrdList.Fresh\nimport Flexidisc.OrdList.Label\nimport Flexidisc.OrdList.Nub\nimport Flexidisc.OrdList.Type\n\n%default total\n%access public export\n\n||| A proof that two `OrdList` don't share a key.\ndata Disjoint : (left, right : OrdList k v o) -> Type where\n ||| The empty `OrdList` is always `Disjoint` from another `OrdList`\n Nil : Disjoint [] right\n ||| A key in the first `OrdList` is fresh in the second `OrdList`.\n (::) : DecEq l => {k : l} -> IsFresh k right -> Disjoint left right ->\n Disjoint ((k,v) :: left) right\n\n%name Disjoint djt, dis, prf\n\nfreshInMerge : Fresh l left -> Fresh l right -> Fresh l (merge left right)\nfreshInMerge [] freshR = freshR\nfreshInMerge (f :: fresh) [] = f :: fresh\nfreshInMerge (f :: fresh) (g :: prf)\n {left = ((ll, tl) :: xs)} {right = ((lr, tr) :: hs)} with (ll < lr)\n | True = f :: freshInMerge fresh (g :: prf)\n | False = g :: freshInMerge (f :: fresh) prf\n\ninvertFresh : Disjoint left ((lr, ty)::right) -> Fresh lr left\ninvertFresh [] = []\ninvertFresh (fresh :: djt) =\n (\\(f :: _) => f . sym) (getProof fresh) :: invertFresh djt\n\ndisjointSmallerRight : Disjoint left (r::right) -> Disjoint left right\ndisjointSmallerRight [] = []\ndisjointSmallerRight (fresh :: djt) =\n tailIsFresh fresh :: disjointSmallerRight djt\n\ndisjointNub : Disjoint left right -> Nub left -> Nub right ->\n Nub (merge left right)\ndisjointNub djt [] z = z\ndisjointNub djt (yes :: x) [] = yes :: x\ndisjointNub (fll :: djt) (yes :: x) (prf :: w)\n {left = ((ll, tl) :: xs)} {right = ((lr, tr) :: hs)} with (ll < lr)\n | True = freshInMerge yes (getProof fll) :: disjointNub djt x (prf :: w)\n | False = freshInMerge (invertFresh (fll :: djt)) prf\n :: disjointNub (disjointSmallerRight (fll :: djt)) (yes :: x) w\n", "meta": {"hexsha": "f210c18c5ea0a3a167d9a89871382b8c67b8e20e", "size": 1856, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Flexidisc/OrdList/Disjoint.idr", "max_stars_repo_name": "berewt/flexidisc", "max_stars_repo_head_hexsha": "8a0c367244229be5d417c04588d8d41b6030dba2", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 4, "max_stars_repo_stars_event_min_datetime": "2020-04-02T09:51:01.000Z", "max_stars_repo_stars_event_max_datetime": "2020-04-03T05:15:49.000Z", "max_issues_repo_path": "src/Flexidisc/OrdList/Disjoint.idr", "max_issues_repo_name": "LIST-LUXEMBOURG/flexidisc", "max_issues_repo_head_hexsha": "f5a9cdc81554359e324b64400d8479494cd45a8c", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Flexidisc/OrdList/Disjoint.idr", "max_forks_repo_name": "LIST-LUXEMBOURG/flexidisc", "max_forks_repo_head_hexsha": "f5a9cdc81554359e324b64400d8479494cd45a8c", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 37.8775510204, "max_line_length": 77, "alphanum_fraction": 0.6373922414, "num_tokens": 603, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7122321842389469, "lm_q2_score": 0.5312093733737563, "lm_q1q2_score": 0.3783444122861927}} {"text": "module TypFunktionen\n\nNatOderString : Bool -> Type\nNatOderString False = Nat\nNatOderString True = String\n\nnatOrString : (b:Bool) -> NatOderString b\nnatOrString False = 42\nnatOrString True = \"Frage\"\n\ntoString : (b:Bool) -> NatOderString b -> String\ntoString False n = show n\ntoString True s = s\n", "meta": {"hexsha": "aedc2d14acb2bb11f5dc0b1e30f863c4d5632fec", "size": 294, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Beispiele/TypFunktionen.idr", "max_stars_repo_name": "CarstenKoenig/DOS2016_IdrisWorkshop", "max_stars_repo_head_hexsha": "f329b584e5ae434f0c52564bf75710070cc247da", "max_stars_repo_licenses": ["Unlicense"], "max_stars_count": 3, "max_stars_repo_stars_event_min_datetime": "2016-10-14T07:30:59.000Z", "max_stars_repo_stars_event_max_datetime": "2016-10-15T09:50:24.000Z", "max_issues_repo_path": "Beispiele/TypFunktionen.idr", "max_issues_repo_name": "CarstenKoenig/DOS2016_IdrisWorkshop", "max_issues_repo_head_hexsha": "f329b584e5ae434f0c52564bf75710070cc247da", "max_issues_repo_licenses": ["Unlicense"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Beispiele/TypFunktionen.idr", "max_forks_repo_name": "CarstenKoenig/DOS2016_IdrisWorkshop", "max_forks_repo_head_hexsha": "f329b584e5ae434f0c52564bf75710070cc247da", "max_forks_repo_licenses": ["Unlicense"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 21.0, "max_line_length": 48, "alphanum_fraction": 0.7414965986, "num_tokens": 94, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.7217431943271999, "lm_q2_score": 0.5234203489363239, "lm_q1q2_score": 0.37777507461716003}} {"text": "module Effekt.IteratedStaged\n\nimport Effekt.CpsStaged\nimport Effekt.IteratedUnstaged\n\nSTM : List Type -> Type -> Type\nSTM [] a = Exp a\nSTM (r :: rs) a = (Exp a -> STM rs r) -> STM rs r\n\npure : Exp a -> STM rs a\npure{ rs= []} a = a\npure{ rs= r :: rs} a = \\k => k a\n\npush : (Exp a -> STM (r :: rs) b) -> (Exp b -> STM rs r) -> (Exp a -> STM rs r)\npush f k = \\a => f a k\n\nbind : STM rs a -> (Exp a -> STM rs b) -> STM rs b\nbind{ rs= []} m f = f m\nbind{ rs= r :: rs} m f = \\k => m (push f k)\n\n(>>=) : STM rs a -> (Exp a -> STM rs b) -> STM rs b\n(>>=) = bind\n\nlift : STM rs a -> STM (r :: rs) a\nlift = bind\n\nshift0 : ((Exp a -> STM rs r) -> STM rs r) -> STM (r :: rs) a\nshift0 = id\n\nrunIn0 : STM (r :: rs) a -> (Exp a -> STM rs r) -> STM rs r\nrunIn0 = id\n\nreset0 : STM (a :: rs) a -> STM rs a\nreset0 m = runIn0 m pure\n\nmutual\n reify : STM rs a -> Exp (Stm rs a)\n reify {rs = []} m = m\n reify {rs = (q :: qs)} m =\n (Lam $ \\ k => reify (m (\\a => reflect {a = q} {rs = qs} (App k a))))\n\n reflect : Exp (Stm rs a) -> STM rs a\n reflect {rs = []} m = m\n reflect {rs = (q :: qs)} m =\n \\k => reflect (App m ((Lam $ \\ a => reify (k a))))\n\nemit : Exp Int -> STM (List Int :: rs) ()\nemit {rs} a = shift0 (\\c => do\n as <- c Uni\n pure {rs} (Con a as))\n\nemitTwice : Exp Int -> STM (List Int :: List Int :: rs) ()\nemitTwice {rs} a =\n bind {rs=List Int::List Int::rs} (emit {rs=List Int::rs} a) (\\u =>\n lift {r=List Int} {rs=List Int::rs} (emit a))\n\nexport\nreifiedEmitTwice : Exp (Int -> Stm [List Int,List Int] ())\nreifiedEmitTwice = Lam (\\x => reify {rs=[List Int,List Int]} (emitTwice x))\n\nexport\nreifiedEmitTwice' : Exp (Int -> Stm [List Int,List Int,()] ())\nreifiedEmitTwice' = Lam (\\x => reify {rs=[List Int,List Int,()]} (emitTwice {rs=[()]} x))\n", "meta": {"hexsha": "550454d1cb15f87fa2db8ae604cfe1a47b616af8", "size": 1774, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Effekt/IteratedStaged.idr", "max_stars_repo_name": "b-studios/idris-effekt", "max_stars_repo_head_hexsha": "d9c5094456677914e034ef1ade9525ac0c338108", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2020-10-14T00:28:55.000Z", "max_stars_repo_stars_event_max_datetime": "2020-10-14T00:28:55.000Z", "max_issues_repo_path": "Effekt/IteratedStaged.idr", "max_issues_repo_name": "b-studios/idris-effekt", "max_issues_repo_head_hexsha": "d9c5094456677914e034ef1ade9525ac0c338108", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Effekt/IteratedStaged.idr", "max_forks_repo_name": "b-studios/idris-effekt", "max_forks_repo_head_hexsha": "d9c5094456677914e034ef1ade9525ac0c338108", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 27.71875, "max_line_length": 89, "alphanum_fraction": 0.52367531, "num_tokens": 693, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.5926665999540698, "lm_q2_score": 0.6370308013713525, "lm_q1q2_score": 0.37754687911477586}} {"text": "-- expressions\n\ndata SourcePos = SP String Nat Nat\nShow SourcePos where\n show (SP x k j) = x ++ \":\" ++ (show k) ++ \",\" ++ (show j)\n\none : Nat\none = unsafePerformIO $ do putStrLn \"ALEX\"\n pure 3\n\ndata Name = Name' String\n\nShow Name where\n show (Name' x) = x\n\nEq Name where\n (==) (Name' x) (Name' y) = x == y\n\ndata Expr\n = Var Name -- x\n | Pi Name Expr Expr -- (Π ((x A)) B)\n | Lambda Name Expr -- (λ (x) b)\n | App Expr Expr -- (rator rand)\n | Sigma Name Expr Expr -- (Σ ((x A)) D)\n | Cons Expr Expr -- (cons a d)\n | Car Expr -- (car e)\n | Cdr Expr -- (cdr e)\n | Nat -- Nat\n | Zero -- zero\n | Add1 Expr -- (add1 e)\n | IndNat Expr Expr Expr Expr -- (ind-nat tgt mot base step)\n | Equal Expr Expr Expr -- (= A from to)\n | Same -- Same\n | Replace Expr Expr Expr -- (replace tgt mot base)\n | Trivial -- Trivial\n | Sole -- sole\n | Absurd -- Absurd\n | IndAbsurd Expr Expr -- (ind-Absurd tgt mot)\n | Atom -- Atom\n | Tick String -- 'a\n | U -- U\n | The Expr Expr -- (the t e)\n | SrcPos SourcePos Expr\n\nShow Expr where\nEq Expr where\n\nNamespace : Type\nNamespace = List (Name, Integer)\n%name Namespace ns1, ns2, ns3\n\n-- alpha equivalence\naEquivHelper : (i : Integer) ->\n Namespace -> Expr ->\n Namespace -> Expr ->\n Bool\naEquivHelper i ns1 (Var x) ns2 (Var y) =\n case (lookup x ns1, lookup y ns2) of\n (Nothing, Nothing) => x == y\n (Just j, Just k) => i == j\n _ => False\n\naEquivHelper i ns1 (Pi x a1 r1) ns2 (Pi y a2 r2) =\n aEquivHelper i ns1 a1 ns2 a2 &&\n aEquivHelper (i+1) ((x, i) :: ns1) r1 ((y, i) :: ns2) r2\n\naEquivHelper i ns1 (Lambda x body1) ns2 (Lambda y body2) =\n aEquivHelper (i+1) ((x, i) :: ns1) body1 ((y, i) :: ns2) body2\n\naEquivHelper i ns1 (App rator1 rand1) ns2 (App rator2 rand2) =\n aEquivHelper i ns1 rator1 ns2 rator2 &&\n aEquivHelper i ns1 rand1 ns2 rand2\n\naEquivHelper i ns1 (Sigma x a1 d1) ns2 (Sigma y a2 d2) =\n aEquivHelper i ns1 a1 ns2 a2 &&\n aEquivHelper (i+1) ((x, i) :: ns1) d1 ((y, i) :: ns2) d2\n\naEquivHelper i ns1 (Cons car1 cdr1) ns2 (Cons car2 cdr2) =\n aEquivHelper i ns1 car1 ns2 car2 &&\n aEquivHelper i ns1 cdr1 ns2 cdr2\n\naEquivHelper i ns1 (Car pair1) ns2 (Car pair2) =\n aEquivHelper i ns1 pair1 ns2 pair2\naEquivHelper i ns1 (Cdr pair1) ns2 (Cdr pair2) =\n aEquivHelper i ns1 pair1 ns2 pair2\n\naEquivHelper _ _ Nat _ Nat = True\naEquivHelper _ _ Zero _ Zero = True\n\naEquivHelper i ns1 (Add1 e1) ns2 (Add1 e2) =\n aEquivHelper i ns1 e1 ns2 e2\n\naEquivHelper i ns1 (IndNat tgt1 mot1 base1 step1) ns2 (IndNat tgt2 mot2 base2 step2) =\n aEquivHelper i ns1 tgt1 ns2 tgt2 &&\n aEquivHelper i ns1 mot1 ns2 mot2 &&\n aEquivHelper i ns1 base1 ns2 base2 &&\n aEquivHelper i ns1 step1 ns2 step2\n\naEquivHelper i ns1 (Equal ty1 from1 to1) ns2 (Equal ty2 from2 to2) =\n aEquivHelper i ns1 ty1 ns2 ty2 &&\n aEquivHelper i ns1 from1 ns2 from2 &&\n aEquivHelper i ns1 to1 ns2 to2\n\naEquivHelper _ _ Same _ Same = True\n\naEquivHelper i ns1 (Replace tgt1 mot1 base1) ns2 (Replace tgt2 mot2 base2) =\n aEquivHelper i ns1 tgt1 ns2 tgt2 &&\n aEquivHelper i ns1 mot1 ns2 mot2 &&\n aEquivHelper i ns1 base1 ns2 base2\n\naEquivHelper _ _ Trivial _ Trivial = True\naEquivHelper _ _ Sole _ Sole = True\naEquivHelper _ _ Absurd _ Absurd = True\naEquivHelper _ _ Atom _ Atom = True\naEquivHelper _ _ U _ Atom = True\n\naEquivHelper i ns1 (IndAbsurd tgt1 mot1) ns2 (IndAbsurd tgt2 mot2) =\n aEquivHelper i ns1 tgt1 ns2 tgt2 &&\n aEquivHelper i ns1 mot1 ns2 mot2\n\naEquivHelper i ns1 (Tick a1) ns2 (Tick a2) = a1 == a2\n\naEquivHelper _ _ (The Absurd _) _ (The Absurd _) = True\naEquivHelper i ns1 (The t1 e1) ns2 (The t2 e2) =\n aEquivHelper i ns1 t1 ns2 t2 &&\n aEquivHelper i ns1 e1 ns2 e2\n\naEquivHelper i ns1 (SrcPos str1 e1) ns2 (SrcPos str2 e2) =\n aEquivHelper i ns1 e1 ns2 e2\n\naEquivHelper _ _ _ _ _ = False\n\naEquiv : Expr -> Expr -> Bool\naEquiv e1 e2 = aEquivHelper 0 [] e1 [] e2\n\nmutual\n data Neutral\n = NVar Name\n | NApp Neutral Normal\n | NCar Neutral\n | NCdr Neutral\n | NIndNat Neutral Normal Normal Normal\n | NReplace Neutral Normal Normal\n | NIndAbsurd Neutral Normal\n\n data Normal = Normal' Ty Value\n\n Env : Type -- Now a type alias\n Env = List (Name,Value)\n %name Env env, env1, env2\n\n record Closure where\n constructor MkClosure\n closureEnv : Env\n closureName : Name\n closureBody : Expr\n\n Ty : Type\n Ty = Value\n\n -- Values\n data Value\n = VPi Ty Closure\n | VLambda Closure\n | VSigma Ty Closure\n | VPair Value Value\n | VNat\n | VZero\n | VAdd1 Value\n | VEq Ty Value Value\n | VSame\n | VTrivial\n | VSole\n | VAbsurd\n | VAtom\n | VTick String\n | VU\n | VNeutral Ty Neutral\n\nextendEnv : Env -> Name -> Value -> Env\nextendEnv env x v = ((x, v) :: env)\n\n-- definitions and dependent types\ndata CtxEntry = Def Ty Value | IsA Ty\n\nCtx : Type\nCtx = List (Name, CtxEntry)\n%name Ctx ctx, ctx1, ctx2\n\ninitCtx : Ctx\ninitCtx = []\n\nctxNames : Ctx -> List Name\nctxNames ctx = map fst ctx\n\nextendCtx : Ctx -> Name -> Ty -> Ctx\nextendCtx ctx x t = (x, (IsA t)) :: ctx\n\ndefine : Ctx -> Name -> Ty -> Value -> Ctx\ndefine ctx x t v = (x, Def t v) :: ctx\n\nmkEnv : Ctx -> Env\nmkEnv [] = []\nmkEnv ((x, e) :: ctx) =\n let env = mkEnv ctx in\n (case e of\n (Def _ v) => (x, v) :: env\n (IsA t) => let v = VNeutral t (NVar x) in\n (x, v) :: env)\n-- evaluator\nmutual\n data Error\n = MissingValue String\n | CarError\n | CdrError\n | ApplyError\n | IndAbsurdError\n | DoReplaceError\n | DoIndNatError\n | ReadBackTypedError\n | ErrorMessage String\n\n partial\n evalClosure : Closure -> Value -> Either Error Value\n evalClosure (MkClosure env x e) v =\n eval (extendEnv env x v) e\n\n evalVar : Env -> Name -> Either Error Value\n evalVar [] x = Left (MissingValue (show x ++ \" not found in env\"))\n evalVar ((y, v) :: env) x = case x == y of\n True => Right v\n False => evalVar env x\n\n partial\n eval : Env -> Expr -> Either Error Value\n eval env (Var x) = evalVar env x\n eval env (Pi x dom ran) =\n do dom' <- eval env dom\n Right (VPi dom' (MkClosure env x ran))\n eval env (Lambda x body) = Right (VLambda (MkClosure env x body))\n eval env (App rator rand) =\n do rator' <- eval env rator\n rand' <- eval env rand\n doApply rator' rand'\n eval env (Sigma x carType cdrType) =\n do carType' <- eval env carType\n Right (VSigma carType' (MkClosure env x cdrType))\n eval env (Cons a d) =\n do a' <- eval env a\n d' <- eval env d\n Right (VPair a' d')\n eval env (Car e) =\n do e' <- eval env e\n doCar e'\n eval env (Cdr e) =\n do e' <- eval env e\n doCdr e'\n eval env Nat = Right VNat\n eval env Zero = Right VZero\n eval env (Add1 e) =\n do e' <- eval env e\n Right (VAdd1 e')\n eval env (IndNat tgt mot base step) =\n do tgt' <- eval env tgt\n mot' <- eval env mot\n base' <- eval env base\n step' <- eval env step\n doIndNat tgt' mot' base' step'\n eval env (Equal ty from to) =\n do ty' <- eval env ty\n from' <- eval env from\n to' <- eval env to\n Right (VEq ty' from' to')\n eval env Same = Right VSame\n eval env (Replace tgt mot base) =\n do tgt' <- eval env tgt\n mot' <- eval env mot\n base' <- eval env base\n doReplace tgt' mot' base'\n eval env Trivial = Right VTrivial\n eval env Sole = Right VSole\n eval env Absurd = Right VAbsurd\n eval env (IndAbsurd tgt mot) =\n do tgt' <- eval env tgt\n mot' <- eval env mot\n doIndAbsurd tgt' mot'\n eval env Atom = Right VAtom\n eval env (Tick x) = Right (VTick x)\n eval env U = Right VU\n eval env (The ty e) = eval env e\n eval env (SrcPos _ e) = eval env e\n\n -- eliminators\n doCar : Value -> Either Error Value\n doCar (VPair v1 v2) = Right v1\n doCar (VNeutral (VSigma aT dT) neu) =\n Right (VNeutral aT (NCar neu))\n doCar _ = Left CarError\n\n partial\n doCdr : Value -> Either Error Value\n doCdr (VPair v1 v2) = Right v2\n doCdr v@(VNeutral (VSigma aT dT) neu) =\n do v' <- doCar v\n cl' <- evalClosure dT v'\n Right (VNeutral cl' (NCdr neu))\n doCdr _ = Left CdrError\n\n partial\n doApply : Value -> Value -> Either Error Value\n doApply (VLambda closure) arg =\n evalClosure closure arg\n doApply (VNeutral (VPi dom ran) neu) arg =\n do arg' <- evalClosure ran arg\n Right (VNeutral arg' (NApp neu (Normal' dom arg)))\n doApply _ _ = Left ApplyError\n\n doIndAbsurd : Value -> Value -> Either Error Value\n doIndAbsurd (VNeutral VAbsurd neu) mot =\n Right (VNeutral mot (NIndAbsurd neu (Normal' VU mot)))\n doIndAbsurd _ _ = Left IndAbsurdError\n\n partial\n doReplace : Value -> Value -> Value -> Either Error Value\n doReplace VSame mot base =\n Right base\n doReplace (VNeutral (VEq ty from to) neu) mot base =\n do v' <- doApply mot to\n baseT' <- doApply mot from\n Right (VNeutral v'\n (NReplace neu (Normal' motT mot) (Normal' baseT' base)))\n where\n motT = VPi ty (MkClosure ([]) (Name' \"x\") U)\n doReplace _ _ _ = Left DoReplaceError\n\n partial\n indNatStepType : Value -> Either Error Value\n indNatStepType mot =\n eval [(Name' \"mot\", mot)]\n (Pi (Name' \"n-1\") Nat\n (Pi (Name' \"almost\") (App (Var (Name' \"mot\")) (Var (Name' \"n-1\")))\n (App (Var (Name' \"mot\"))\n (Add1 (Var (Name' \"n-1\"))))))\n\n partial\n doIndNat : Value -> Value -> Value -> Value -> Either Error Value\n doIndNat VZero mot base step =\n Right base\n doIndNat (VAdd1 v) mot base step =\n do rator' <- (doApply step v)\n rand' <- (doIndNat v mot base step)\n doApply rator' rand'\n doIndNat tgt@(VNeutral VNat neu) mot base step =\n do a' <- (doApply mot tgt)\n b' <- (doApply mot VZero)\n c' <- (indNatStepType mot)\n Right (VNeutral a' (NIndNat neu\n (Normal' (VPi VNat (MkClosure [] (Name' \"k\") U)) mot) (Normal' b' base)\n (Normal' c' step)))\n doIndNat _ _ _ _ = Left DoIndNatError\n\n-- fresh names\n\nnextName : Name -> Name\nnextName (Name' x) = Name' ((show x) ++ \"'\")\n\n-- could possibly fail for a list like [n', n'', n']\nfreshen : List Name -> Name -> Name\nfreshen [] n = n\nfreshen (x :: used) n = case x == n of\n False => freshen used n\n True => freshen used (nextName n)\n\n-- reading back\nmutual\n partial\n readBackNeutral : Ctx -> Neutral -> Either Error Expr\n readBackNeutral ctx (NVar x) = Right (Var x)\n readBackNeutral ctx (NApp neu arg) =\n do neu' <- readBackNeutral ctx neu\n arg' <- readBackNormal ctx arg\n Right (App neu' arg')\n readBackNeutral ctx (NCar neu) =\n do car <- readBackNeutral ctx neu\n Right (Car car)\n readBackNeutral ctx (NCdr neu) =\n do cdr <- readBackNeutral ctx neu\n Right (Cdr cdr)\n readBackNeutral ctx (NIndNat neu mot base step) =\n do neu' <- readBackNeutral ctx neu\n mot' <- readBackNormal ctx mot\n base' <- readBackNormal ctx base\n step' <- readBackNormal ctx step\n Right (IndNat neu' mot' base' step')\n readBackNeutral ctx (NReplace neu mot base) =\n do neu' <- readBackNeutral ctx neu\n mot' <- readBackNormal ctx mot\n base' <- readBackNormal ctx base\n Right (Replace neu' mot' base')\n readBackNeutral ctx (NIndAbsurd neu mot) =\n do neu' <- readBackNeutral ctx neu\n mot' <- readBackNormal ctx mot\n Right (IndAbsurd (The Absurd neu') mot')\n\n partial\n readBackTyped : Ctx -> Ty -> Value -> Either Error Expr\n readBackTyped ctx VNat VZero = Right Zero\n readBackTyped ctx VNat (VAdd1 v) =\n do n <- (readBackTyped ctx VNat v)\n Right (Add1 n)\n readBackTyped ctx (VPi dom ran) fun =\n let x = freshen (ctxNames ctx) (closureName ran)\n xVal = VNeutral dom (NVar x)\n ctx' = extendCtx ctx x dom in\n do ty' <- evalClosure ran xVal\n v' <- doApply fun xVal\n body <- readBackTyped ctx' ty' ty'\n Right (Lambda x body)\n readBackTyped ctx (VSigma aT dT) pair =\n do carVal <- doCar pair\n car <- readBackTyped ctx aT carVal\n cdrT <- evalClosure dT carVal\n cdrVal <- doCdr pair\n cdr <- readBackTyped ctx cdrT cdrVal\n Right (Cons car cdr)\n readBackTyped ctx VAbsurd (VNeutral VAbsurd neu) =\n do a <- readBackNeutral ctx neu\n Right (The Absurd a)\n readBackTyped ctx (VEq _ _ _) VSame = Right Same\n readBackTyped ctx VAtom (VTick x) = Right (Tick x)\n readBackTyped ctx VU VNat = Right Nat\n readBackTyped ctx VU VAtom = Right Atom\n readBackTyped ctx VU VTrivial = Right Trivial\n readBackTyped ctx VU VAbsurd = Right Absurd\n readBackTyped ctx VU (VEq t from to) =\n do a <- readBackTyped ctx VU t\n b <- readBackTyped ctx t from\n c <- readBackTyped ctx t to\n Right (Equal a b c)\n readBackTyped ctx VU (VSigma aT dT) =\n let x = freshen (ctxNames ctx) (closureName dT) in\n do a <- readBackTyped ctx VU aT\n body <- evalClosure dT (VNeutral aT (NVar x))\n d <- readBackTyped (extendCtx ctx x aT) VU body\n Right (Sigma x a d)\n readBackTyped ctx VU (VPi aT bT) =\n let x = freshen (ctxNames ctx) (closureName bT) in\n do a <- readBackTyped ctx VU aT\n body <- evalClosure bT (VNeutral aT (NVar x))\n b <- readBackTyped (extendCtx ctx x aT) VU body\n Right (Pi x a b)\n readBackTyped ctx VU VU = Right U\n readBackTyped ctx t (VNeutral t' neu) = readBackNeutral ctx neu\n readBackTyped _ otherT otherE = Left ReadBackTypedError\n\n partial\n readBackNormal : Ctx -> Normal -> Either Error Expr\n readBackNormal ctx (Normal' t v) = readBackTyped ctx t v\n\n-- helpers\nlookupType : Ctx -> Name -> Either Error Ty -- didn't use message type\nlookupType [] x = Left (ErrorMessage \"unbound variable: \") -- TODO ++ show x\nlookupType ((y, e) :: ctx) x =\n (case x == y of\n False => lookupType ctx x\n True => (case e of\n (Def t _) => Right t\n (IsA t) => Right t))\n\nunexpected : Ctx -> String -> Value -> Either Error a\n\nisPi : Ctx -> Value -> Either Error (Ty, Closure)\nisPi _ (VPi a b) = Right (a, b)\nisPi ctx other = unexpected ctx \"Not a Pi type\" other\n\nisSigma : Ctx -> Value -> Either Error (Ty, Closure)\nisSigma _ (VSigma a b) = Right (a, b)\nisSigma ctx other = unexpected ctx \"Not a Sigma type\" other\n\nisNat : Ctx -> Value -> Either Error ()\nisNat _ VNat = Right ()\nisNat ctx other = unexpected ctx \"Not Nat\" other\n\nisEqual : Ctx -> Value -> Either Error (Ty, Value, Value)\nisEqual _ (VEq ty from to) = Right (ty, from, to)\nisEqual ctx other = unexpected ctx \"Not an equality type\" other\n\nisAbsurd : Ctx -> Value -> Either Error ()\nisAbsurd _ VAbsurd = Right ()\nisAbsurd ctx other = unexpected ctx \"Not Absurd: \" other\n\nisTrivial : Ctx -> Value -> Either Error ()\nisTrivial _ VTrivial = Right ()\nisTrivial ctx other = unexpected ctx \"Not Trivial\" other\n\nisAtom : Ctx -> Value -> Either Error ()\nisAtom _ VAtom = Right ()\nisAtom ctx other = unexpected ctx \"Not Atom\" other\n\n-- checking/synthesis\nmutual\n partial\n check : Ctx -> Expr -> Ty -> Either Error ()\n check ctx (Lambda x body) t = ?check_rhs_3\n check ctx (Cons a d) t = ?check_rhs_6\n check ctx Zero t = isNat ctx t\n check ctx (Add1 n) t = do\n isNat ctx t\n check ctx n VNat\n check ctx Same t = do\n (t, from, to) <- isEqual ctx t\n convert ctx t from to\n check ctx Sole t = isTrivial ctx t\n check ctx (Tick x) t = isAtom ctx t\n check ctx other t = do\n t' <- synth ctx other\n convert ctx VU t' t\n\n convert : Ctx -> Ty -> Value -> Value -> Either Error ()\n\n partial\n synth : Ctx -> Expr -> Either Error Ty\n synth ctx (Var x) = lookupType ctx x\n synth ctx (Pi x a b) =\n do check ctx a VU\n v <- eval (mkEnv ctx) a\n check (extendCtx ctx x v) b VU\n Right VU\n synth ctx (App rator rand) =\n do funTy <- synth ctx rator\n (a, b) <- isPi ctx funTy\n check ctx rand a\n body <- eval (mkEnv ctx) rand\n evalClosure b body\n synth ctx (Sigma x a b)\n = do check ctx a VU\n a' <- eval (mkEnv ctx) a\n check (extendCtx ctx x a') b VU\n Right VU\n synth ctx (Car e) =\n do t <- synth ctx e\n (aT, dT) <- isSigma ctx t\n Right aT\n synth ctx (Cdr e) =\n do t <- synth ctx e\n (aT, dT) <- isSigma ctx t\n e' <- eval (mkEnv ctx) e\n body <- doCar e'\n evalClosure dT body\n synth ctx Nat = Right VU\n synth ctx (IndNat tgt mot base step)\n = do t <- synth ctx tgt\n tgtV <- eval (mkEnv ctx) tgt\n motTy <- eval (mkEnv []) (Pi (Name' \"x\") Nat U)\n check ctx mot motTy\n motV <- eval (mkEnv ctx) mot\n z' <- doApply motV VZero\n check ctx base z'\n m' <- indNatStepType motV\n check ctx step m'\n doApply motV tgtV\n synth ctx (Equal ty from to)\n = do check ctx ty VU\n tyV <- eval (mkEnv ctx) ty\n check ctx from tyV\n check ctx to tyV\n Right VU\n synth ctx (Replace tgt mot base)\n = do t <- synth ctx tgt\n (ty, from, to) <- isEqual ctx t\n motTy <- eval ([(Name' \"ty\", ty)]) (Pi (Name' \"x\") (Var (Name' \"ty\")) U)\n check ctx mot motTy\n motV <- eval (mkEnv ctx) mot\n fromV <- doApply motV from\n check ctx base fromV\n doApply motV to\n synth ctx Trivial = Right VU\n synth ctx Absurd = Right VU\n synth ctx (IndAbsurd tgt mot)\n = do t <- synth ctx tgt\n isAbsurd ctx t\n check ctx mot VU\n eval (mkEnv ctx) mot\n synth ctx Atom = Right VU\n synth ctx U = Right VU\n synth ctx (The ty expr)\n = do check ctx ty VU\n tyV <- eval (mkEnv ctx) ty\n check ctx expr tyV\n Right tyV\n synth ctx other = Left (ErrorMessage \"Unable to synthesize a type for \") -- ++ show other\n", "meta": {"hexsha": "7575b66e6f0971f77cfb52b67aab8952b71ec407", "size": 17753, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "tartlet/Tartlet.idr", "max_stars_repo_name": "alexhumphreys/pl-playground", "max_stars_repo_head_hexsha": "da90cc3527e0ff3a7effd1f5dde5437b47ac1170", "max_stars_repo_licenses": ["BSD-2-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "tartlet/Tartlet.idr", "max_issues_repo_name": "alexhumphreys/pl-playground", "max_issues_repo_head_hexsha": "da90cc3527e0ff3a7effd1f5dde5437b47ac1170", "max_issues_repo_licenses": ["BSD-2-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "tartlet/Tartlet.idr", "max_forks_repo_name": "alexhumphreys/pl-playground", "max_forks_repo_head_hexsha": "da90cc3527e0ff3a7effd1f5dde5437b47ac1170", "max_forks_repo_licenses": ["BSD-2-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 29.9881756757, "max_line_length": 91, "alphanum_fraction": 0.6108826677, "num_tokens": 5779, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6334102498375401, "lm_q2_score": 0.5926665999540698, "lm_q1q2_score": 0.37540109914727277}} {"text": "module Machine\n\nimport Syntax as S\nimport Effects\nimport Effect.Exception\nimport Data.List\n\npublic export\nMName : Type\nMName = S.Name\n\nmutual\n export\n data MValue\n = MInt Integer\n | MBool Bool\n | MClosure MName Frame Env\n\n export\n implementation Show MValue where\n show (MInt n) = show n\n show (MBool b) = show b\n show (MClosure _ _ _) = \"\"\n\n public export\n data Instr\n = IMult\n | IAdd\n | ISub\n | IEqual\n | ILess\n | IVar MName\n | IInt Integer\n | IBool Bool\n | IClosure MName MName Frame\n | IBranch Frame Frame\n | ICall\n | IPopEnv\n\n ||| A stack of instructions.\n public export\n Frame : Type \n Frame = List Instr\n\n public export\n Env : Type\n Env = List (MName, Lazy MValue)\n\n Stack : Type\n Stack = List MValue\n\npublic export\nMachineError : Type\nMachineError = String\n\npublic export\nMEff : Type -> Type\n--MEff a = Eff a [EXCEPTION MachineError]\nMEff a = Either MachineError a\n\nerror : String -> MEff b\n--error msg = raise (MkMachineError msg)\nerror msg = Left msg\n\nEnvirons : Type\nEnvirons = List Env\n\nlookup : MName -> Environs -> MEff MValue\nlookup x envs = case head' envs of\n Just env => case lookup x env of\n Just v => pure v\n Nothing => error $ \"Unknown \" ++ x\n Nothing => error $ \"No environment in which to lookup \" ++ x\n\npop : Stack -> MEff (MValue, Stack)\npop [] = error \"Empty stack\"\npop (v :: vs) = pure $ (v, vs)\n\npopBool : Stack -> MEff (Bool, Stack)\npopBool (MBool b :: vs) = pure (b, vs)\npopBool _ = error \"Bool expected\"\n\n||| Pop a value and a closure from a stack\npopApp : Stack -> MEff (MName, Frame, Env, MValue, Stack)\npopApp (v :: MClosure n fr env :: vs) = pure (n, fr, env, v, vs)\npopApp _ = error \"Value and closure expected\"\n\nmult : Stack -> MEff Stack\nmult (MInt i2 :: MInt i1 :: vs) = pure $ MInt (i1 * i2) :: vs\nmult _ = error \"int and int expected in mult\"\n\nadd : Stack -> MEff Stack\nadd (MInt i2 :: MInt i1 :: vs) = pure $ MInt (i1 + i2) :: vs\nadd _ = error \"int and int expected in add\"\n\nsub : Stack -> MEff Stack\nsub (MInt i2 :: MInt i1 :: vs) = pure $ MInt (i1 - i2) :: vs\nsub _ = error \"int and int expected in sub\"\n\nequal : Stack -> MEff Stack\nequal (MInt i2 :: MInt i1 :: vs) = pure $ MBool (i1 == i2) :: vs\nequal _ = error \"int and int expected in equal\"\n\nless : Stack -> MEff Stack\nless (MInt i2 :: MInt i1 :: vs) = pure $ MBool (i1 < i2) :: vs\nless _ = error \"int and int expected in less\"\n \nFrames : Type\nFrames = List Frame\n\nbuildClosure : Frames -> Stack -> Environs -> Env -> MName -> MName -> Frame -> (Frames, Stack, Environs)\nbuildClosure frames stack envs env fnm nm frame =\n (frames, c :: stack, envs)\n where c = MClosure nm frame ((fnm, c) :: env)\n\nexec : Instr -> Frames -> Stack -> Environs -> MEff (Frames, Stack, Environs)\nexec instr frames stack envs = case instr of\n -- Arithmetic operations.\n IMult => do stack' <- mult stack\n pure (frames, stack', envs)\n IAdd => do stack' <- add stack\n pure (frames, stack', envs)\n ISub => do stack' <- sub stack\n pure (frames, stack', envs)\n IEqual=> do stack' <- equal stack\n pure (frames, stack', envs)\n ILess => do stack' <- less stack\n pure (frames, stack', envs)\n -- Pushing values onto the stack.\n IVar nm => do v <- lookup nm envs\n pure $ (frames, v :: stack, envs)\n IInt n => pure $ (frames, MInt n :: stack, envs)\n IBool b => pure $ (frames, MBool b :: stack, envs)\n\n IClosure f nm frame =>\n case head' envs of\n Just env => pure $ buildClosure frames stack envs env f nm frame\n Nothing => error \"No environment for a closure\"\n\n -- Control instructions.\n IBranch f1 f2 => do (b, stack') <- popBool stack\n pure $ ((if b then f1 else f2) :: frames, stack', envs)\n\n ICall => do (nm, frame, env, v, stack') <- popApp stack\n pure $ (frame :: frames, stack', ((nm, v) :: env) :: envs)\n\n IPopEnv => case envs of\n _ :: envs' => pure (frames, stack, envs')\n _ => error \"No environment to pop\"\n\nexport\nmrun : Frame -> Env -> MEff (MValue, Env)\nmrun frame env = loop ([frame], [], [env])\n where \n loop : (Frames, Stack, Environs) -> MEff (MValue, Env)\n loop ([], [v], [env]) = pure (v, env)\n loop ((i::is) :: frames, stack, envs) = do r <- exec i (is::frames) stack envs\n loop r\n loop ([] :: frames, stack, envs) = loop (frames, stack, envs)\n", "meta": {"hexsha": "07b0ccae4db8ae1230adccaa51597f8c6493d7cd", "size": 4645, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Machine.idr", "max_stars_repo_name": "steshaw/idris-miniml", "max_stars_repo_head_hexsha": "7c42e3fb87c9f9d40f0944555c312bdaf5b0e943", "max_stars_repo_licenses": ["BSD-2-Clause"], "max_stars_count": 3, "max_stars_repo_stars_event_min_datetime": "2016-07-15T05:15:22.000Z", "max_stars_repo_stars_event_max_datetime": "2021-09-23T01:01:20.000Z", "max_issues_repo_path": "src/Machine.idr", "max_issues_repo_name": "steshaw/idris-miniml", "max_issues_repo_head_hexsha": "7c42e3fb87c9f9d40f0944555c312bdaf5b0e943", "max_issues_repo_licenses": ["BSD-2-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Machine.idr", "max_forks_repo_name": "steshaw/idris-miniml", "max_forks_repo_head_hexsha": "7c42e3fb87c9f9d40f0944555c312bdaf5b0e943", "max_forks_repo_licenses": ["BSD-2-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 29.03125, "max_line_length": 105, "alphanum_fraction": 0.5756727664, "num_tokens": 1396, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6791786991753931, "lm_q2_score": 0.5506073655352404, "lm_q1q2_score": 0.37396079428061474}} {"text": "module Dot\n\nimport Graph.Core\nimport Graph.API\n\n-- %default total\n\ndata Kind = Undirected | Directed\n\ndata Attribute : Type where\n Color : String -> Attribute\n Label : String -> Attribute\n\ndata EdgeDef : (kind : Kind) -> Type where\n SimpleEdge : (target : String) -> (source : String) -> EdgeDef kind\n (::) : String -> EdgeDef kind -> EdgeDef kind\n\ndata Statement : (kind : Kind) -> Type where\n Node : String -> List Attribute -> Statement kind\n Edge : EdgeDef kind -> List Attribute -> Statement kind\n\nrecord Dot (kind : Kind) where\n constructor MkDot\n strict : Bool\n id : Maybe String\n body : List (Statement kind)\n\nShow Kind where\n show Undirected = \"graph\"\n show Directed = \"digraph\"\n\nShow Attribute where\n show (Color col) = \"color=\" ++ col\n show (Label lab) = \"label=\" ++ lab\n\nedgeConnector : Kind -> String\nedgeConnector Undirected = \"--\"\nedgeConnector Directed = \"->\"\n\nShow (EdgeDef kind) where\n show (SimpleEdge target source) = unwords [source, edgeConnector kind, target]\n show (target :: def) = unwords [show def, edgeConnector kind, target]\n\nappendAttrs : List Attribute -> String -> String\nappendAttrs [] str = str\nappendAttrs attrs str = str ++ (\" [\" ++ tags ++ \"]\") where\n tags = unwords (map show attrs)\n\nShow (Statement kind) where\n show (Node node attrs) = appendAttrs attrs (node)\n show (Edge def attrs) = appendAttrs attrs (show def)\n\nshowDeclaration : Dot kind -> String\nshowDeclaration dot = unwords . putStrict . putKind . putId $ [] where\n putKind : List String -> List String\n putKind ws = (show kind) :: ws\n putId : List String -> List String\n putId ws = case id dot of\n Nothing => ws\n Just identifier => identifier :: ws\n putStrict : List String -> List String\n putStrict ws = if strict dot then \"strict\" :: ws else ws\n\nshowBody : Dot kind -> String\nshowBody dot = unlines (map show (body dot))\n\nShow (Dot kind) where\n show dot = showDeclaration dot ++ \" {\\n\" ++ showBody dot ++ \"\\n}\"\n\ntest : Dot Directed\ntest = MkDot True (Just \"yo\") [\n Node \"a\" [],\n Node \"b\" [],\n Edge (SimpleEdge \"a\" \"b\") []\n ]\n\nfromGraph : (Show a, Show b) => Graph a b -> Dot Directed\nfromGraph graph = MkDot False Nothing (nodes ++ edges) where\n nodes : List (Statement Directed)\n nodes = map (\\(id, l) => Node (show id) [Label (show l)]) (labNodes graph)\n edges : List (Statement Directed)\n edges = map f (labEdges graph) where\n f : Show b => (Int, Int, b) -> Statement Directed\n f (source, target, l)\n = Edge (SimpleEdge (show target) (show source)) [Label (show l)]\n\nexport\ngraphToDot : (Show a, Show b) => Graph a b -> String\ngraphToDot = show . fromGraph\n\n\n", "meta": {"hexsha": "c5811a055edffb438b05810a20a13ac6ee876adf", "size": 2643, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Graph/Dot.idr", "max_stars_repo_name": "gpyh/idris-graph", "max_stars_repo_head_hexsha": "c6ccb72cd839138cd2a5e0c0866b333f35635f06", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2017-01-29T03:30:17.000Z", "max_stars_repo_stars_event_max_datetime": "2017-01-29T03:30:17.000Z", "max_issues_repo_path": "src/Graph/Dot.idr", "max_issues_repo_name": "gpyh/idris-graph", "max_issues_repo_head_hexsha": "c6ccb72cd839138cd2a5e0c0866b333f35635f06", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Graph/Dot.idr", "max_forks_repo_name": "gpyh/idris-graph", "max_forks_repo_head_hexsha": "c6ccb72cd839138cd2a5e0c0866b333f35635f06", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 28.7282608696, "max_line_length": 80, "alphanum_fraction": 0.6568293606, "num_tokens": 719, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.5698526660244837, "lm_q2_score": 0.6548947425132315, "lm_q1q2_score": 0.37319351498658276}} {"text": "||| How to rename things\n|||\n||| Module : Renaming.idr\n||| Copyright : (c) Jan de Muijnck-Hughes\n||| License : see LICENSE\n|||\nmodule Toolkit.DeBruijn.Renaming\n\nimport Decidable.Equality\nimport Data.DPair\n\nimport Toolkit.Decidable.Informative\n\nimport Toolkit.Data.List.AtIndex\nimport Toolkit.Data.DList\nimport Toolkit.Data.DList.AtIndex\n\nimport Toolkit.DeBruijn.Context.Item\nimport Toolkit.DeBruijn.Context\n\n%default total\n\npublic export\ndata IsVar : (ctxt : List kind)\n -> (type : kind)\n -> Type\n where\n V : ( pos : Nat)\n -> (0 prf : AtIndex type ctxt pos)\n -> IsVar ctxt type\n\npublic export\n%inline\nshift : IsVar ctxt type -> IsVar (ctxt += a) type\nshift (V pos prf) = V (S pos) (There prf)\n\npublic export\n%inline\nweaken : (func : IsVar old type\n -> IsVar new type)\n -> (IsVar (old += type') type\n -> IsVar (new += type') type)\nweaken f (V Z Here)\n = V Z Here\nweaken f (V (S idx) (There later)) with (f (V idx later))\n weaken f (V (S idx) (There later)) | (V pos prf)\n = V (S pos) (There prf)\n\npublic export\ninterface Rename (type : Type) (term : List type -> type -> Type) | term where\n rename : {old, new : List type}\n -> (f : {ty : type} -> IsVar old ty\n -> IsVar new ty)\n -> ({ty : type} -> term old ty\n -> term new ty)\n\n %inline\n embed : {ty : type}\n -> {ctxt : List type}\n -> IsVar ctxt ty\n -> term ctxt ty\n\npublic export\n%inline\nweakens : {type : Type}\n -> {term : List type -> type -> Type}\n -> Rename type term\n => {old, new : List type}\n -> (f : {ty : type}\n -> IsVar old ty\n -> term new ty)\n -> ({ty,type' : type}\n -> IsVar (old += type') ty\n -> term (new += type') ty)\n\nweakens f (V 0 Here)\n = embed (V Z Here)\nweakens f (V (S idx) (There later))\n = rename shift (f (V idx later))\n\n-- [ EOF ]\n", "meta": {"hexsha": "3ca2819369f84ca808bb8784553f18fba3f3d293", "size": 1997, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Toolkit/DeBruijn/Renaming.idr", "max_stars_repo_name": "border-patrol/linear-circuits", "max_stars_repo_head_hexsha": "e6eb41dc07830d2e337acfad5b087fcc81479aa9", "max_stars_repo_licenses": ["BSD-3-Clause-Clear"], "max_stars_count": 8, "max_stars_repo_stars_event_min_datetime": "2021-11-29T17:20:04.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-10T21:41:44.000Z", "max_issues_repo_path": "src/Toolkit/DeBruijn/Renaming.idr", "max_issues_repo_name": "border-patrol/linear-circuits", "max_issues_repo_head_hexsha": "e6eb41dc07830d2e337acfad5b087fcc81479aa9", "max_issues_repo_licenses": ["BSD-3-Clause-Clear"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Toolkit/DeBruijn/Renaming.idr", "max_forks_repo_name": "border-patrol/linear-circuits", "max_forks_repo_head_hexsha": "e6eb41dc07830d2e337acfad5b087fcc81479aa9", "max_forks_repo_licenses": ["BSD-3-Clause-Clear"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-02-09T19:49:11.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-09T19:49:11.000Z", "avg_line_length": 24.3536585366, "max_line_length": 78, "alphanum_fraction": 0.5403104657, "num_tokens": 583, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6477982315512489, "lm_q2_score": 0.5736784074525096, "lm_q1q2_score": 0.3716278578268726}} {"text": "-- --------------------------------------------------------------- [ DList.idr ]\n-- Module : DList.idr\n-- Copyright : (c) 2015,2016,2017, 2020 See CONTRIBUTORS.md\n-- License : see LICENSE\n-- --------------------------------------------------------------------- [ EOH ]\n\n||| A `list` construct to create lists of dependent types.\n|||\n||| One of the problems with using dependent types is that types\n||| depend on values. This affects the ability to construct lists of\n||| values that have a dependent type. The existing `List` type cannot\n||| be used as it requires all elements to have the same type.\nmodule Toolkit.Data.DList\n\nimport Data.String\nimport public Data.List\nimport public Data.List.Elem\n\n||| A list construct for dependent types.\n|||\n||| @aTy The type of the value contained within the list element type.\n||| @elemTy The type of the elements within the list\n||| @as The List used to contain the different values within the type.\npublic export\ndata DList : (aTy : Type)\n -> (elemTy : aTy -> Type)\n -> (as : List aTy)\n -> Type where\n ||| Create an empty List\n Nil : DList aTy elemTy Nil\n ||| Cons\n |||\n ||| @elem The element to add\n ||| @rest The list for `elem` to be added to.\n (::) : {x : aTy}\n -> (elem : elemTy x)\n -> (rest : DList aTy elemTy xs)\n -> DList aTy elemTy (x::xs)\n\npublic export\nmapToList : (forall x . e x -> b)\n -> DList a e xs\n -> List b\nmapToList _ Nil = Nil\nmapToList f (x::xs) = f x :: mapToList f xs\n\n\n||| Function to show a `DList`.\n|||\n||| Due to limitations in idris wrt to class instances on dependent\n||| types a generic show instance cannot be defined for\n||| sigmalist. This will cause minor annoyances in its use.\n|||\n||| @showFunc A function to show the elements\n||| @l The list to be Shown.\npublic export\nshowDList : (showFunc : forall a . elemTy a -> String)\n -> (l : DList aTy elemTy as)\n -> String\nshowDList f xs = \"[\" ++ unwords (intersperse \",\" (mapToList f xs)) ++ \"]\"\n\n\nnamespace Alt\n public export\n index : (xs : DList iTy eTy is)\n -> (idx : Elem i is)\n -> eTy i\n index (ex :: rest) Here = ex\n index (ex :: rest) (There later) = index rest later\n\n public export\n update : (vs : DList iTy eTy is)\n -> (idx : Elem i is)\n -> (new : eTy i)\n -> DList iTy eTy is\n update (ex :: rest) Here new = new :: rest\n update (ex :: rest) (There later) new = ex :: update rest later new\n\n\n public export\n updateWith : DList iTy eTy is\n -> Elem i is\n -> (eTy i -> eTy i)\n -> DList iTy eTy is\n updateWith (ex :: rest) Here f = f ex :: rest\n updateWith (ex :: rest) (There later) f = ex :: updateWith rest later f\n\n-- --------------------------------------------------------------------- [ EOF ]\n", "meta": {"hexsha": "075493582faa34c04eeaa2e87bfa21d88cc50711", "size": 2816, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Toolkit/Data/DList.idr", "max_stars_repo_name": "gallais/linear-circuits", "max_stars_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_stars_repo_licenses": ["BSD-3-Clause-Clear"], "max_stars_count": 9, "max_stars_repo_stars_event_min_datetime": "2020-11-03T11:33:57.000Z", "max_stars_repo_stars_event_max_datetime": "2021-11-14T17:11:38.000Z", "max_issues_repo_path": "src/Toolkit/Data/DList.idr", "max_issues_repo_name": "gallais/linear-circuits", "max_issues_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_issues_repo_licenses": ["BSD-3-Clause-Clear"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Toolkit/Data/DList.idr", "max_forks_repo_name": "gallais/linear-circuits", "max_forks_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_forks_repo_licenses": ["BSD-3-Clause-Clear"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-02-09T19:49:11.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-09T19:49:11.000Z", "avg_line_length": 31.6404494382, "max_line_length": 80, "alphanum_fraction": 0.5642755682, "num_tokens": 778, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6113819591324416, "lm_q2_score": 0.6076631698328916, "lm_q1q2_score": 0.37151429926506285}} {"text": "import Data.Vect\nimport Data.Vect.Elem\n\ndata Typ : Type where\n TLam : Typ -> Typ -> Typ\n TNat : Typ\n\ndata Term : Typ -> Vect len Typ -> Type where\n Var : Elem a ctx -> Term a ctx\n Lam : Term b (a :: ctx) -> Term (TLam a b) ctx\n Fix : Term a (a :: ctx) -> Term a ctx\n\nlookup : Vect len Typ -> Fin len -> Typ\nlookup (a :: ctx) FZ = a\nlookup (_ :: ctx) (FS n) = lookup ctx n\n\ncount : {ctx : Vect len Typ} -> (n : Fin len) -> Elem (lookup ctx n) ctx\ncount {ctx = _ :: ctx} FZ = Here\ncount {ctx = _ :: ctx} (FS n) = There (count n)\n\nsegfaults : {len : _} -> {ctx : Vect len Typ} ->\n Term (TLam TNat TNat) ctx\nsegfaults = Fix (Lam (Var (count 0)))\n\ncycleDetected : {len : _} -> {ctx : Vect len Typ} ->\n Term (TLam TNat TNat) ctx\ncycleDetected = Fix (Var (count 0))\n\n", "meta": {"hexsha": "cdbb38ddf7c0722020e07c6de586767a86a0e666", "size": 801, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris2/tests/idris2/reg018/cycle.idr", "max_stars_repo_name": "Qqwy/Idris2-Erlang", "max_stars_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "idris2/tests/idris2/reg018/cycle.idr", "max_issues_repo_name": "Qqwy/Idris2-Erlang", "max_issues_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "idris2/tests/idris2/reg018/cycle.idr", "max_forks_repo_name": "Qqwy/Idris2-Erlang", "max_forks_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 27.6206896552, "max_line_length": 72, "alphanum_fraction": 0.5642946317, "num_tokens": 271, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7248702761768249, "lm_q2_score": 0.5117166047041654, "lm_q1q2_score": 0.37092815657617545}} {"text": "-- examples in \"Type-Driven Development with Idris\"\n-- chapter 11, section 2\n\nimport Data.Primitives.Views\nimport System\n\n-- check that all functions are total\n%default total\n\nrandoms : Int -> Stream Int\nrandoms seed = let seed' = 1664525 * seed + 1013904223 in\n (seed' `shiftR` 2) :: randoms seed'\n\narithInputs : Int -> Stream Int\narithInputs seed = map bound (randoms seed)\n where\n bound : Int -> Int\n bound num with (divides num 12)\n bound ((12 * div) + rem) | (DivBy prf) = rem + 1\n\ndata InfIO : Type where\n Do : IO a\n -> (a -> Inf InfIO)\n -> InfIO\n\nloopPrint : String -> InfIO\nloopPrint msg = Do (putStrLn msg)\n (\\_ => loopPrint msg)\n\npartial\nrun : InfIO -> IO ()\nrun (Do action cont) = do res <- action\n run (cont res)\n\ndata Fuel = Dry | More Fuel\n\ntank : Nat -> Fuel\ntank Z = Dry\ntank (S k) = More (tank k)\n\nrunOnFuel : Fuel -> InfIO -> IO ()\nrunOnFuel (More fuel) (Do act gen) = do res <- act\n runOnFuel fuel (gen res)\nrunOnFuel Dry ios = putStrLn \"Out of fuel\"\n\ndata LazyFuel = LDry | LMore (Lazy LazyFuel)\n\npartial\nforever : LazyFuel\nforever = LMore forever\n\nrunOnLazyFuel : LazyFuel -> InfIO -> IO ()\nrunOnLazyFuel (LMore fuel) (Do act gen) = do res <- act\n runOnLazyFuel fuel (gen res)\nrunOnLazyFuel LDry ios = putStrLn \"Out of fuel\"\n\n(>>=) : IO a -> (a -> Inf InfIO) -> InfIO\n(>>=) = Do\n\nloopPrint' : String -> InfIO\nloopPrint' msg = do putStrLn msg\n loopPrint' msg\n\nquiz' : Stream Int -> (score : Nat) -> InfIO\nquiz' (num1 :: num2 :: nums) score\n = do putStrLn (\"Score so far:\" ++ show score)\n putStr (show num1 ++ \" * \" ++ show num2 ++ \"? \")\n answer <- getLine\n if cast answer == num1 * num2\n then do putStrLn \"Correct!\"\n quiz' nums (score + 1)\n else do putStrLn (\"Wrong, the answer is \" ++ show (num1 * num2))\n quiz' nums score\n\npartial\nmain : IO ()\nmain = do seed <- time\n runOnLazyFuel forever (quiz' (arithInputs (fromInteger seed)) 0)\n", "meta": {"hexsha": "05a57d8eef27161ef4f639234d3698cd677aed99", "size": 2118, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "chapter11/examples_2.idr", "max_stars_repo_name": "pascalpoizat/idris-book", "max_stars_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 4, "max_stars_repo_stars_event_min_datetime": "2018-08-16T00:58:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-15T01:07:37.000Z", "max_issues_repo_path": "chapter11/examples_2.idr", "max_issues_repo_name": "pascalpoizat/idris-book", "max_issues_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "chapter11/examples_2.idr", "max_forks_repo_name": "pascalpoizat/idris-book", "max_forks_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-01-23T03:15:39.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-23T03:15:39.000Z", "avg_line_length": 26.8101265823, "max_line_length": 74, "alphanum_fraction": 0.5755429651, "num_tokens": 603, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6370308082623217, "lm_q2_score": 0.5813030906443133, "lm_q1q2_score": 0.3703079776785326}} {"text": "module TypeFuns\n\nStringOrInt : Bool -> Type\nStringOrInt False = String\nStringOrInt True = Int\n\ngetStringOrInt : (isInt : Bool) -> StringOrInt isInt\ngetStringOrInt False = \"Ninety Four\"\ngetStringOrInt True = 94\n\nvalToString : (isInt : Bool) -> StringOrInt isInt -> String\nvalToString False x = trim x\nvalToString True x = cast x\n", "meta": {"hexsha": "32baf382868a63cc833307a9a5c7f7e562c73bd7", "size": 328, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "TypeFuns.idr", "max_stars_repo_name": "balajisivaraman/idris-book", "max_stars_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2017-12-06T12:38:55.000Z", "max_stars_repo_stars_event_max_datetime": "2017-12-06T12:38:55.000Z", "max_issues_repo_path": "TypeFuns.idr", "max_issues_repo_name": "balajisivaraman/idris-book", "max_issues_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "TypeFuns.idr", "max_forks_repo_name": "balajisivaraman/idris-book", "max_forks_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-08-04T17:48:35.000Z", "max_forks_repo_forks_event_max_datetime": "2018-08-04T17:48:35.000Z", "avg_line_length": 23.4285714286, "max_line_length": 59, "alphanum_fraction": 0.75, "num_tokens": 97, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.5774953651858117, "lm_q2_score": 0.6406358411176238, "lm_q1q2_score": 0.36996422901734183}} {"text": "{- Ctrl-Alt-A: Add definition\n Ctrl-Alt-C: Case split\n Ctrl-Alt-D: Documentation\n Ctrl-Alt-L: Lift hole: Lifts a hole to the top level as a new function definition\n Ctrl-Alt-M: Match: Replaces a hole with a case expression that matches on an intermediate result\n Ctrl-Alt-R: Reloads and typechecks the current buffer\n Ctrl-Alt-S: Search\n Ctrl-Alt-T: Type-check: Displays the type under cursor\n Ctrl-Alt-W: Add With View -}\nmodule Main\n\ndata InfIO : Type where\n Do : IO a -> (a -> Inf InfIO) -> InfIO\n\ntotal\nloopPrint0 : String -> InfIO\nloopPrint0 msg = Do (putStrLn msg) (\\_ => loopPrint0 msg)\n\ndata Fuel = Dry | More (Lazy Fuel)\n\ntank : Nat -> Fuel\ntank Z = Dry\ntank (S n) = More (tank n)\n\nforever : Fuel\nforever = More forever\n\nrun : Fuel -> InfIO -> IO ()\nrun Dry _ = putStrLn \"Out of fuel\"\nrun (More fuel) (Do action cont) = do\n res <- action\n run fuel (cont res)\n\n(>>=) : IO a -> (a -> Inf InfIO) -> InfIO\n(>>=) = Do\n\ntotal\nloopPrint1 : String -> InfIO\nloopPrint1 msg = do\n putStrLn msg\n loopPrint1 msg\n\nmain : IO ()\nmain = do\n run (tank 5) (loopPrint0 \"vroom\")\n run (tank 5) (loopPrint1 \"broom\")\n", "meta": {"hexsha": "6efdc18c890fe09806721d9b367a1fc1c27381e3", "size": 1125, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "test/tdd/chapter11/02_InfiniteProcesses.idr", "max_stars_repo_name": "luc-tielen/idris-grin", "max_stars_repo_head_hexsha": "b259e8861a2a5f66ebf9a545e6d9620b3f0ec969", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 36, "max_stars_repo_stars_event_min_datetime": "2019-06-06T10:35:31.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-21T08:48:30.000Z", "max_issues_repo_path": "test/tdd/chapter11/02_InfiniteProcesses.idr", "max_issues_repo_name": "luc-tielen/idris-grin", "max_issues_repo_head_hexsha": "b259e8861a2a5f66ebf9a545e6d9620b3f0ec969", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 4, "max_issues_repo_issues_event_min_datetime": "2019-11-21T20:45:22.000Z", "max_issues_repo_issues_event_max_datetime": "2022-02-02T12:29:23.000Z", "max_forks_repo_path": "test/tdd/chapter11/02_InfiniteProcesses.idr", "max_forks_repo_name": "luc-tielen/idris-grin", "max_forks_repo_head_hexsha": "b259e8861a2a5f66ebf9a545e6d9620b3f0ec969", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-06-14T13:14:47.000Z", "max_forks_repo_forks_event_max_datetime": "2019-12-07T06:20:45.000Z", "avg_line_length": 23.9361702128, "max_line_length": 99, "alphanum_fraction": 0.664, "num_tokens": 357, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6442251064863697, "lm_q2_score": 0.5736784074525096, "lm_q1q2_score": 0.36957803313002396}} {"text": "data Usage = Once | Many\n\ndata Use : Usage -> (Type -> Type) -> Type -> Type where\n Pure : (1 x : a) -> Use t m a\n BindOnce : (1 act : Use Once m a) -> (1 k : (1 x : a) -> Use t m b) -> Use t m b\n BindMany : (1 act : Use Many m a) -> (1 k : (x : a) -> Use t m b) -> Use t m b\n\ncontType : (Type -> Type) -> Usage -> Usage -> Type -> Type -> Type\ncontType m Once q a b = ((1 x : a) -> Use q m b)\ncontType m Many q a b = ((x : a) -> Use q m b)\n\n(>>=) : {p : _} -> (1 f : Use p m a) -> (1 k : contType m p q a b) -> Use q m b\n(>>=) {p = Once} = BindOnce\n(>>=) {p = Many} = BindMany\n\npure : (1 x : a) -> Use t m a\npure = Pure\n\nOne : (Type -> Type) -> Type -> Type\nOne = Use Once\n\nAny : (Type -> Type) -> Type -> Type\nAny = Use Many\n\ndata DoorState = Closed | Open\n\ndata Door : DoorState -> Type where\n MkDoor : (isOpen : Bool) -> Door (if isOpen then Open else Closed)\n\nnewDoor : One m (Door Closed)\nnewDoor = pure (MkDoor False)\n\nknock : (1 d : Door Closed) -> One m (Door Closed)\nopenDoor : (1 d : Door Closed) ->\n One m (Res Bool (\\r => Door (if r then Open else Closed)))\n\ncloseDoor : (1 d : Door Open) -> One m (Door Closed)\n\ndeleteDoor : (1 d : Door Closed) -> Any m ()\n\ndoorProg : Any m ()\ndoorProg\n = do d <- newDoor\n r <- openDoor d\n let x = 42\n case r of\n what => ?now\n\ndoorProg2 : Any m ()\ndoorProg2\n = do d <- newDoor\n r <- openDoor d\n let x = 42\n case r of\n (res # d) => ?now_1\n\ndoorProg3 : Any m ()\ndoorProg3\n = do d <- newDoor\n r <- openDoor d\n let x = 42\n case r of\n (True # d) => ?now_2\n (False # d) => ?now_3\n", "meta": {"hexsha": "6ad72d9d77582c9fc73762b314167b7070c07ce9", "size": 1681, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris2/tests/idris2/interactive009/Door.idr", "max_stars_repo_name": "Qqwy/Idris2-Erlang", "max_stars_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 396, "max_stars_repo_stars_event_min_datetime": "2016-07-17T08:00:45.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-21T22:47:13.000Z", "max_issues_repo_path": "idris2/tests/idris2/interactive009/Door.idr", "max_issues_repo_name": "Qqwy/Idris2-Erlang", "max_issues_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 54, "max_issues_repo_issues_event_min_datetime": "2016-08-04T06:13:36.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-03T04:00:31.000Z", "max_forks_repo_path": "idris2/tests/idris2/interactive009/Door.idr", "max_forks_repo_name": "Qqwy/Idris2-Erlang", "max_forks_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 28, "max_forks_repo_forks_event_min_datetime": "2016-09-15T15:19:03.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-27T13:05:48.000Z", "avg_line_length": 25.8615384615, "max_line_length": 85, "alphanum_fraction": 0.503271862, "num_tokens": 570, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.7217432182679956, "lm_q2_score": 0.5117166047041654, "lm_q1q2_score": 0.369327989120356}} {"text": "module Typing.Unification\n\nimport Typing.Common\nimport Typing.Util\nimport Typing.Equate\n\n-- oYYYo _YYY_ 0 0 0 8YYYY\n-- %___ 0 0 0 0 0 8___\n-- `\"\"\"p 0 0 0 \"o o\" 8\"\"\"\n-- YoooY \"ooo\" 8ooo \"8\" 8oooo\n\nsolve : List Equation -> TypeChecker Substitution\nsolve eqs0 = go eqs0 []\nwhere\n\tgo : List Equation -> Substitution -> TypeChecker Substitution\n\n\tgo [] subs' = pure subs'\n\n\tgo ((Meta x ~~ Meta y) :: eqs) subs' with (x == y)\n\t\t| True = go eqs subs'\n\t\t| False = do\n\t\t\teqs' <- traverse (evalWithSubs ((x, Meta y)::subs')) eqs\n\t\t\tgo eqs' ((x, Meta y)::subs')\n\n\tgo ((Meta x ~~ t2) :: eqs) subs' = do\n\t\tunless (not (occurs x t2))\n\t\t\t$ throw $ \"Cannot unify because \" ++ show (Meta x)\n\t\t\t\t++ \" occurs in \" ++ show t2\n\t\teqs' <- traverse (evalWithSubs ((x,t2) :: subs')) eqs\n\t\tgo eqs' ((x,t2) :: subs')\n\n\tgo ((t1 ~~ Meta y) :: eqs) subs' = do\n\t\tunless (not (occurs y t1))\n\t\t\t$ throw $ \"Cannot unify because \" ++ show (Meta y)\n\t\t\t\t++ \" occurs in \" ++ show t1\n\t\teqs' <- traverse (evalWithSubs ((y,t1) :: subs')) eqs\n\t\tgo eqs' ((y,t1) :: subs')\n\n\tgo ((Var x ~~ Var y) :: eqs) subs' = do\n\t\tunless (x == y)\n\t\t\t$ throw $ \"Cannot unify variables \" ++ show (Var x)\n\t\t\t\t++ \" and \" ++ show (Var y)\n\t\tgo eqs subs'\n\n\tgo ((DottedVar m1 x1 ~~ DottedVar m2 x2) :: eqs) subs' = do\n\t\tunless (m1 == m2 && x1 == x2)\n\t\t\t$ throw $ \"Cannot unify symbols \" ++ show (DottedVar m1 x1)\n\t\t\t\t++ \" and \" ++ show (DottedVar m2 x2)\n\t\tgo eqs subs'\n\n\tgo ((AbsoluteDottedVar m1 x1 ~~ AbsoluteDottedVar m2 x2) :: eqs) subs' = do\n\t\tunless (m1 == m2 && x1 == x2)\n\t\t\t$ throw $ \"Cannot unify symbols \" ++ show (AbsoluteDottedVar m1 x1)\n\t\t\t\t++ \" and \" ++ show (AbsoluteDottedVar m2 x2)\n\t\tgo eqs subs'\n\tgo ((Ann m1 t1 ~~ Ann m2 t2) :: eqs) subs' = go ((m1 ~~ m2) :: (t1 ~~ t2) :: eqs) subs'\n\n\tgo ((Star ~~ Star) :: eqs) subs' = go eqs subs'\n\n\tgo ((Pi plic1 a1 sc1 ~~ Pi plic2 a2 sc2) :: eqs) subs' = do\n\t\tunless (plic1 == plic2)\n\t\t\t$ throw $ \"Mismatched plicities when trying to unify \"\n\t\t\t\t\t\t++ show (Pi plic1 a1 sc1) ++ \" with \"\n\t\t\t\t\t\t++ show (Pi plic2 a2 sc2)\n\t\ti <- newName\n\t\tcase (head' (names sc1), head' (names sc2)) of\n\t\t\t(Just h1, Just h2) => do\n\t\t\t\tlet b1 = instantiate sc1 [Var (Generated h1 i)]\n\t\t\t\tlet b2 = instantiate sc2 [Var (Generated h2 i)]\n\t\t\t\tgo ((a1 ~~ a2) :: (b1 ~~ b2) :: eqs) subs'\n\t\t\t_ => throw \"should not happen\"\n\n\tgo ((Lam plic1 sc1 ~~ Lam plic2 sc2) :: eqs) subs' = do\n\t\tunless (plic1 == plic2)\n\t\t\t$ throw $ \"Mismatched plicities when trying to unify \"\n\t\t\t\t\t\t++ show (Lam plic1 sc1) ++ \" with \"\n\t\t\t\t\t\t++ show (Lam plic2 sc2)\n\t\ti <- newName\n\t\tcase (head' (names sc1), head' (names sc2)) of\n\t\t\t(Just h1, Just h2) => do\n\t\t\t\tlet b1 = instantiate sc1 [Var (Generated h1 i)]\n\t\t\t\tlet b2 = instantiate sc2 [Var (Generated h2 i)]\n\t\t\t\tgo ((b1 ~~ b2) :: eqs) subs'\n\t\t\t_ => throw \"should not happen\"\n\n\tgo ((App plic1 f1 a1 ~~ App plic2 f2 a2) :: eqs) subs' = do\n\t\tunless (plic1 == plic2)\n\t\t\t$ throw $ \"Mismatched plicities when trying to unify \"\n\t\t\t\t\t\t++ show (App plic1 f1 a1) ++ \" with \"\n\t\t\t\t\t\t++ show (App plic2 f2 a2)\n\t\t-- we should not assume all functions are injective\n\t\t-- so we will drop this equation simply, and check whether all\n\t\t-- holes are filled afterwards\n\t\t-- go ((f1 ~~ f2) :: (a1 ~~ a2) :: eqs) subs'\n\t\tgo eqs subs'\n\n\tgo ((Con c1 as1 ~~ Con c2 as2) :: eqs) subs' = do\n\t\tunless (c1 == c2)\n\t\t\t$ throw $ \"Mismatching constructors \" ++ show c1 ++ \" and \" ++ show c2\n\t\tunless (length as1 == length as2)\n\t\t\t$ throw $ \"Mismatching number of arguments in \"\n\t\t\t\t\t\t++ show (Con c1 as1) ++ \" and \"\n\t\t\t\t\t\t++ show (Con c2 as2)\n\t\teqs' <- zipConArgs as1 as2\n\t\tgo (eqs' ++ eqs) subs'\n\twhere\n\t\tzipConArgs : List (Plict, Term) -> List (Plict, Term) -> TypeChecker (List Equation)\n\t\tzipConArgs [] [] = pure []\n\t\tzipConArgs ((plic1',a1')::as1') ((plic2',a2')::as2') = if plic1' == plic2'\n\t\t\t\tthen do\n\t\t\t\t\teqs' <- zipConArgs as1' as2'\n\t\t\t\t\tpure $ (a1' ~~ a2') :: eqs'\n\t\t\t\telse\n\t\t\t\t\tthrow \"Mismatching plicity.\"\n\t\tzipConArgs _ _ = throw \"Mismatching number of arguments.\"\n\n\tgo ((Case as1 mot1 cs1 ~~ Case as2 mot2 cs2) :: eqs) subs' = do\n\t\tunless(length as1 == length as2)\n\t\t\t$ throw $ \"Mismatching number of case arguments in \"\n\t\t\t\t\t\t++ show (Case as1 mot1 cs1) ++ \" and \"\n\t\t\t\t\t\t++ show (Case as2 mot2 cs2)\n\t\tunless (length cs1 == length cs2)\n\t\t\t$ throw $ \"Mismatching number of clauses in \"\n\t\t\t\t\t\t++ show (Case as1 mot1 cs1) ++ \" and \"\n\t\t\t\t\t\t++ show (Case as2 mot2 cs2)\n\t\tlet argEqs = zipWith (~~) as1 as2\n\t\tmotEqs <- compareCaseMotive mot1 mot2\n\t\tclauseEqs <- compareClauses cs1 cs2\n\t\tgo (argEqs ++ motEqs ++ clauseEqs ++ eqs) subs'\n\n\tgo ((RecordType tele1 ~~ RecordType tele2) :: eqs) subs' = do\n\t\teqs' <- compareTelescope tele1 tele2\n\t\tgo (eqs' ++ eqs) subs'\n\n\tgo ((RecordCon fields1 ~~ RecordCon fields2) :: eqs) subs' = do\n\t\teqs' <- compareFields fields1 fields2\n\t\tgo (eqs' ++ eqs) subs'\n\n\tgo ((Project m1 x1 ~~ Project m2 x2) :: eqs) subs' = do\n\t\tunless (x1 == x2)\n\t\t\t$ throw $ \"Field names not equal: \" ++ x1 ++ \" and \" ++ x2\n\t\tgo ((m1 ~~ m2) :: eqs) subs'\n\n\tgo ((m ~~ m') :: _) _ = throw $ \"Terms not equal: \" ++ show m ++ \" and \" ++ show m'\n\nexport\naddSubstitutions : Substitution -> TypeChecker ()\naddSubstitutions subs0 = do\n\tcompleteSubstitution subs0\n\tsubstituteContext\nwhere\n\tcompleteSubstitution : Substitution -> TypeChecker ()\n\tcompleteSubstitution subs' = do\n\t\tsubs <- substitution\n\t\tlet subs2 = subs' ++ subs\n\t\tlet subs2' = nubBy (\\(a,_) => \\(b,_) => a == b) (map (\\(k,v) => (k, instantiateMetas subs2 v)) subs2)\n\t\tputSubstitution subs2'\n\tsubstituteContext : TypeChecker ()\n\tsubstituteContext = do\n\t\tctx <- context\n\t\tsubs <- substitution\n\t\tlet ctx' = map (instCtx subs) ctx\n\t\tputContext ctx'\n\twhere\n\t\tinstCtx : Substitution -> ContextEntry -> ContextEntry\n\t\tinstCtx subs (i, x, t) = (i, x, instantiateMetas subs t)\n\n\n-- 0 0 8o 0 Y8Y 8YYYY 0 0\n-- 0 0 8Yo 8 0 8___ \"o o\"\n-- 0 0 8 Yo8 0 8\"\"\" 0\n-- \"ooo\" 0 8 o8o 0 0\n\nexport\nunify : Term -> Term -> TypeChecker ()\nunify p q = do\n\tsubs <- solve [p ~~ q]\n\tequate [p ~~ q] subs\n\taddSubstitutions subs\n", "meta": {"hexsha": "e63a52512ec0181b70e1e6155c6681f3dfd66554", "size": 5971, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Typing/Unification.idr", "max_stars_repo_name": "totalscript/totalscript", "max_stars_repo_head_hexsha": "8923f52bb46173f0ad7b03ac0bdb69ee0c9fd13b", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 35, "max_stars_repo_stars_event_min_datetime": "2017-03-08T10:55:30.000Z", "max_stars_repo_stars_event_max_datetime": "2021-08-06T05:05:33.000Z", "max_issues_repo_path": "src/Typing/Unification.idr", "max_issues_repo_name": "totalscript/totalscript", "max_issues_repo_head_hexsha": "8923f52bb46173f0ad7b03ac0bdb69ee0c9fd13b", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 5, "max_issues_repo_issues_event_min_datetime": "2017-03-08T10:26:46.000Z", "max_issues_repo_issues_event_max_datetime": "2017-10-04T20:56:57.000Z", "max_forks_repo_path": "src/Typing/Unification.idr", "max_forks_repo_name": "totalscript/totalscript", "max_forks_repo_head_hexsha": "8923f52bb46173f0ad7b03ac0bdb69ee0c9fd13b", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2017-04-01T15:18:11.000Z", "max_forks_repo_forks_event_max_datetime": "2018-05-30T08:15:47.000Z", "avg_line_length": 33.1722222222, "max_line_length": 103, "alphanum_fraction": 0.5906883269, "num_tokens": 2220, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6224593312018545, "lm_q2_score": 0.5926665999540698, "lm_q1q2_score": 0.3689108554330873}} {"text": "%default total\n\ntest : (f : () -> Bool) -> f === (\\x => True) -> f () = True\ntest (\\x => True) Refl = Refl\n", "meta": {"hexsha": "aa52ac178296b074c84616e384b9d0d03c03d48a", "size": 107, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "tests/idris2/coverage016/Issue633-2.idr", "max_stars_repo_name": "ska80/idris-jvm", "max_stars_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 396, "max_stars_repo_stars_event_min_datetime": "2016-07-17T08:00:45.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-21T22:47:13.000Z", "max_issues_repo_path": "tests/idris2/coverage016/Issue633-2.idr", "max_issues_repo_name": "ska80/idris-jvm", "max_issues_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 54, "max_issues_repo_issues_event_min_datetime": "2016-08-04T06:13:36.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-03T04:00:31.000Z", "max_forks_repo_path": "tests/idris2/coverage016/Issue633-2.idr", "max_forks_repo_name": "ska80/idris-jvm", "max_forks_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 28, "max_forks_repo_forks_event_min_datetime": "2016-09-15T15:19:03.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-27T13:05:48.000Z", "avg_line_length": 21.4, "max_line_length": 60, "alphanum_fraction": 0.4579439252, "num_tokens": 39, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.5888891307678321, "lm_q2_score": 0.6261241702517976, "lm_q1q2_score": 0.3687177183723112}} {"text": "module Printf\n\ndata Format = Number Format\n | Str Format\n | Chr Format\n | Doub Format\n | Lit String Format\n | End\n\n\nPrintfType : Format -> Type\nPrintfType (Number fmt) = (i : Int) -> PrintfType fmt\nPrintfType (Str fmt) = (str : String) -> PrintfType fmt\n-- `str` is ignored here because we are computing types, not values\nPrintfType (Lit str fmt) = PrintfType fmt\nPrintfType (Chr fmt) = (c : Char) -> PrintfType fmt\nPrintfType (Doub fmt) = (d : Double) -> PrintfType fmt\nPrintfType End = String\n\nprintFmt : (fmt : Format) -> (acc : String) -> PrintfType fmt\nprintFmt (Number fmt) acc = \\i => printFmt fmt (acc ++ (show i))\nprintFmt (Str fmt) acc = \\s => printFmt fmt (acc ++ s)\nprintFmt (Lit str fmt) acc = printFmt fmt (acc ++ str)\nprintFmt (Chr fmt) acc = \\c => printFmt fmt (acc ++ (singleton c))\nprintFmt (Doub fmt) acc = \\d => printFmt fmt (acc ++ (show d))\nprintFmt End acc = acc\n\ntoFormat : (xs : List Char) -> Format\ntoFormat [] = End\ntoFormat ('%' :: 'd' :: chars) = Number $ toFormat chars\ntoFormat ('%' :: 's' :: chars) = Str $ toFormat chars\ntoFormat ('%' :: 'c' :: chars) = Chr $ toFormat chars\ntoFormat ('%' :: 'f' :: chars) = Doub $ toFormat chars\ntoFormat ('%' :: chars) = Lit \"%\" $ toFormat chars\n-- Below implementation seems to be of an efficiency concern to me\n-- If we didn't do strcons here, these literals would be concatenated by printFmt\ntoFormat (c :: chars) = case toFormat chars of\n Lit lit chars' => Lit (strCons c lit) chars'\n fmt => Lit (strCons c \"\") fmt\n\nformatString : String -> Format\nformatString = toFormat . unpack\n\nprintf : (fmt : String) -> PrintfType (formatString fmt)\nprintf fmt = printFmt _ \"\"\n\nmain : IO ()\nmain = do\n putStrLn (printf \"%d\" 1)\n", "meta": {"hexsha": "ce07683ba6ee8e266876e845d7ce2e5d99877472", "size": 1890, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Printf.idr", "max_stars_repo_name": "balajisivaraman/idris-book", "max_stars_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2017-12-06T12:38:55.000Z", "max_stars_repo_stars_event_max_datetime": "2017-12-06T12:38:55.000Z", "max_issues_repo_path": "Printf.idr", "max_issues_repo_name": "balajisivaraman/idris-book", "max_issues_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Printf.idr", "max_forks_repo_name": "balajisivaraman/idris-book", "max_forks_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-08-04T17:48:35.000Z", "max_forks_repo_forks_event_max_datetime": "2018-08-04T17:48:35.000Z", "avg_line_length": 37.8, "max_line_length": 81, "alphanum_fraction": 0.5894179894, "num_tokens": 515, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6334102775181399, "lm_q2_score": 0.5813030906443134, "lm_q1q2_score": 0.368203351967167}} {"text": "module Generics.SOP\n\nimport Decidable.Equality\n\nimport public Data.List.Elem\nimport public Data.SOP\n\n%default total\n\n||| Interface for converting a data type from and to\n||| its generic representation as a sum of products.\n|||\n||| Additional Idris coolness: This comes with proofs\n||| that `from . to = id` and `to . from = id` and\n||| thus, that `t` and `SOP code` are indeed isomorphic.\npublic export\ninterface Generic (0 t : Type) (0 code : List $ List Type) | t where\n constructor MkGeneric\n ||| Converts the data type to its generic representation.\n from : (v : t) -> SOP I code\n\n ||| Converts the generic representation back to the original\n ||| value.\n to : (v : SOP I code) -> t\n\n ||| Proof that `to . from = id`.\n fromToId : (v : t) -> to (from v) = v\n\n ||| Proof that `from . to = id`.\n toFromId : (v : SOP I code) -> from (to v) = v\n\nexport\nfromInjective : Generic t code =>\n (0 x : t) -> (0 y : t) -> (from x = from y) -> x = y\nfromInjective x y prf = rewrite sym $ fromToId y in lemma2\n where lemma1 : to {t = t} (from x) = to {t = t} (from y)\n lemma1 = cong to prf\n\n lemma2 : x = to {t = t} (from y)\n lemma2 = rewrite sym $ fromToId x in lemma1\n\npublic export\n0 Code : (t : Type) -> Generic t code => List $ List Type\nCode _ = code\n\n||| Tries to extract the arguments of a single constructor\n||| from a value's generic representation.\npublic export\ngenExtract : (0 ts : List Type)\n -> (v : t)\n -> Generic t code\n => {auto prf : Elem ts code}\n -> Maybe (NP I ts)\ngenExtract ts v = extractSOP ts $ from v\n\n||| Tries to extract the value of a single one argument\n||| constructor from a value's generic representation.\npublic export\ngenExtract1 : (0 t' : Type)\n -> (v : t)\n -> Generic t code\n => {auto prf : Elem [t'] code}\n -> Maybe t'\ngenExtract1 t' v = hd <$> genExtract [t'] v\n\n||| Returns all value from a generic enum type\n||| (all nullary constructors) wrapped in homogeneous n-ary product.\npublic export\nvaluesNP : Generic t code => (et : EnumType code) =>\n NP_ (List Type) (K t) code\nvaluesNP = hmap (to . MkSOP) (run et)\n where run : EnumType kss -> NP_ (List k) (K (NS_ (List k) (NP f) kss)) kss\n run EZ = []\n run (ES x) = Z [] :: mapNP (\\ns => S ns) (run x)\n\n||| Returns all value from a generic enum type\n||| (all nullary constructors) wrapped in a list.\npublic export %inline\nvalues : Generic t code => (et : EnumType code) => List t\nvalues = collapseNP valuesNP\n\n||| Like `valuesNP` but takes the erased value type as an\n||| explicit argument to help with type inference.\npublic export %inline\nvaluesForNP : (0 t: Type) -> Generic t code => (et : EnumType code) =>\n NP_ (List Type) (K t) code\nvaluesForNP _ = valuesNP\n\n||| Like `values` but takes the erased value type as an\n||| explicit argument to help with type inference.\npublic export %inline\nvaluesFor : (0 t : Type) -> Generic t code => (et : EnumType code) => List t\nvaluesFor _ = values\n\n--------------------------------------------------------------------------------\n-- Generic Implementation Functions\n--------------------------------------------------------------------------------\n\n||| Default `(==)` implementation for data types with a `Generic`\n||| instance.\npublic export\ngenEq : Generic t code => POP Eq code => t -> t -> Bool\ngenEq x y = from x == from y\n\n||| Default `compare` implementation for data types with a `Generic`\n||| instance.\npublic export\ngenCompare : Generic t code => POP Ord code => t -> t -> Ordering\ngenCompare x y = compare (from x) (from y)\n\n||| Default `decEq` implementation for data types with a `Generic`\n||| instance.\npublic export\ngenDecEq : Generic t code => POP DecEq code\n => (x : t) -> (y : t) -> Dec (x = y)\ngenDecEq x y = case decEq (from x) (from y) of\n (Yes prf) => Yes $ fromInjective x y prf\n (No contra) => No $ \\h => contra (cong from h)\n\n||| Default `(<+>)` implementation for data types with a `Generic`\n||| instance.\npublic export\ngenAppend : Generic t [ts]\n => POP Semigroup [ts]\n => t -> t -> t\ngenAppend x y = to $ from x <+> from y\n\n||| Default `neutral` implementation for data types with a `Generic`\n||| instance.\npublic export\ngenNeutral : Generic t [ts] => POP Monoid [ts] => t\ngenNeutral = to neutral\n\n--------------------------------------------------------------------------------\n-- Prelude Implementations\n--------------------------------------------------------------------------------\n\n-- I wrote the implementations below manually to get a feel for\n-- their general structure before starting with deriving\n-- them via elaborator reflection.\n\npublic export\nGeneric () [[]] where\n from () = MkSOP $ Z []\n\n to (MkSOP $ Z []) = ()\n to (MkSOP $ S _) impossible\n\n fromToId () = Refl\n\n toFromId (MkSOP $ Z []) = Refl\n\npublic export\nGeneric (a,b) [[a,b]] where\n from (a,b) = MkSOP $ Z [a,b]\n\n to (MkSOP $ Z [a,b]) = (a,b)\n to (MkSOP $ S _) impossible\n\n fromToId (a,b) = Refl\n\n toFromId (MkSOP $ Z [a,b]) = Refl\n\npublic export\nGeneric (LPair a b) [[a,b]] where\n from (a # b) = MkSOP $ Z [a,b]\n\n to (MkSOP $ Z [a,b]) = (a # b)\n to (MkSOP $ S _) impossible\n\n fromToId (a # b) = Refl\n\n toFromId (MkSOP $ Z [a, b]) = Refl\n\npublic export\nGeneric Void [] where\n from v impossible\n\n to (MkSOP v) impossible\n\n fromToId v impossible\n\n toFromId (MkSOP v) impossible\n\npublic export\nGeneric (Stream a) [[a, Inf (Stream a)]] where\n from (h :: t) = MkSOP $ Z [h,t]\n\n to (MkSOP $ Z [h,t]) = h :: t\n\n fromToId (h :: t) = Refl\n\n toFromId (MkSOP $ Z [h,t]) = Refl\n", "meta": {"hexsha": "fb0f79534febc875715393f811e4e78a083d4686", "size": 5679, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Generics/SOP.idr", "max_stars_repo_name": "buzden/idris2-sop", "max_stars_repo_head_hexsha": "af9224510f5c283f3b3c8293524e51c225617658", "max_stars_repo_licenses": ["BSD-2-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "src/Generics/SOP.idr", "max_issues_repo_name": "buzden/idris2-sop", "max_issues_repo_head_hexsha": "af9224510f5c283f3b3c8293524e51c225617658", "max_issues_repo_licenses": ["BSD-2-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Generics/SOP.idr", "max_forks_repo_name": "buzden/idris2-sop", "max_forks_repo_head_hexsha": "af9224510f5c283f3b3c8293524e51c225617658", "max_forks_repo_licenses": ["BSD-2-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 29.2731958763, "max_line_length": 80, "alphanum_fraction": 0.578622997, "num_tokens": 1658, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6261241772283034, "lm_q2_score": 0.5851011542032312, "lm_q1q2_score": 0.36634597877082875}} {"text": "module Toolkit.Data.Vect.Leanings\n\nimport Data.Vect\n\nimport Toolkit.Data.DVect\n\nnamespace Index\n public export\n data Leans : (o,l,c,r : Nat) -> Type where\n Empty : Leans Z Z Z Z\n\n Left : Leans os ls cs rs\n -> Leans (S os) (S ls) cs rs\n\n Center : Leans os ls cs rs\n -> Leans (S os) ls (S cs) rs\n\n Right : Leans os ls cs rs\n -> Leans (S os) ls cs (S rs)\n\npublic export\ndata IsCenter : (type : Type)\n -> (goLeft : type -> Type)\n -> (goRight : type -> Type)\n -> (o : type)\n -> Type\n where\n C : (noLeft : left o -> Void)\n -> (noRight : right o -> Void)\n -> IsCenter type left right o\n\npublic export\ndata Leaning : (type : Type)\n -> (goLeft : type -> Type)\n -> (goRight : type -> Type)\n -> (idx : Leans o l c r)\n -> (os : Vect o type)\n -> (ls : Vect l type)\n -> (cs : Vect c type)\n -> (rs : Vect r type)\n -> Type\n where\n Empty : Leaning type left right Empty Nil Nil Nil Nil\n\n Left : {o : type}\n -> (prf : left o)\n -> (rest : Leaning type left right idx os ls cs rs)\n -> Leaning type left right (Left idx) (o::os) (o::ls) cs rs\n\n Center : {o : type}\n -> (prf : IsCenter type left right o)\n -> (rest : Leaning type left right idx os ls cs rs)\n -> Leaning type left right (Center idx) (o::os) ls (o::cs) rs\n\n Right : {o : type}\n -> (prf : right o)\n -> (rest : Leaning type left right idx os ls cs rs)\n -> Leaning type left right (Right idx) (o::os) ls cs (o::rs)\n\npublic export\ndata Result : (type : Type)\n -> (isLeft : (o : type) -> Type)\n -> (isRight : (o : type) -> Type)\n -> (os : Vect o type)\n -> Type\n where\n R : (lefts : Vect l type)\n -> (centers : Vect c type)\n -> (rights : Vect r type)\n -> (idx : Leans o l c r)\n\n -> (leaning : Leaning type isLeft isRight idx os lefts centers rights)\n -> (prfLeft : DVect type isLeft l lefts)\n -> (prfCenter : DVect type (IsCenter type isLeft isRight) c centers)\n -> (prfRight : DVect type isRight r rights)\n -> Result type isLeft isRight os\n\nexport\nleans : {type : Type}\n -> {left : type -> Type}\n -> {right : type -> Type}\n -> (isLeft : (o : type) -> Dec (left o))\n -> (isRight : (o : type) -> Dec (right o))\n -> (os : Vect o type)\n -> Result type left right os\nleans isLeft isRight []\n = R [] [] [] Empty Empty [] [] []\n\nleans l r (x :: xs) with (l x)\n leans l r (x :: xs) | (Yes prf) with (leans l r xs)\n leans l r (x :: xs) | (Yes prf) | (R lefts centers rights idx lean prfLeft prfCenter prfRight)\n = R (x::lefts) centers rights (Left idx) (Left prf lean) (prf :: prfLeft) prfCenter prfRight\n\n leans l r (x :: xs) | (No noL) with (r x)\n leans l r (x :: xs) | (No noL) | (Yes prf) with (leans l r xs)\n leans l r (x :: xs) | (No noL) | (Yes prf) | (R ls cs rs idx lean pLs pCs pRs)\n = R ls cs (x::rs) (Right idx) (Right prf lean) pLs pCs (prf :: pRs)\n\n leans l r (x :: xs) | (No noL) | (No noR) with (leans l r xs)\n leans l r (x :: xs) | (No noL) | (No noR) | (R ls cs rs idx lean pLs pCs pRs)\n = R ls (x::cs) rs (Center idx) (Center (C noL noR) lean) pLs (C noL noR :: pCs) pRs\n\nnamespace Poll\n\n public export\n data LeansLeft : (poll : Leaning type l r i os ls rs cs)\n -> Type\n where\n EmptyL : LeansLeft Empty\n\n IsLeft : {rest : Leaning type l r i os ls cs rs}\n -> {prf : l o}\n -> (later : LeansLeft rest)\n -> LeansLeft (Left prf rest)\n\n Uninhabited (LeansLeft (Center prf rest)) where\n uninhabited EmptyL impossible\n uninhabited (IsLeft later) impossible\n\n Uninhabited (LeansLeft (Right prf rest)) where\n uninhabited EmptyL impossible\n uninhabited (IsLeft later) impossible\n\n export\n leansLeft : (poll : Leaning type l r i os ls cs rs)\n -> Dec (LeansLeft poll)\n leansLeft Empty\n = Yes EmptyL\n\n leansLeft (Left prf rest) with (leansLeft rest)\n leansLeft (Left prf rest) | (Yes x)\n = Yes (IsLeft x)\n\n leansLeft (Left prf rest) | (No contra)\n = No (\\(IsLeft later) => contra later)\n\n leansLeft (Center prf rest)\n = No absurd\n\n leansLeft (Right prf rest)\n = No absurd\n\n public export\n data LeansRight : (poll : Leaning type l r i os ls cs rs)\n -> Type\n where\n EmptyR : LeansRight Empty\n\n IsRight : {rest : Leaning type l r i os ls cs rs}\n -> {prf : r o}\n -> (later : LeansRight rest)\n -> LeansRight (Right prf rest)\n\n Uninhabited (LeansRight (Center prf rest)) where\n uninhabited EmptyR impossible\n uninhabited (IsRight later) impossible\n\n Uninhabited (LeansRight (Left prf rest)) where\n uninhabited EmptyR impossible\n uninhabited (IsRight later) impossible\n\n export\n leansRight : (poll : Leaning type l r i os ls cs rs)\n -> Dec (LeansRight poll)\n leansRight Empty\n = Yes EmptyR\n\n leansRight (Right prf rest) with (leansRight rest)\n leansRight (Right prf rest) | (Yes x)\n = Yes (IsRight x)\n\n leansRight (Right prf rest) | (No contra)\n = No (\\(IsRight later) => contra later)\n\n leansRight (Center prf rest)\n = No absurd\n\n leansRight (Left prf rest)\n = No absurd\n\n public export\n data LeansCenter : (poll : Leaning type l r i os ls cs rs)\n -> Type\n where\n EmptyC : LeansCenter Empty\n\n IsCenter : {rest : Leaning type l r i os ls cs rs}\n -> {prf : IsCenter type l r o}\n -> (later : LeansCenter rest)\n -> LeansCenter (Center prf rest)\n\n Uninhabited (LeansCenter (Right prf rest)) where\n uninhabited EmptyC impossible\n uninhabited (IsCenter later) impossible\n\n Uninhabited (LeansCenter (Left prf rest)) where\n uninhabited EmptyC impossible\n uninhabited (IsCenter later) impossible\n\n export\n leansCenter : (poll : Leaning type l r i os ls cs rs)\n -> Dec (LeansCenter poll)\n leansCenter Empty\n = Yes EmptyC\n\n leansCenter (Center prf rest) with (leansCenter rest)\n leansCenter (Center prf rest) | (Yes x)\n = Yes (IsCenter x)\n\n leansCenter (Center prf rest) | (No contra)\n = No (\\(IsCenter later) => contra later)\n\n leansCenter (Right prf rest)\n = No absurd\n\n leansCenter (Left prf rest)\n = No absurd\n\npublic export\ndata HowLeans : (poll : Leaning type l r i os ls cs rs) -> Type where\n LE : HowLeans Empty\n LL : LeansLeft poll -> HowLeans poll\n\n LC : (LeansLeft poll -> Void)\n -> (LeansRight poll -> Void)\n -> HowLeans poll\n\n LR : LeansRight poll -> HowLeans poll\n\nexport\nhowLeans : (poll : Leaning type l r i os ls cs rs) -> HowLeans poll\nhowLeans {ls=Nil} {cs=Nil} {rs=Nil} Empty = LE\n\nhowLeans {ls} {cs} {rs} poll with (leansLeft poll)\n howLeans {ls = ls} {cs = cs} {rs = rs} poll | (Yes prf)\n = LL prf\n\n howLeans {ls = ls} {cs = cs} {rs = rs} poll | (No noL) with (leansRight poll)\n howLeans {ls = ls} {cs = cs} {rs = rs} poll | (No noL) | (Yes prf)\n = LR prf\n\n howLeans {ls = ls} {cs = cs} {rs = rs} poll | (No noL) | (No noR)\n = LC noL noR\n\n-- [ EOF ]\n", "meta": {"hexsha": "ce300151bb5bab7a66b7800424f70f1033c5f78e", "size": 7567, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Toolkit/Data/Vect/Leanings.idr", "max_stars_repo_name": "gallais/linear-circuits", "max_stars_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_stars_repo_licenses": ["BSD-3-Clause-Clear"], "max_stars_count": 8, "max_stars_repo_stars_event_min_datetime": "2021-11-29T17:20:04.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-10T21:41:44.000Z", "max_issues_repo_path": "src/Toolkit/Data/Vect/Leanings.idr", "max_issues_repo_name": "gallais/linear-circuits", "max_issues_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_issues_repo_licenses": ["BSD-3-Clause-Clear"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Toolkit/Data/Vect/Leanings.idr", "max_forks_repo_name": "gallais/linear-circuits", "max_forks_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_forks_repo_licenses": ["BSD-3-Clause-Clear"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-02-09T19:49:11.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-09T19:49:11.000Z", "avg_line_length": 30.7601626016, "max_line_length": 98, "alphanum_fraction": 0.5438086428, "num_tokens": 2339, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6261241632752915, "lm_q2_score": 0.5851011542032312, "lm_q1q2_score": 0.36634597060690544}} {"text": "module Sub11Apply108x54\r\n\r\nimport ProofColDivSeqBase\r\nimport ProofColDivSeqPostulate\r\n\r\n%default total\r\n-- %language ElabReflection\r\n\r\n\r\n-- 3(36x+18) --F[5,-2]->C[4,-4]--> 3(32x+15)\r\nfc108x54To96x45 :\r\n (o:Nat) -> P (S (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))))))) 2\r\n -> P (S (S (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))))))))))))))))))) 2\r\nfc108x54To96x45 o prf =\r\n let prf2 = lvDown (S (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))))))) 2\r\n prf in\r\n let prf3 = fc108x54To96x45' o prf2 in lvDown (S (S (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))))))))))))))))))) 3 prf3\r\n\r\n\r\nexport\r\napply108x54 : P (S (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))))))) 2\r\n -> (m : Nat **\r\n (LTE (S m)\r\n (S (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))))))),\r\n P m 2))\r\napply108x54 {o} col = let col2 = fc108x54To96x45 o col in ((S (S (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))) (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))))))))))))))))))) ** (lte108x54 o, col2)) where\r\n lte108x54 : (o:Nat) -> LTE (S (S (S (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (plus (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))))))))))))))))))))\r\n (S (S (S (S (S (plus (plus (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o))) (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))))))))))\r\n lte108x54 Z = (lteSuccRight . lteSuccRight . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc) LTEZero\r\n lte108x54 (S o) = let lemma = lte108x54 o in\r\n rewrite (sym (plusSuccRightSucc o o)) in\r\n rewrite (sym (plusSuccRightSucc (plus o o) (S (plus o o)))) in\r\n rewrite (sym (plusSuccRightSucc (plus o o) (plus o o))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (S (S (plus (plus o o) (plus o o))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (S (plus (plus o o) (plus o o)))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (S (plus (plus o o) (plus o o))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o)))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (S (S (S (S (S (S (S (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (S (S (S (S (S (S (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (S (S (S (S (S (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (S (S (S (S (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (S (S (S (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (S (S (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (S (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o))))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o))))))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o)))))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o))))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o)))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o)))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o)))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o)))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o)))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o)))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (S (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) (plus o o))\r\n (plus (plus o o) (plus o o)))\r\n (plus (plus (plus o o) (plus o o)) (plus (plus o o) (plus o o))))\r\n (plus (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o o)))\r\n (plus (plus (plus o o)\r\n (plus o o))\r\n (plus (plus o o)\r\n (plus o\r\n o)))))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus o o) o)) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (S (S (S (plus (plus o o) o)))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (S (S (plus (plus o o) o))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus o o) o) (S (plus (plus o o) o)))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (S (S (S (S (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (S (S (S (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (S (S (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (S (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o))))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o))))))))) in\r\n\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o)))))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o))))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o)))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o))))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o)))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o))))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o)))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o))))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o)))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o))))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o)))))))))) in\r\n rewrite (sym (plusSuccRightSucc (plus (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o)))))\r\n (S (S (plus (plus (plus (plus o o) o) (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o) (S (plus (plus o o) o))))))))\r\n (S (S (plus (plus (plus (plus o o) o)\r\n (S (plus (plus o o) o)))\r\n (S (plus (plus (plus o o) o)\r\n (S (plus (plus o o)\r\n o))))))))) in\r\n (lteSuccRight . lteSuccRight . lteSuccRight . lteSuccRight . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc . LTESucc) lemma\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "meta": {"hexsha": "0668fbfa9d3f0b7e033468a6be0475a86c3963b3", "size": 63700, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "program/Sub11Apply108x54.idr", "max_stars_repo_name": "righ1113/collatzProof_DivSeq", "max_stars_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "program/Sub11Apply108x54.idr", "max_issues_repo_name": "righ1113/collatzProof_DivSeq", "max_issues_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 3, "max_issues_repo_issues_event_min_datetime": "2019-01-26T12:59:21.000Z", "max_issues_repo_issues_event_max_datetime": "2019-10-19T07:02:00.000Z", "max_forks_repo_path": "program/Sub11Apply108x54.idr", "max_forks_repo_name": "righ1113/collatzProof_DivSeq", "max_forks_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 128.9473684211, "max_line_length": 392, "alphanum_fraction": 0.1863579278, "num_tokens": 9927, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.7853085708384736, "lm_q2_score": 0.4649015713733885, "lm_q1q2_score": 0.36509118859579637}} {"text": "-- exercises in \"Type-Driven Development with Idris\"\n-- chapter 12, section 3\n\n-- check that all functions are total\n%default total\n\nrecord Votes where\n constructor MkVotes\n upvotes : Integer\n downvotes : Integer\n\nrecord Article where\n constructor MkArticle\n title : String\n url : String\n score : Votes\n\ninitPage : (title : String) -> (url : String) -> Article\ninitPage title url = MkArticle title url (MkVotes 0 0)\n\ngetScore : Article -> Integer\ngetScore a = let s = score a in (upvotes s) - (downvotes s)\n\nbadSite : Article\nbadSite = MkArticle \"Bad Page\" \"http://example.com/bad\" $ MkVotes 5 47\n\ngoodSite : Article\ngoodSite = MkArticle \"Good Page\" \"http://example.com/good\" $ MkVotes 101 7\n\naddUpVote : Article -> Article\naddUpVote = record { score->upvotes $= (+1) }\n\naddDownVote : Article -> Article\naddDownVote = record { score->downvotes $= (+1) }\n", "meta": {"hexsha": "3ded9adddd1583766d51ae67b9f4d91aafe3b35e", "size": 861, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "chapter12/SocialNews.idr", "max_stars_repo_name": "pascalpoizat/idris-book", "max_stars_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 4, "max_stars_repo_stars_event_min_datetime": "2018-08-16T00:58:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-15T01:07:37.000Z", "max_issues_repo_path": "chapter12/SocialNews.idr", "max_issues_repo_name": "pascalpoizat/idris-book", "max_issues_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "chapter12/SocialNews.idr", "max_forks_repo_name": "pascalpoizat/idris-book", "max_forks_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-01-23T03:15:39.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-23T03:15:39.000Z", "avg_line_length": 24.6, "max_line_length": 74, "alphanum_fraction": 0.7084785134, "num_tokens": 250, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.6076631698328916, "lm_q2_score": 0.600188359260205, "lm_q1q2_score": 0.3647123608848585}} {"text": "module Data.Either\n\nimport public Control.Function\nimport Data.List1\n\n%default total\n\n--------------------------------------------------------------------------------\n-- Checking for a specific constructor\n\n||| Extract the Left value, if possible\npublic export\ngetLeft : Either a b -> Maybe a\ngetLeft (Left a) = Just a\ngetLeft _ = Nothing\n\n||| Extract the Right value, if possible\npublic export\ngetRight : Either a b -> Maybe b\ngetRight (Right b) = Just b\ngetRight _ = Nothing\n\n||| True if the argument is Left, False otherwise\npublic export\nisLeft : Either a b -> Bool\nisLeft (Left _) = True\nisLeft (Right _) = False\n\n||| True if the argument is Right, False otherwise\npublic export\nisRight : Either a b -> Bool\nisRight (Left _) = False\nisRight (Right _) = True\n\n||| Proof that an `Either` is actually a Right value\npublic export\ndata IsRight : Either a b -> Type where\n ItIsRight : IsRight (Right x)\n\nexport\nUninhabited (IsRight (Left x)) where\n uninhabited ItIsRight impossible\n\n||| Proof that an `Either` is actually a Left value\npublic export\ndata IsLeft : Either a b -> Type where\n ItIsLeft : IsLeft (Left x)\n\nexport\nUninhabited (IsLeft (Right x)) where\n uninhabited ItIsLeft impossible\n\n--------------------------------------------------------------------------------\n-- Grouping values\n\n||| Compress the list of Lefts and Rights by accumulating\n||| all of the lefts and rights into non-empty blocks.\nexport\ncompress : List (Either a b) -> List (Either (List1 a) (List1 b))\ncompress [] = []\ncompress (Left x :: abs) = compressLefts (singleton x) abs where\n compressLefts : List1 a -> List (Either a b) -> List (Either (List1 a) (List1 b))\n compressLefts acc (Left a :: abs) = compressLefts (cons a acc) abs\n compressLefts acc abs = Left (reverse acc) :: compress abs\ncompress (Right y :: abs) = compressRights (singleton y) abs where\n compressRights : List1 b -> List (Either a b) -> List (Either (List1 a) (List1 b))\n compressRights acc (Right b :: abs) = compressRights (cons b acc) abs\n compressRights acc abs = Right (reverse acc) :: compress abs\n\n||| Decompress a compressed list. This is the left inverse of `compress` but not its\n||| right inverse because nothing forces the input to be maximally compressed!\nexport\ndecompress : List (Either (List1 a) (List1 b)) -> List (Either a b)\ndecompress = concatMap $ \\case\n Left as => map Left $ forget as\n Right bs => map Right $ forget bs\n\n||| Keep the payloads of all Left constructors in a list of Eithers\npublic export\nlefts : List (Either a b) -> List a\nlefts [] = []\nlefts (Left l :: xs) = l :: lefts xs\nlefts (Right _ :: xs) = lefts xs\n\n||| Keep the payloads of all Right constructors in a list of Eithers\npublic export\nrights : List (Either a b) -> List b\nrights [] = []\nrights (Left _ :: xs) = rights xs\nrights (Right r :: xs) = r :: rights xs\n\n||| Split a list of Eithers into a list of the left elements and a list of the right elements\npublic export\npartitionEithers : List (Either a b) -> (List a, List b)\npartitionEithers l = (lefts l, rights l)\n\n||| Remove a \"useless\" Either by collapsing the case distinction\npublic export\nfromEither : Either a a -> a\nfromEither (Left l) = l\nfromEither (Right r) = r\n\n||| Right becomes left and left becomes right\npublic export\nmirror : Either a b -> Either b a\nmirror (Left x) = Right x\nmirror (Right x) = Left x\n\n--------------------------------------------------------------------------------\n-- Bifunctor\n\nexport\npushInto : c -> Either a b -> Either (c, a) (c, b)\npushInto c = bimap (\\ a => (c, a)) (\\ b => (c, b))\n -- ^ not using sections to keep it backwards compatible\n\n--------------------------------------------------------------------------------\n-- Conversions\n--------------------------------------------------------------------------------\n\n||| Convert a Maybe to an Either by using a default value in case of Nothing\n||| @ e the default value\npublic export\nmaybeToEither : (def : Lazy e) -> Maybe a -> Either e a\nmaybeToEither def (Just j) = Right j\nmaybeToEither def Nothing = Left def\n\n||| Convert an Either to a Maybe from Right injection\npublic export\neitherToMaybe : Either e a -> Maybe a\neitherToMaybe (Left _) = Nothing\neitherToMaybe (Right x) = Just x\n\nexport\neitherMapFusion : (f : _) -> (g : _) -> (p : _) -> (e : Either a b) -> either f g (map p e) = either f (g . p) e\neitherMapFusion f g p $ Left x = Refl\neitherMapFusion f g p $ Right x = Refl\n\nexport\neitherBimapFusion : (f : _) -> (g : _) -> (p : _) -> (q : _) -> (e : _) -> either f g (bimap p q e) = either (f . p) (g . q) e\neitherBimapFusion f g p q $ Left z = Refl\neitherBimapFusion f g p q $ Right z = Refl\n\n-- Injectivity of constructors\n\n||| Left is injective\nexport\nInjective Left where\n injective Refl = Refl\n\n||| Right is injective\nexport\nInjective Right where\n injective Refl = Refl\n", "meta": {"hexsha": "fa583eadc11ee6d351793b9a1348d60f0d2b5f75", "size": 4836, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris2/libs/base/Data/Either.idr", "max_stars_repo_name": "chrrasmussen/Idris2-Erlang", "max_stars_repo_head_hexsha": "dfa38cd866fd683d4bdda49fc0bf2f860de273b4", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 128, "max_stars_repo_stars_event_min_datetime": "2020-06-09T21:25:49.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-31T23:50:24.000Z", "max_issues_repo_path": "idris2/libs/base/Data/Either.idr", "max_issues_repo_name": "chrrasmussen/Idris2-Erlang", "max_issues_repo_head_hexsha": "dfa38cd866fd683d4bdda49fc0bf2f860de273b4", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 9, "max_issues_repo_issues_event_min_datetime": "2020-08-26T03:38:49.000Z", "max_issues_repo_issues_event_max_datetime": "2021-09-23T21:32:49.000Z", "max_forks_repo_path": "idris2/libs/base/Data/Either.idr", "max_forks_repo_name": "chrrasmussen/Idris2-Erlang", "max_forks_repo_head_hexsha": "dfa38cd866fd683d4bdda49fc0bf2f860de273b4", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 8, "max_forks_repo_forks_event_min_datetime": "2020-08-28T04:16:04.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-20T12:47:16.000Z", "avg_line_length": 31.2, "max_line_length": 126, "alphanum_fraction": 0.6292390405, "num_tokens": 1319, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.5389832206876841, "lm_q2_score": 0.6757646075489392, "lm_q1q2_score": 0.36422578460347615}} {"text": "module EquivExercises\n\nimport Equiv\nimport Expr\nimport Imp\nimport Inequiv\nimport Logic\nimport Maps\n\n%access public export\n\n%default total\n\nnoninterfering_update : Not (l1 = l2) ->\n VarNotUsedInAExp l1 a2 ->\n VarNotUsedInAExp l2 a1 ->\n aeval st a1 = n1 ->\n ((aeval (t_update l1 n1 st) a2 = n2) ↔ aeval st a2 = n2)\nnoninterfering_update _ (VNUNum _) _ _ = (id, id)\nnoninterfering_update _ (VNUId y contra) _ _ =\n rewrite snd (beq_id_false_iff {x=l1} {y=y}) contra\n in (id, id)\nnoninterfering_update {st} contra (VNUPlus _ _ l1nua3 l1nua4) l2nua1 prf1 =\n let ih1 = noninterfering_update {st=st} contra l1nua3 l2nua1 prf1\n ih2 = noninterfering_update {st=st} contra l1nua4 l2nua1 prf1\n in ( \\prf2 => rewrite fst ih1 Refl\n in rewrite fst ih2 Refl\n in prf2\n , \\prf2 => rewrite sym $ fst ih1 Refl\n in rewrite sym $ fst ih2 Refl\n in prf2 )\nnoninterfering_update {st} contra (VNUMinus _ _ l1nua3 l1nua4) l2nua1 prf1 =\n let ih1 = noninterfering_update {st=st} contra l1nua3 l2nua1 prf1\n ih2 = noninterfering_update {st=st} contra l1nua4 l2nua1 prf1\n in ( \\prf2 => rewrite fst ih1 Refl\n in rewrite fst ih2 Refl\n in prf2\n , \\prf2 => rewrite sym $ fst ih1 Refl\n in rewrite sym $ fst ih2 Refl\n in prf2 )\nnoninterfering_update {st} contra (VNUMult _ _ l1nua3 l1nua4) l2nua1 prf1 =\n let ih1 = noninterfering_update {st=st} contra l1nua3 l2nua1 prf1\n ih2 = noninterfering_update {st=st} contra l1nua4 l2nua1 prf1\n in ( \\prf2 => rewrite fst ih1 Refl\n in rewrite fst ih2 Refl\n in prf2\n , \\prf2 => rewrite sym $ fst ih1 Refl\n in rewrite sym $ fst ih2 Refl\n in prf2 )\n\nswap_noninterfering_assignments : Not (l1 = l2) ->\n VarNotUsedInAExp l1 a2 ->\n VarNotUsedInAExp l2 a1 ->\n CEquiv (do l1 ::= a1; l2 ::= a2)\n (do l2 ::= a2; l1 ::= a1)\nswap_noninterfering_assignments {l1} {l2} {a1} {a2} contra l1nua2 l2nua1 st st' =\n (forward, backward)\nwhere forward : ((do l1 ::= a1; l2 ::= a2) / st \\\\ st') ->\n ((do l2 ::= a2; l1 ::= a1) / st \\\\ st')\n forward rel = case rel of\n E_Seq (E_Ass {n=n1} prf1) (E_Ass {n=n2} prf2) =>\n let pf1 = fst (noninterfering_update {st=st} contra l1nua2 l2nua1 prf1)\n prf2\n pf2 = snd (noninterfering_update {st=st}\n (neqSym contra) l2nua1 l1nua2 pf1)\n prf1\n in rewrite t_update_permute contra {v1=n2} {v2=n1} {m=st}\n in E_Seq (E_Ass pf1) (E_Ass pf2)\n backward : ((do l2 ::= a2; l1 ::= a1) / st \\\\ st') ->\n ((do l1 ::= a1; l2 ::= a2) / st \\\\ st')\n backward rel = case rel of\n E_Seq (E_Ass {n=n1} prf1) (E_Ass {n=n2} prf2) =>\n let pf1 = fst (noninterfering_update\n {st=st} (neqSym contra) l2nua1 l1nua2 prf1)\n prf2\n pf2 = snd (noninterfering_update {st=st} contra l1nua2 l2nua1 pf1)\n prf1\n in rewrite sym $ t_update_permute contra {v1=n1} {v2=n2} {m=st}\n in E_Seq (E_Ass pf1) (E_Ass pf2)\n\nCApprox : (c1, c2 : Com) -> Type\nCApprox c1 c2 = (st, st' : State) -> (c1 / st \\\\ st') -> (c2 / st \\\\ st')\n\nc1 : Com\nc1 = WHILE (not (X == 1)) $\n X ::= X - 1\n\nc2 : Com\nc2 = X ::= 1\n\nc3 : Com\nc3 = c2\n\nc4 : Com\nc4 = X ::= 2\n\nc3_c4_different : ( Not (CApprox EquivExercises.c3 EquivExercises.c4)\n , Not (CApprox EquivExercises.c4 EquivExercises.c3) )\nc3_c4_different = (forward, backward)\nwhere forward : Not ((st, st' : State) ->\n (EquivExercises.c3 / st \\\\ st') ->\n (EquivExercises.c4 / st \\\\ st'))\n forward f = case f empty_state (t_update X 1 empty_state) (E_Ass Refl) of\n E_Skip impossible\n (E_Ass _) impossible\n (E_Seq _ _) impossible\n (E_IfTrue _ _) impossible\n (E_IfFalse _ _) impossible\n (E_WhileEnd _) impossible\n (E_WhileLoop _ _ _) impossible\n backward : Not ((st, st' : State) ->\n (EquivExercises.c4 / st \\\\ st') ->\n (EquivExercises.c3 / st \\\\ st'))\n backward f = case f empty_state (t_update X 2 empty_state) (E_Ass Refl) of\n E_Skip impossible\n (E_Ass _) impossible\n (E_Seq _ _) impossible\n (E_IfTrue _ _) impossible\n (E_IfFalse _ _) impossible\n (E_WhileEnd _) impossible\n (E_WhileLoop _ _ _) impossible\n\ncmin : Com\ncmin = WHILE BTrue SKIP\n\ncmin_minimal : (c : Com) -> CApprox EquivExercises.cmin c\ncmin_minimal _ _ _ rel = absurd $ while_true_nonterm btrue_is_true rel\n", "meta": {"hexsha": "5435423ef6e0c393e935ee9a5dfc7226897b4eac", "size": 4937, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "EquivExercises.idr", "max_stars_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_stars_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "EquivExercises.idr", "max_issues_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_issues_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "EquivExercises.idr", "max_forks_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_forks_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 38.5703125, "max_line_length": 81, "alphanum_fraction": 0.5507393154, "num_tokens": 1641, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.603931819468636, "lm_q2_score": 0.600188359260205, "lm_q1q2_score": 0.36247284783191097}} {"text": "data MyShow : Type -> Type where\n ShowImplementation : (show : a -> String) -> MyShow a\n\nmyshow : {auto inst : MyShow a} -> a -> String\nmyshow {inst = ShowImplementation show} x1 = show x1\n\n%hint\nshowNat : MyShow Nat\nshowNat = ShowImplementation show\n\n%hint\nshowFn : MyShow (a -> b)\nshowFn = ShowImplementation (\\x => \"<< function >>\")\n\n%hint\nshowBools : MyShow (Bool, Bool)\nshowBools = ShowImplementation (\\x => \"some bools\")\n\n%hint\nshowStuff : MyShow a -> MyShow b -> MyShow (a, b)\nshowStuff sa sb = ShowImplementation showPair\n where\n showPair : (a, b) -> String\n showPair (x, y) = myshow x ++ \", \" ++ myshow y\n\ntestShow : List (Bool, Bool) -> String\ntestShow [] = \"\" \ntestShow (x :: xs) = myshow x ++ \"\\n\" ++ testShow xs\n\ntestShow2 : List (Nat, Int -> Int) -> String\ntestShow2 [] = \"\" \ntestShow2 (x :: xs) = myshow x ++ \"\\n\" ++ testShow2 xs\n\nmain : IO ()\nmain = do putStrLn $ testShow2 [(2, (+1)), (3, abs)]\n putStrLn $ testShow [(True, False), (False, True)]\n\n", "meta": {"hexsha": "76a900ff8e2ae9fb552079c85d053c721202479d", "size": 985, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "test/idris-dev/proof010/proof010.idr", "max_stars_repo_name": "grin-compiler/idris-grin", "max_stars_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 36, "max_stars_repo_stars_event_min_datetime": "2019-06-06T10:35:31.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-21T08:48:30.000Z", "max_issues_repo_path": "test/idris-dev/proof010/proof010.idr", "max_issues_repo_name": "grin-compiler/idris-grin", "max_issues_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 4, "max_issues_repo_issues_event_min_datetime": "2019-11-21T20:45:22.000Z", "max_issues_repo_issues_event_max_datetime": "2022-02-02T12:29:23.000Z", "max_forks_repo_path": "test/idris-dev/proof010/proof010.idr", "max_forks_repo_name": "grin-compiler/idris-grin", "max_forks_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-06-14T13:14:47.000Z", "max_forks_repo_forks_event_max_datetime": "2019-12-07T06:20:45.000Z", "avg_line_length": 25.9210526316, "max_line_length": 60, "alphanum_fraction": 0.6192893401, "num_tokens": 313, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6723317123102955, "lm_q2_score": 0.5389832206876841, "lm_q1q2_score": 0.3623755116714686}} {"text": "-- ------------------------------------------------------- [ StateMachines.idr ]\n-- Module : Chapter.StateMachines\n-- Description : Definitions from Chapter 13 of Edwin Brady's book,\n-- \"Type-Driven Development with Idris.\"\n-- --------------------------------------------------------------------- [ EOH ]\nmodule Chapter.StateMachines\n\nimport public Control.Monad.State\n\n-- NOTE: See 13.2.1\nimport Data.Vect\n\n-- ------------------------------------------------- [ 13.1.1 Modelling a Door ]\n\nnamespace BadDoor\n\n public export\n data DoorCmd : Type -> Type where\n Open : DoorCmd ()\n Close : DoorCmd ()\n RingBell : DoorCmd ()\n\n Pure : ty -> DoorCmd ty\n (>>=) : DoorCmd a -> (a -> DoorCmd b) -> DoorCmd b\n\n export\n doorProg : DoorCmd ()\n doorProg = do RingBell\n Open\n Close\n\n doorProgBad : DoorCmd ()\n doorProgBad = do Open\n Open\n RingBell\n\nnamespace Door\n\n ||| A door is either open or closed.\n public export\n data DoorState = ||| The door is closed.\n DoorClosed\n | ||| The door is open.\n DoorOpen\n\n ||| A sequence of door actions which produces a value of type `ty`, begins with\n ||| the door in the state `beforeState`, and ends with the door in the state\n ||| `afterState`.\n ||| @ ty The type of the produced value.\n ||| @ beforeState The initial door state.\n ||| @ afterState The resulting door state.\n public export\n data DoorCmd : (ty : Type) ->\n (beforeState, afterState : DoorState) ->\n Type where\n\n ||| Open a closed door.\n Open : DoorCmd () DoorClosed DoorOpen\n\n ||| Close an open door.\n Close : DoorCmd () DoorOpen DoorClosed\n\n ||| Ring the bell of a closed door.\n RingBell : DoorCmd () state state -- NOTE: Exercise 13.1.5.1\n\n ||| Lift a value.\n Pure : ty -> DoorCmd ty state state\n\n ||| Sequentially compose two door actions, passing any value produced by\n ||| the first as an argument to the second.\n (>>=) : DoorCmd a state1 state2 ->\n (a -> DoorCmd b state2 state3) ->\n DoorCmd b state1 state3\n\n ||| Starting with a closed door, ring the bell, open the door, ring the bell,\n ||| and close the door, resulting in a closed door and producing ().\n export\n doorProg : DoorCmd () DoorClosed DoorClosed\n doorProg = do RingBell\n Open\n RingBell\n Close\n\n-- -------------------------------------- [ 13.1.3 Modelling a Vending Machine ]\n\nnamespace VendingMachine\n\n export\n VendState : Type\n VendState = (Nat, Nat)\n\n public export\n data Input = COIN\n | VEND\n | CHANGE\n | REFILL Nat\n\n public export\n data MachineCmd : (ty : Type) ->\n (beforeState, afterState : VendState) ->\n Type where\n\n InsertCoin : MachineCmd () ( pounds, chocs) (S pounds, chocs)\n\n Vend : MachineCmd () (S pounds, S chocs) ( pounds, chocs)\n\n GetCoins : MachineCmd () ( pounds, chocs) ( Z, chocs)\n\n Refill : (bars : Nat) -> MachineCmd () (Z, chocs) (Z, bars + chocs)\n\n Display : String -> MachineCmd () state state\n\n GetInput : MachineCmd (Maybe Input) state state\n\n ||| Lift a value.\n Pure : ty -> MachineCmd ty state state\n\n (>>=) : MachineCmd a state1 state2 ->\n (a -> MachineCmd b state2 state3) ->\n MachineCmd b state1 state3\n\n public export\n data MachineIO : VendState -> Type where\n Do : MachineCmd a state1 state2 ->\n (a -> Inf (MachineIO state2)) -> MachineIO state1\n\nnamespace MachineDo\n\n public export\n (>>=) : MachineCmd a state1 state2 ->\n (a -> Inf (MachineIO state2)) -> MachineIO state1\n (>>=) = Do\n\n-- --------------------------------------- [ 13.1.4 A Verified Vending Machine ]\n\nmutual\n\n vend : MachineIO (pounds, chocs)\n vend {pounds = S _} {chocs = S _} = do Vend\n Display \"Enjoy!\"\n machineLoop\n vend {pounds = Z} = do Display \"Insert a coin\"\n machineLoop\n vend {chocs = Z} = do Display \"Out of stock\"\n machineLoop\n\n refill : (num : Nat) -> MachineIO (pounds, chocs)\n refill {pounds = Z} num = do Refill num\n machineLoop\n refill _ = do Display \"Can't refill: Coins in machine\"\n machineLoop\n\n machineLoop : MachineIO (pounds, chocs)\n machineLoop = do Just x <- GetInput\n | Nothing => do Display \"Invalid input\"\n machineLoop\n case x of\n COIN => do InsertCoin\n machineLoop\n VEND => vend\n CHANGE => do GetCoins\n Display \"Change returned\"\n machineLoop\n REFILL num => refill num\n\n-- ------------------------------------------------- [ 13.2.1 Stack Operations ]\n\nnamespace StackOperations\n\n public export\n data StackCmd : (ty : Type) ->\n (a : Type) ->\n (inHeight, outHeight : Nat) ->\n Type where\n\n Push : a -> StackCmd () a height (S height)\n\n Pop : StackCmd a a (S height) height\n\n Top : StackCmd a a (S height) (S height)\n\n GetStr : StackCmd String a height height\n\n PutStr : String -> StackCmd () a height height\n\n Pure : ty -> StackCmd ty a height height\n (>>=) : StackCmd a elem height1 height2 ->\n (a -> StackCmd b elem height2 height3) ->\n StackCmd b elem height1 height3\n\n-- export\ntestAdd : StackCmd Integer Integer 0 0\ntestAdd = do Push 10\n Push 20\n val1 <- Pop\n val2 <- Pop\n Pure (val1 + val2)\n\n-- NOTE: This will not type check.\n-- testAdd : StackCmd Integer 0 0\n-- testAdd = do Push 10\n-- val1 <- Pop\n-- val2 <- Pop\n-- Pure (val1 + val2)\n\n-- ------------------------------------------- [ 13.2.2 Implementing the Stack ]\n\nrunStack : (stk : Vect inHeight a) ->\n StackCmd ty a inHeight outHeight ->\n IO (ty, Vect outHeight a)\nrunStack stk (Push val) = pure ((), val :: stk)\nrunStack (val :: stk) Pop = pure (val, stk)\nrunStack (val :: stk) Top = pure (val, val :: stk)\nrunStack stk GetStr = do x <- getLine\n pure (x, stk)\nrunStack stk (PutStr x) = putStr x *> pure ((), stk)\nrunStack stk (Pure x) = pure (x, stk)\nrunStack stk (x >>= f) = do (x', newStk) <- runStack stk x\n runStack newStk (f x')\n\nprintResult : StackCmd () Integer (S height) (S height)\nprintResult = do result <- Top\n PutStr (show result ++ \"\\n\")\n\ndoBinOp : (op : Integer -> Integer -> Integer) ->\n StackCmd () Integer (S (S height)) (S height)\ndoBinOp op = do val1 <- Pop\n val2 <- Pop\n -- NOTE: The arguments are ordered this way because subtraction\n -- is not commutative, while addition and multiplication are,\n -- e.g. given 2 1 - , stackCalc should print 1,\n -- i.e. 2 - 1 = 1, as opposed to 1 - 2 = -1.\n Push (val2 `op` val1)\n printResult\n\npublic export\ndata StackIO : Nat -> Type -> Type where\n Do : StackCmd ty a inHeight outHeight ->\n (ty -> Inf (StackIO outHeight a)) ->\n StackIO inHeight a\n\nnamespace StackDo\n\n (>>=) : StackCmd ty a inHeight outHeight ->\n (ty -> Inf (StackIO outHeight a)) ->\n StackIO inHeight a\n (>>=) = Do\n\npublic export\ndata Fuel = Dry | More (Lazy Fuel)\n\npartial\nforever : Fuel\nforever = More forever\n\nexport\nrun : Fuel -> Vect height a -> StackIO height a -> IO ()\nrun (More fuel) stk (Do c f) = do (res, newStk) <- runStack stk c\n run fuel newStk (f res)\nrun Dry _ _ = pure ()\n\npublic export\ndata StkInput = Number Integer\n | Add\n -- NOTE: Exercise 13.2.4.1\n | Subtract\n | Multiply\n -- NOTE: Exercise 13.2.4.2\n | Negate\n -- NOTE: Exercise 13.2.4.3\n | Discard\n -- NOTE: Exercise 13.2.4.4\n | Duplicate\n\nexport\nstrToInput : String -> Maybe StkInput\nstrToInput \"\" = Nothing\nstrToInput \"add\" = Just Add\nstrToInput \"subtract\" = Just Subtract\nstrToInput \"multiply\" = Just Multiply\nstrToInput \"negate\" = Just Negate\nstrToInput \"discard\" = Just Discard\nstrToInput \"duplicate\" = Just Duplicate\nstrToInput x = if all isDigit (unpack x)\n then Just (Number (cast x))\n else Nothing\n\nmutual\n\n tryBinOp : (op : Integer -> Integer -> Integer) -> StackIO height Integer\n tryBinOp {height = S (S _)} op =\n do doBinOp op\n stackCalc\n tryBinOp _ =\n do PutStr \"Fewer than two items on the stack\\n\"\n stackCalc\n\n tryAdd : StackIO height Integer\n tryAdd = tryBinOp (+)\n\n-- ------------------------------------------------------- [ Exercise 13.2.4.1 ]\n\n trySubtract : StackIO height Integer\n trySubtract = tryBinOp (-)\n\n tryMultiply : StackIO height Integer\n tryMultiply = tryBinOp (*)\n\n-- -------------------------------------------------- [ Unary operation helper ]\n\n emptyStack : StackIO height Integer\n emptyStack = do PutStr \"Stack is empty\\n\"\n stackCalc\n\n-- ------------------------------------------------------- [ Exercise 13.4.2.2 ]\n\n tryNegate : StackIO height Integer\n tryNegate {height = S _} = do Push (negate !Pop)\n printResult\n stackCalc\n tryNegate = emptyStack\n\n-- ------------------------------------------------------- [ Exercise 13.4.2.3 ]\n\n tryDiscard : StackIO height Integer\n tryDiscard {height = S _} = do PutStr $ \"Discarded \" ++ show !Pop ++ \"\\n\"\n stackCalc\n tryDiscard = emptyStack\n\n-- ------------------------------------------------------- [ Exercise 13.4.2.4 ]\n\n tryDuplicate : StackIO height Integer\n tryDuplicate {height = S _} = do val <- Top\n Push val\n PutStr $ \"Duplicated \" ++ show val ++ \"\\n\"\n stackCalc\n tryDuplicate = emptyStack\n\n-- -----------------------------------------------------------------------------\n\n export\n stackCalc : StackIO height Integer\n stackCalc = do PutStr \"> \"\n input <- GetStr\n case strToInput input of\n Nothing => do PutStr \"Invalid input\\n\"\n stackCalc\n Just (Number x) => do Push x\n stackCalc\n Just Add => tryAdd\n -- NOTE: Exercise 13.2.4.1\n Just Subtract => trySubtract\n Just Multiply => tryMultiply\n -- NOTE: Exercise 13.2.4.2\n Just Negate => tryNegate\n -- NOTE: Exercise 13.2.4.3\n Just Discard => tryDiscard\n -- NOTE: Exercise 13.2.4.4\n Just Duplicate => tryDuplicate\n\nnamespace StackCalculator\n\n export\n partial\n main : IO ()\n main = run forever [] stackCalc\n\n-- --------------------------------------------------------------------- [ EOF ]\n", "meta": {"hexsha": "be065c3cf8c8c2ce9051e77fd4529f8e110362f1", "size": 11898, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Chapter/StateMachines.idr", "max_stars_repo_name": "yurrriq/tdd-with-idris", "max_stars_repo_head_hexsha": "873c6c719706d06179527c5d93982bb7c184da90", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2019-04-15T01:29:36.000Z", "max_stars_repo_stars_event_max_datetime": "2019-04-15T01:29:36.000Z", "max_issues_repo_path": "src/Chapter/StateMachines.idr", "max_issues_repo_name": "yurrriq/tdd-with-idris", "max_issues_repo_head_hexsha": "873c6c719706d06179527c5d93982bb7c184da90", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 3, "max_issues_repo_issues_event_min_datetime": "2016-11-21T23:42:45.000Z", "max_issues_repo_issues_event_max_datetime": "2016-12-01T05:43:10.000Z", "max_forks_repo_path": "src/Chapter/StateMachines.idr", "max_forks_repo_name": "yurrriq/tdd-with-idris", "max_forks_repo_head_hexsha": "873c6c719706d06179527c5d93982bb7c184da90", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 32.243902439, "max_line_length": 81, "alphanum_fraction": 0.4843671205, "num_tokens": 2802, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6224593312018545, "lm_q2_score": 0.5813030906443133, "lm_q1q2_score": 0.36183753302803023}} {"text": "-- exercises in \"Type-Driven Development with Idris\"\n-- chapter 14, section 2, VendingMachine part\n\nimport System\nimport Data.Primitives.Views\n\n-- check that all functions are total\n%default total\n\nVendState : Type\nVendState = (Nat, Nat)\n\ndata Input = COIN\n | VEND\n | CHANGE\n | REFILL Nat\n\nstrToInput : String -> Maybe Input\nstrToInput \"insert\" = Just COIN\nstrToInput \"vend\" = Just VEND\nstrToInput \"change\" = Just CHANGE\nstrToInput x = if all isDigit (unpack x)\n then Just (REFILL (cast x))\n else Nothing\n\ndata CoinResult = Inserted | Rejected\n\ndata MachineCmd : (ty : Type) ->\n VendState ->\n (ty -> VendState) ->\n Type where\n InsertCoin : MachineCmd CoinResult (pounds, chocs)\n (\\res => case res of\n Inserted => (S pounds, chocs)\n Rejected => (pounds, chocs))\n Vend : MachineCmd () (S pounds, S chocs) $ const (pounds, chocs)\n GetCoins : MachineCmd () (pounds, chocs) $ const (Z, chocs)\n Refill : (bars : Nat) ->\n MachineCmd () (Z, chocs) $ const (Z, bars + chocs)\n Display : String ->\n MachineCmd () s $ const s\n GetInput : MachineCmd (Maybe Input) s $ const s\n Pure : (res : ty) -> MachineCmd ty (s res) s\n (>>=) : MachineCmd a s1 s2 ->\n ((res : a) -> MachineCmd b (s2 res) s3) ->\n MachineCmd b s1 s3\n\ndata MachineIO : VendState -> Type where\n Do : MachineCmd a s1 s2 ->\n ((res : a) -> Inf (MachineIO (s2 res))) -> MachineIO s1\n\nnamespace MachineDo\n (>>=) : MachineCmd a s1 s2 ->\n ((res : a) -> Inf (MachineIO (s2 res))) -> MachineIO s1\n (>>=) = Do\n\ngetRandom : Int -> Int -> Int\ngetRandom val max with (divides val max)\n getRandom val 0 | DivByZero = 0\n getRandom ((max * div) + rem) max | (DivBy prf) = abs rem\n\n||| \"randomly generates\" a valid or invalid coin\nrandomCoin : IO CoinResult\nrandomCoin = do seed <- time\n case (getRandom (fromInteger seed) 4) of\n 0 => pure Rejected\n _ => pure Inserted\n\nrunMachine : MachineCmd ty inState outState -> IO ty\nrunMachine InsertCoin = do Inserted <- randomCoin\n | Rejected => do putStrLn \"bad coin\"\n pure Rejected\n putStrLn \"good coin\"\n pure Inserted\nrunMachine Vend = putStrLn \"Please take your chocolate\"\nrunMachine {inState = (pounds, _)} GetCoins = putStrLn $ (show pounds) ++ \" coins returned\"\nrunMachine (Refill bars) = putStrLn $ \"Chocolate remaining: \" ++ (show bars)\nrunMachine (Display x) = putStrLn x\nrunMachine {inState = (pounds, bars)} GetInput\n = do putStrLn $ \"Coins: \" ++ (show pounds) ++ \"; \" ++\n \"Stock: \" ++ (show bars)\n putStr \"> \"\n x <- getLine\n pure (strToInput x)\nrunMachine (Pure x) = pure x\nrunMachine (x >>= f) = do x' <- runMachine x\n runMachine (f x')\n\ndata Fuel = Dry | More (Lazy Fuel)\n\npartial\nforever : Fuel\nforever = More forever\n\nrun : Fuel -> MachineIO state -> IO ()\nrun (More fuel) (Do c f)\n = do res <- runMachine c\n run fuel (f res)\nrun Dry p = pure ()\n\nmutual\n vend : MachineIO (pounds, chocs)\n vend {pounds = Z} = do Display \"Insert a coin\"\n machineLoop\n vend {chocs = Z} = do Display \"Out of stock\"\n machineLoop\n vend {pounds = (S k)} {chocs = (S j)} = do Vend\n Display \"Enjoy!\"\n machineLoop\n\n refill : (num : Nat) -> MachineIO (pounds, chocs)\n refill {pounds = Z} num = do Refill num\n machineLoop\n refill {pounds = (S k)} num = do Display \"Cannot refill: Coins in machine\"\n machineLoop\n\n machineLoop : MachineIO (pounds, chocs)\n machineLoop =\n do Just x <- GetInput\n | Nothing => do Display \"Invalid input\"\n machineLoop\n case x of\n COIN => do Inserted <- InsertCoin | Rejected => do Display \"Coin rejected\"\n machineLoop\n Display \"Coin inserted\"\n machineLoop\n VEND => vend\n CHANGE => do GetCoins\n Display \"Change returned\"\n machineLoop\n REFILL num => refill num\n\npartial\nmain : IO ()\nmain = run forever (machineLoop { pounds = 0 } { chocs = 1} )\n", "meta": {"hexsha": "5671fe30d1858e142c29b3ad1b9468cb3084dedc", "size": 4729, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "chapter14/VendingMachine.idr", "max_stars_repo_name": "pascalpoizat/idris-book", "max_stars_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": 4, "max_stars_repo_stars_event_min_datetime": "2018-08-16T00:58:46.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-15T01:07:37.000Z", "max_issues_repo_path": "chapter14/VendingMachine.idr", "max_issues_repo_name": "pascalpoizat/idris-book", "max_issues_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "chapter14/VendingMachine.idr", "max_forks_repo_name": "pascalpoizat/idris-book", "max_forks_repo_head_hexsha": "f1ef0ed0a8b8c1690d7ce65258f04322b37ff956", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-01-23T03:15:39.000Z", "max_forks_repo_forks_event_max_datetime": "2022-01-23T03:15:39.000Z", "avg_line_length": 34.7720588235, "max_line_length": 91, "alphanum_fraction": 0.5176570099, "num_tokens": 1181, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6477982179521103, "lm_q2_score": 0.5583269943353744, "lm_q1q2_score": 0.3616832319650135}} {"text": "data DoorState = DoorOpen | DoorClosed\n\ndata DoorCmd : Type ->\n DoorState -> DoorState ->\n Type where\n Open : DoorCmd () DoorClosed DoorOpen\n Close : DoorCmd () DoorOpen DoorClosed\n RingBell : DoorCmd () DoorClosed DoorClosed\n\n Pure : ty -> DoorCmd ty state state\n (>>=) : DoorCmd a state1 state2 ->\n (a -> DoorCmd b state2 state3) ->\n DoorCmd b state1 state3\n\ndoorProg : DoorCmd () DoorClosed DoorClosed\ndoorProg = do RingBell\n Open\n Close\n", "meta": {"hexsha": "507acb1fc4433fb88be527e80f5f4802a6cdb2f3", "size": 527, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "idris2/tests/typedd-book/chapter13/Door.idr", "max_stars_repo_name": "Qqwy/Idris2-Erlang", "max_stars_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "idris2/tests/typedd-book/chapter13/Door.idr", "max_issues_repo_name": "Qqwy/Idris2-Erlang", "max_issues_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "idris2/tests/typedd-book/chapter13/Door.idr", "max_forks_repo_name": "Qqwy/Idris2-Erlang", "max_forks_repo_head_hexsha": "945f9c12d315d73bfda2d441bc5f9f20696b5066", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 27.7368421053, "max_line_length": 45, "alphanum_fraction": 0.5977229602, "num_tokens": 135, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6261241772283034, "lm_q2_score": 0.5774953651858118, "lm_q1q2_score": 0.361583810380125}} {"text": "||| Monad morphisms and interaction with monad transformer stacks.\nmodule Data.MSF.Trans\n\nimport Control.Monad.Identity\nimport Control.Monad.Reader\nimport Control.Monad.State\nimport Control.Monad.Writer\nimport Data.MSF.Core\nimport Data.MSF.Util\nimport Data.MSF.Running\nimport Data.SOP\n\n--------------------------------------------------------------------------------\n-- General Morphisms\n--------------------------------------------------------------------------------\n\n||| The most general structure-preserving monad morphism.\n||| This can be used to change the input and output type plus\n||| the effect type of an MSF without affecting its internal\n||| structure (wiring of stream functions).\n|||\n||| For examples of usage, have a look at the implementations of\n||| functions like `unreader`, `reader`, `unstate`, and similar.\nexport\nmorphGS : Monad m1\n => (forall c . (i1 -> m1(o1,c)) -> i2 -> m2(o2,c))\n -> MSF m1 i1 o1\n -> MSF m2 i2 o2\nmorphGS f sf = feedback sf (arrM run >>^ \\(o2,sf2) => [sf2,o2])\n where run : NP I [MSF m1 i1 o1,i2] -> m2 (o2, MSF m1 i1 o1)\n run [sf1,vi2] = f (step sf1) vi2\n\n||| Applies a monad morphism to change the context of an MSF.\n|||\n||| ```idris example\n||| fromPure : Monad m => MSF Identity i o -> MSF m i o\n||| fromPure = morph (pure . runIdentity)\n||| ```\nexport\nmorph : Monad m1 => (forall c . m1 c -> m2 c) -> MSF m1 i1 o1 -> MSF m2 i1 o1\nmorph f = morphGS (f .)\n\n--------------------------------------------------------------------------------\n-- Identity\n--------------------------------------------------------------------------------\n\n||| Puts a pure MSF (over the `Identity` monad) in another\n||| monadic context.\nexport\nfromPure : Monad m => MSF Identity i o -> MSF m i o\nfromPure = morph (pure . runIdentity)\n\n--------------------------------------------------------------------------------\n-- State\n--------------------------------------------------------------------------------\n\n||| Alias for `constM get`\nexport\nget : MonadState s m => MSF m i s\nget = constM get\n\n||| Alias for `constM put`\nexport\nput : MonadState s m => MSF m s ()\nput = arrM put\n\n||| Alias for `constM modify`\nexport\nmodify : MonadState s m => MSF m (s -> s) ()\nmodify = arrM modify\n\n||| Converts an outer `StateT` wrapper to an MSF converting\n||| an additional argument of the state type.\nexport\nfromState : Monad m => MSF (StateT s m) i o -> MSF m (NP I [s,i]) (NP I [s,o])\nfromState =\n morphGS (\\f,[vs,vi] => (\\(vs2,vo,vc) => ([vs2,vo],vc)) <$> runStateT vs (f vi))\n\n||| Runs the given stateful MSF as a feedback loop with `ini` as the\n||| initial input.\n|||\n||| This is a shorthand for `feedback ini . fromState`.\nexport\nloopState : Monad m => (ini : s) -> MSF (StateT s m) i o -> MSF m i o\nloopState ini = feedback ini . fromState\n\n||| Like `fromState` but drops the uninteresting unit in- and output.\nexport\nfromState_ : Monad m => MSF (StateT s m) () () -> MSF m s s\nfromState_ = morphGS (\\f,vs => (\\(vs2,_,vc) => (vs2,vc)) <$> runStateT vs (f ()))\n\n||| Converts a state transforming MSF to one with its monadic context\n||| wrapped in `StateT s`.\nexport\ntoState : Monad m => MSF m (NP I [s,i]) (NP I [s,o]) -> MSF (StateT s m) i o\ntoState =\n morphGS (\\f,vi => ST $ \\vs => (\\([vs2,vo],vc) => (vs2,vo,vc)) <$> f [vs,vi])\n\n||| Like `toState` but for MSFs without additional in- or output\nexport\ntoState_ : Monad m => MSF m s s -> MSF (StateT s m) () ()\ntoState_ = morphGS (\\f,_ => ST $ \\vs => (\\(vs2,vc) => (vs2,(),vc)) <$> f vs)\n\n--------------------------------------------------------------------------------\n-- Reader\n--------------------------------------------------------------------------------\n\n||| Alias for `constM ask`\nexport\nask : MonadReader e m => MSF m i e\nask = constM ask\n\n||| Converts an outer `ReaderT` wrapper to an MSF taking an\n||| an additional input.\nexport\nfromReader : Monad m => MSF (ReaderT e m) i o -> MSF m (NP I [e,i]) o\nfromReader = morphGS (\\f,[ve,vi] => runReaderT ve (f vi))\n\n||| Converts the given MSF to use `env` as its environment.\n|||\n||| This is an alias for `fan [ const env, id ] >>> fromReader sf`.\nexport\nwithEnv : Monad m => (env : e) -> (sf : MSF (ReaderT e m) i o) -> MSF m i o\nwithEnv env sf = fan [ const env, id ] >>> fromReader sf\n\n||| Like `unReader` but drops the uninteresting unit input.\nexport\nfromReader_ : Monad m => MSF (ReaderT e m) () o -> MSF m e o\nfromReader_ = morphGS (\\f,ve => runReaderT ve (f ()))\n\n||| Converts an MSF taking an additional input\n||| to one with its monadic context wrapped in `ReaderT e`.\nexport\ntoReader : Monad m => MSF m (NP I [e,i]) o -> MSF (ReaderT e m) i o\ntoReader = morphGS (\\f,vi => MkReaderT $ \\ve => f [ve,vi])\n\n||| Like `toReader` but for MSFs without additional input\nexport\ntoReader_ : Monad m => MSF m e o -> MSF (ReaderT e m) () o\ntoReader_ = morphGS (\\f,_ => MkReaderT f)\n\n--------------------------------------------------------------------------------\n-- Writer\n--------------------------------------------------------------------------------\n\n\n||| Alias for `arrM tell`\nexport\ntell : MonadWriter w m => MSF m w ()\ntell = arrM tell\n\n||| Converts an outer `WriterT` wrapper to an MSF producing\n||| an additional output.\nexport\nfromWriter : Monoid w => Monad m => MSF (WriterT w m) i o -> MSF m i (NP I [w,o])\nfromWriter =\n morphGS (\\f,vi => (\\((vo,vc),vw) => ([vw,vo],vc)) <$> runWriterT (f vi))\n\n||| Like `fromWriter` but ignores the uninteresting output.\nexport\nfromWriter_ : Monoid w => Monad m => MSF (WriterT w m) i () -> MSF m i w\nfromWriter_ =\n morphGS (\\f,vi => (\\((_,vc),vw) => (vw,vc)) <$> runWriterT (f vi))\n\n||| Converts an MSF producing an additional output\n||| to one with its monadic context wrapped in `WriterT w`.\nexport\ntoWriter : Monoid w => Monad m => MSF m i (NP I [w,o]) -> MSF (WriterT w m) i o\ntoWriter =\n morphGS (\\f,vi =>\n MkWriterT $ \\vw => (\\([vw2,vo],vc) => ((vo,vc),vw <+> vw2)) <$> f vi)\n\n||| Like `toWriter` but produces unit as output.\nexport\ntoWriter_ : Monoid w => Monad m => MSF m i w -> MSF (WriterT w m) i ()\ntoWriter_ =\n morphGS (\\f,vi =>\n MkWriterT $ \\vw => (\\(vw2,vc) => (((),vc),vw <+> vw2)) <$> f vi)\n", "meta": {"hexsha": "7d662276c44159307f1118de9a104d620ff87a8b", "size": 6160, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Data/MSF/Trans.idr", "max_stars_repo_name": "stefan-hoeck/idris2-rhone", "max_stars_repo_head_hexsha": "be8f65a096cfb17f62282df45b1a3f6617138438", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 5, "max_stars_repo_stars_event_min_datetime": "2021-07-25T08:43:28.000Z", "max_stars_repo_stars_event_max_datetime": "2021-12-11T23:21:44.000Z", "max_issues_repo_path": "src/Data/MSF/Trans.idr", "max_issues_repo_name": "stefan-hoeck/idris2-rhone", "max_issues_repo_head_hexsha": "be8f65a096cfb17f62282df45b1a3f6617138438", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Data/MSF/Trans.idr", "max_forks_repo_name": "stefan-hoeck/idris2-rhone", "max_forks_repo_head_hexsha": "be8f65a096cfb17f62282df45b1a3f6617138438", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 34.4134078212, "max_line_length": 81, "alphanum_fraction": 0.5446428571, "num_tokens": 1810, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6297746074044135, "lm_q2_score": 0.5736784074525098, "lm_q1q2_score": 0.3612880938297935}} {"text": "module BiNat.Properties.Minus\n\nimport BiNat\nimport BiNat.Properties.Plus\nimport BiNat.Properties.Induction\nimport BiNat.Properties.LT\nimport BiNat.Properties.Mult\n\n%access public export\n%default total\n\nminusLast00 : (ms, ns : BiNat) -> (tail : List Bit) ->\n minus' (ms -: O) (ns -: O) tail = minus' ms ns (O :: tail)\nminusLast00 J J tail = Refl\nminusLast00 J (ns -: O) tail = Refl\nminusLast00 J (ns -: I) tail = Refl\nminusLast00 (ms -: O) J tail = Refl\nminusLast00 (ms -: I) J tail = Refl\nminusLast00 (ms -: O) (ns -: O) tail = Refl\nminusLast00 (ms -: O) (ns -: I) tail = Refl\nminusLast00 (ms -: I) (ns -: O) tail = Refl\nminusLast00 (ms -: I) (ns -: I) tail = Refl\n\nminusLast10 : (ms, ns : BiNat) -> (tail : List Bit) ->\n minus' (ms -: I) (ns -: O) tail = minus' ms ns (I :: tail)\nminusLast10 J J tail = Refl\nminusLast10 J (ns -: O) tail = Refl\nminusLast10 J (ns -: I) tail = Refl\nminusLast10 (ms -: O) J tail = Refl\nminusLast10 (ms -: I) J tail = Refl\nminusLast10 (ms -: O) (ns -: O) tail = Refl\nminusLast10 (ms -: O) (ns -: I) tail = Refl\nminusLast10 (ms -: I) (ns -: O) tail = Refl\nminusLast10 (ms -: I) (ns -: I) tail = Refl\n\nminusLast11 : (ms, ns : BiNat) -> (tail : List Bit) ->\n minus' (ms -: I) (ns -: I) tail = minus' ms ns (O :: tail)\nminusLast11 J J tail = Refl\nminusLast11 J (ns -: O) tail = Refl\nminusLast11 J (ns -: I) tail = Refl\nminusLast11 (ms -: O) J tail = Refl\nminusLast11 (ms -: I) J tail = Refl\nminusLast11 (ms -: O) (ns -: O) tail = Refl\nminusLast11 (ms -: O) (ns -: I) tail = Refl\nminusLast11 (ms -: I) (ns -: O) tail = Refl\nminusLast11 (ms -: I) (ns -: I) tail = Refl\n\nminusLast01 : (ms, ns : BiNat) -> (tail : List Bit) -> Not (ms = J) ->\n minus' (ms -: O) (ns -: I) tail = minus' (pred ms) ns (I :: tail)\nminusLast01 J ns tail notJ = absurd (notJ Refl)\nminusLast01 (ms -: O) J tail _ = Refl\nminusLast01 (ms -: I) J tail _ = Refl\nminusLast01 (ms -: O) (ns -: O) tail _ = Refl\nminusLast01 (ms -: O) (ns -: I) tail _ = Refl\nminusLast01 (ms -: I) (ns -: O) tail _ = Refl\nminusLast01 (ms -: I) (ns -: I) tail _ = Refl\n\nminusLast0J : (ms : BiNat) -> (tail : List Bit) -> Not (ms = J) ->\n minus' (ms -: O) J tail = foldl (-:) (pred ms -: I) tail\nminusLast0J J tail notJ = absurd (notJ Refl)\nminusLast0J (ms -: O) tail _ = Refl\nminusLast0J (ms -: I) tail _ = Refl\n\nminusLast1J : (ms : BiNat) -> (tail : List Bit) -> Not (ms = J) ->\n minus' (ms -: I) J tail = foldl (-:) (ms -: O) tail\nminusLast1J J tail notJ = absurd (notJ Refl)\nminusLast1J (ms -: O) tail _ = Refl\nminusLast1J (ms -: I) tail _ = Refl\n\njMinusIsJ : (n : BiNat) -> minus J n = J\njMinusIsJ J = Refl\njMinusIsJ (ns -: n) = Refl\n\nminusJIsPred : (n : BiNat) -> minus n J = pred n\nminusJIsPred J = Refl\nminusJIsPred (J -: O) = Refl\nminusJIsPred (ns -: n -: O) = rewrite predDashAppendsAcc (ns -: n) [I] in Refl\nminusJIsPred (J -: I) = Refl\nminusJIsPred (ns -: n -: I) = Refl\n\nminusOfItSelf : (n : BiNat) -> (tail : List Bit) -> minus' n n tail = tailToBiNat tail\nminusOfItSelf J tail = Refl\nminusOfItSelf (J -: O) tail = Refl\nminusOfItSelf (ns -: O -: O) tail = rewrite minusOfItSelf (ns -: O) (O :: tail) in Refl\nminusOfItSelf (ns -: I -: O) tail = rewrite minusOfItSelf (ns -: I) (O :: tail) in Refl\nminusOfItSelf (J -: I) tail = Refl\nminusOfItSelf (ns -: O -: I) tail = rewrite minusOfItSelf (ns -: O) (O :: tail) in Refl\nminusOfItSelf (ns -: I -: I) tail = rewrite minusOfItSelf (ns -: I) (O :: tail) in Refl\n\nminusDashAppendsTail : (m, n : BiNat) -> GT m n -> (tail : List Bit) ->\n minus' m n tail = foldl (-:) (minus' m n []) tail\nminusDashAppendsTail J n lt tail impossible\nminusDashAppendsTail (J -: O) J lt tail = Refl\nminusDashAppendsTail (ms -: m -: O) J lt tail = Refl\nminusDashAppendsTail (J -: I) J lt tail = Refl\nminusDashAppendsTail (ms -: m -: I) J lt tail = Refl\nminusDashAppendsTail (ms -: O) (ns -: O) (LTAppend ns ms lt O O) tail =\n rewrite minusLast00 ms ns tail in\n rewrite minusLast00 ms ns [] in\n rewrite minusDashAppendsTail ms ns lt (O :: tail) in\n rewrite minusDashAppendsTail ms ns lt [O] in Refl\nminusDashAppendsTail (J -: O) (ns -: I) (LTAppend ns J lt I O) tail impossible\nminusDashAppendsTail (ms -: m -: O) (J -: I) (LTAppend J (ms -: m) lt I O) tail =\n case lessThanImpliesLTEPred J (ms -: m) lt of\n LTEEqual _ _ eq =>\n rewrite sym $ eq in Refl\n LTELessThan _ _ lt2 =>\n rewrite minusDashAppendsTail (pred (ms -: m)) J lt2 (I :: tail) in\n rewrite minusDashAppendsTail (pred (ms -: m)) J lt2 [I] in Refl\nminusDashAppendsTail (ms -: m -: O) (ns -: n -: I) (LTAppend (ns -: n) (ms -: m) lt I O) tail =\n case lessThanImpliesLTEPred (ns -: n) (ms -: m) lt of\n LTEEqual _ _ eq =>\n rewrite sym $ eq in\n rewrite minusOfItSelf (ns -: n) (I :: tail) in\n rewrite minusOfItSelf (ns -: n) [I] in Refl\n LTELessThan _ _ lt2 =>\n rewrite minusDashAppendsTail (pred (ms -: m)) (ns -: n) lt2 (I :: tail) in\n rewrite minusDashAppendsTail (pred (ms -: m)) (ns -: n) lt2 [I] in Refl\nminusDashAppendsTail (ms -: I) (ns -: O) (LTLeading ns ms eq) tail =\n rewrite eq in\n rewrite minusLast10 ms ms tail in\n rewrite minusLast10 ms ms [] in\n case ms of\n J => Refl\n (ms2 -: m) =>\n rewrite minusOfItSelf (ms2 -: m) (I :: tail) in\n rewrite minusOfItSelf (ms2 -: m) [I] in Refl\nminusDashAppendsTail (ms -: m -: I) (ns -: O) (LTAppend ns (ms -: m) lt O I) tail =\n rewrite minusDashAppendsTail (ms -: m) ns lt (I :: tail) in\n rewrite minusDashAppendsTail (ms -: m) ns lt [I] in Refl\nminusDashAppendsTail (J -: I) (ns -: I) (LTAppend ns J lt I I) tail impossible\nminusDashAppendsTail (ms -: m -: I) (ns -: I) (LTAppend ns (ms -: m) lt I I) tail =\n rewrite minusDashAppendsTail (ms -: m) ns lt (O :: tail) in\n rewrite minusDashAppendsTail (ms -: m) ns lt [O] in Refl\n\nplusNMinusN : (m, n : BiNat) -> minus (plus m n) n = m\nplusNMinusN J J = Refl\nplusNMinusN J (J -: O) = Refl\nplusNMinusN J (ns -: O -: O) = minusOfItSelf (ns -: O) [I]\nplusNMinusN J (ns -: I -: O) = minusOfItSelf (ns -: I) [I]\nplusNMinusN J (J -: I) = Refl\nplusNMinusN J (ns -: O -: I) = minusOfItSelf (ns -: O) [I]\nplusNMinusN J (ns -: I -: I) =\n rewrite succDashAppendsAcc ns [O, O] in\n rewrite predOfDoubled (succ ns) (succIsNotJ ns) in\n rewrite predOfSucc ns in\n rewrite minusOfItSelf (ns -: I) [I] in Refl\nplusNMinusN (J -: O) J = Refl\nplusNMinusN (ms -: O -: O) J = Refl\nplusNMinusN (ms -: I -: O) J = Refl\nplusNMinusN (J -: I) J = Refl\nplusNMinusN (ms -: O -: I) J = Refl\nplusNMinusN (ms -: I -: I) J =\n rewrite succDashAppendsAcc ms [O, O] in\n rewrite predOfDoubled (succ ms) (succIsNotJ ms) in\n rewrite predOfSucc ms in Refl\nplusNMinusN (ms -: O) (ns -: O) =\n rewrite plusDashAppendsAcc ms ns O [O] in\n rewrite minusLast00 (plus ms ns) ns [] in\n rewrite minusDashAppendsTail (plus ms ns) ns (lessThanPlus ns ms) [O] in\n rewrite plusNMinusN ms ns in Refl\nplusNMinusN (ms -: O) (ns -: I) =\n rewrite plusDashAppendsAcc ms ns O [I] in\n rewrite minusLast11 (plus ms ns) ns [] in\n rewrite minusDashAppendsTail (plus ms ns) ns (lessThanPlus ns ms) [O] in\n rewrite plusNMinusN ms ns in Refl\nplusNMinusN (ms -: I) (ns -: O) =\n rewrite plusDashAppendsAcc ms ns O [I] in\n rewrite minusLast10 (plus ms ns) ns [] in\n rewrite minusDashAppendsTail (plus ms ns) ns (lessThanPlus ns ms) [I] in\n rewrite plusNMinusN ms ns in Refl\nplusNMinusN (ms -: I) (ns -: I) =\n rewrite plusDashAppendsAcc ms ns I [O] in\n rewrite sym $ succGoesToCarry ms ns [] in\n rewrite minusLast01 (succ (plus ms ns)) ns [] (succIsNotJ (plus ms ns)) in\n rewrite predOfSucc (plus ms ns) in\n rewrite minusDashAppendsTail (plus ms ns) ns (lessThanPlus ns ms) [I] in\n rewrite plusNMinusN ms ns in Refl\n\nminusNPlusN : (m, n : BiNat) -> GT m n -> plus (minus m n) n = m\nminusNPlusN m n =\n induction\n (\\k => LT n k -> plus (minus k n) n = k)\n (\\k, pk, lt =>\n case lessThanImpliesLTEPred n (succ k) lt of\n LTEEqual _ _ eq =>\n rewrite eq in\n rewrite predOfSucc k in\n rewrite sym $ jPlusIsSucc k in\n rewrite plusNMinusN J k in Refl\n LTELessThan _ _ lt2 =>\n let pk' = pk (replace {P = \\z => LT n z} (predOfSucc k) lt2) in\n replace {P = \\z => plus (minus (succ z) n) n = succ k} pk' $\n rewrite sym $ jPlusIsSucc (plus (minus k n) n) in\n rewrite plusAssociative J (minus k n) n in\n rewrite plusNMinusN (plus J (minus k n)) n in\n rewrite sym $ plusAssociative J (minus k n) n in\n rewrite pk' in jPlusIsSucc k\n )\n (\\lt => absurd (uninhabited lt))\n m\n\nsuccIntoMinus : (m, n : BiNat) -> GT m n -> succ (minus m n) = minus (succ m) n\nsuccIntoMinus m n lt =\n induction\n (\\k => LT n k -> succ (minus k n) = minus (succ k) n)\n (\\k, pk, ltSucc =>\n case lessThanImpliesLTEPred n (succ k) ltSucc of\n LTEEqual _ _ eq =>\n rewrite eq in\n rewrite predOfSucc k in\n rewrite sym $ jPlusIsSucc k in\n rewrite plusNMinusN J k in\n rewrite sym $ jPlusIsSucc (plus J k) in\n rewrite plusAssociative J J k in\n rewrite plusNMinusN (J -: O) k in Refl\n LTELessThan _ _ lt =>\n rewrite sym $ minusNPlusN (succ k) n ltSucc in\n rewrite sym $ jPlusIsSucc (plus (minus (succ k) n) n) in\n rewrite plusAssociative J (minus (succ k) n) n in\n rewrite plusNMinusN (plus J (minus (succ k) n)) n in\n rewrite jPlusIsSucc (minus (succ k) n) in\n rewrite plusNMinusN (minus (succ k) n) n in Refl\n )\n (absurd . uninhabited)\n m lt\n\nsuccNMinusNIsJ : (n : BiNat) -> minus (succ n) n = J\nsuccNMinusNIsJ J = Refl\nsuccNMinusNIsJ (ns -: O) = rewrite minusLast10 ns ns [] in minusOfItSelf ns [I]\nsuccNMinusNIsJ (ns -: I) =\n rewrite succDashAppendsAcc ns [O] in\n rewrite minusLast01 (succ ns) ns [] (succIsNotJ ns) in\n rewrite predOfSucc ns in\n minusOfItSelf ns [I]\n\nnMinusPredNIsJ : (n : BiNat) -> minus n (pred n) = J\nnMinusPredNIsJ J = Refl\nnMinusPredNIsJ (J -: O) = Refl\nnMinusPredNIsJ (ns -: n -: O) = rewrite predDashAppendsAcc (ns -: n) [I] in minusOfItSelf (pred (ns -: n)) [I]\nnMinusPredNIsJ (ns -: I) = rewrite minusLast10 ns ns [] in minusOfItSelf ns [I]\n\nminusIntoPlusLeft : (l, m, n : BiNat) -> GT l n -> minus (plus l m) n = plus (minus l n) m\nminusIntoPlusLeft l m n lt =\n induction\n (\\k => minus (plus l k) n = plus (minus l n) k)\n (\\k, pk =>\n rewrite sym $ plusJIsSucc k in\n rewrite plusAssociative l k J in\n rewrite plusJIsSucc (plus l k) in\n let nLtLPlusK = lessThanTransitive lt (replace (plusSymmetric k l) (lessThanPlus l k)) in\n rewrite sym $ succIntoMinus (plus l k) n nLtLPlusK in\n rewrite pk in\n rewrite sym $ plusJIsSucc (plus (minus l n) k5) in\n rewrite sym $ plusAssociative (minus l n) k J in Refl\n )\n (\n rewrite plusJIsSucc l in\n rewrite plusJIsSucc (minus l n) in\n sym $ succIntoMinus l n lt\n )\n m\n\nminusIntoPlusRight : (l, m, n : BiNat) -> GT m n -> minus (plus l m) n = plus l (minus m n)\nminusIntoPlusRight l m n lt =\n rewrite plusSymmetric l m in\n rewrite minusIntoPlusLeft m l n lt in\n plusSymmetric (minus m n) l\n\nminusGreater : (m, n : BiNat) -> LT m n -> (tail : List Bit) -> minus' m n tail = J\nminusGreater m J lt tail impossible\nminusGreater J (ns -: n) lt tail = Refl\nminusGreater (ms -: O) (ns -: O) (LTAppend ms ns lt O O) tail =\n rewrite minusLast00 ms ns tail in minusGreater ms ns lt (O :: tail)\nminusGreater (ms -: I) (ns -: O) (LTAppend ms ns lt I O) tail =\n rewrite minusLast10 ms ns tail in minusGreater ms ns lt (I :: tail)\nminusGreater (ms -: I) (ns -: I) (LTAppend ms ns lt I I) tail =\n rewrite minusLast11 ms ns tail in minusGreater ms ns lt (O :: tail)\nminusGreater (J -: O) (ns -: I) lt tail = Refl\nminusGreater (ms -: m -: O) (ns -: I) (LTAppend (ms -: m) ns lt O I) tail =\n let lt2 = lessThanTransitive (predIsLessThan (ms -: m) (JLT ms m)) lt in\n minusGreater (pred (ms -: m)) ns lt2 (I :: tail)\nminusGreater (ms -: m -: O) (ns -: I) (LTLeading (ms -: m) ns eq) tail =\n let lt = replace {P = \\z => LT (pred (ms -: m)) z} eq (predIsLessThan (ms -: m) (JLT ms m)) in\n minusGreater (pred (ms -: m)) ns lt (I :: tail)\n\nminusOfSuccs : (m, n : BiNat) -> minus m n = minus (succ m) (succ n)\nminusOfSuccs J J = Refl\nminusOfSuccs J (ns -: O) = Refl\nminusOfSuccs J (ns -: I) =\n rewrite succDashAppendsAcc ns [O] in\n rewrite minusGreater J (succ ns) (succGreaterThanJ ns) [O] in Refl\nminusOfSuccs (J -: O) J = Refl\nminusOfSuccs (ms -: m -: O) J =\n rewrite minusDashAppendsTail (ms -: m) J (JLT ms m) [I] in\n rewrite minusJIsPred (ms -: m) in Refl\nminusOfSuccs (J -: I) J = Refl\nminusOfSuccs (ms -: m -: I) J =\n rewrite succDashAppendsAcc (ms -: m) [O] in\n rewrite minusLast00 (succ (ms -: m)) J [] in\n rewrite minusDashAppendsTail (succ (ms -: m)) J (succGreaterThanJ (ms -: m)) [O] in\n rewrite minusJIsPred (succ (ms -: m)) in\n rewrite predOfSucc (ms -: m) in Refl\nminusOfSuccs (ms -: O) (ns -: O) = rewrite minusLast11 ms ns [] in minusLast00 ms ns []\nminusOfSuccs (J -: O) (ns -: I) =\n rewrite succDashAppendsAcc ns [O] in\n sym $ minusGreater J (succ ns) (succGreaterThanJ ns) [I]\nminusOfSuccs (ms -: m -: O) (ns -: I) =\n rewrite succDashAppendsAcc ns [O] in\n case lessThanOrGTE ns (pred (ms -: m)) of\n Left nLTpredm =>\n let succnLTm = replace {P = \\z => LT (succ ns) z} (succOfPred (ms -: m) uninhabited) $\n succKeepsLessThan ns (pred (ms -: m)) nLTpredm in\n rewrite minusDashAppendsTail (pred (ms -: m)) ns nLTpredm [I] in\n rewrite minusDashAppendsTail (ms -: m) (succ ns) succnLTm [I] in\n rewrite minusOfSuccs (pred (ms -: m)) ns in\n rewrite succOfPred (ms -: m) uninhabited in Refl\n Right (LTEEqual (pred (ms -: m)) ns eq) =>\n rewrite sym $ succOfPred (ms -: m) uninhabited in\n rewrite eq in\n rewrite predOfSucc ns in\n rewrite minusOfItSelf ns [I] in\n rewrite minusOfItSelf (succ ns) [I] in Refl\n Right (LTELessThan (pred (ms -: m)) ns predmLTn) =>\n let mLTsuccn = replace {P = \\z => LT z (succ ns)} (succOfPred (ms -: m) uninhabited) $\n succKeepsLessThan (pred (ms -: m)) ns predmLTn in\n rewrite minusGreater (pred (ms -: m)) ns predmLTn [I] in\n rewrite minusGreater (ms -: m) (succ ns) mLTsuccn [I] in Refl\nminusOfSuccs (ms -: I) (ns -: O) =\n rewrite minusLast10 ms ns [] in\n rewrite succDashAppendsAcc ms [O] in\n rewrite minusLast01 (succ ms) ns [] (succIsNotJ ms) in\n rewrite predOfSucc ms in Refl\nminusOfSuccs (ms -: I) (ns -: I) =\n rewrite minusLast11 ms ns [] in\n rewrite succDashAppendsAcc ms [O] in\n rewrite succDashAppendsAcc ns [O] in\n rewrite minusLast00 (succ ms) (succ ns) [] in\n case lessThanOrGTE ns ms of\n Left gt =>\n rewrite minusDashAppendsTail ms ns gt [O] in\n rewrite minusDashAppendsTail (succ ms) (succ ns) (succKeepsLessThan ns ms gt) [O] in\n rewrite minusOfSuccs ms ns in Refl\n Right (LTEEqual ms ns eq) =>\n rewrite eq in\n rewrite minusOfItSelf ns [O] in\n rewrite minusOfItSelf (succ ns) [O] in Refl\n Right (LTELessThan ms ns lt) =>\n rewrite minusGreater ms ns lt [O] in\n rewrite minusGreater (succ ms) (succ ns) (succKeepsLessThan ms ns lt) [O] in Refl\n\npredIntoMinus' : (m, n : BiNat) -> GT m n -> pred (minus m n) = minus (pred m) n\npredIntoMinus' m n gt = induction\n (\\k => GT k n -> pred (minus k n) = minus (pred k) n)\n (\\k, pk, nLTsucck =>\n case lessThanImpliesLTEPred n (succ k) nLTsucck of\n LTEEqual n (pred $ succ k) eq =>\n rewrite eq in\n rewrite predOfSucc k in\n rewrite succNMinusNIsJ k in\n rewrite minusOfItSelf k [] in Refl\n LTELessThan n (pred $ succ k) lt =>\n let nLTk = replace (predOfSucc k) lt in\n rewrite sym $ succIntoMinus k n nLTk in\n rewrite predOfSucc (minus k n) in\n rewrite predOfSucc k in Refl\n )\n (\\gt => absurd $ uninhabited gt)\n m gt\n\npredIntoMinus : (m, n : BiNat) -> pred (minus m n) = minus (pred m) n\npredIntoMinus m n =\n case lessThanOrGTE n m of\n Left gt =>\n predIntoMinus' m n gt\n Right (LTEEqual m n eq) =>\n rewrite eq in\n rewrite minusOfItSelf n [] in\n case predLessThanEqual n of\n LTEEqual (pred n) n eq2 =>\n rewrite eq2 in\n sym $ minusOfItSelf n []\n LTELessThan (pred n) n lt =>\n rewrite minusGreater (pred n) n lt [] in Refl\n Right (LTELessThan m n lt) =>\n rewrite minusGreater m n lt [] in\n let predmLTn = transLTEandLT (predLessThanEqual m) lt in\n rewrite minusGreater (pred m) n predmLTn [] in Refl\n\npredIntoMinusSucc : (m, n : BiNat) -> pred (minus m n) = minus m (succ n)\npredIntoMinusSucc J n = rewrite jMinusIsJ n in rewrite jMinusIsJ (succ n) in Refl\npredIntoMinusSucc (ms -: m) n =\n rewrite predIntoMinus (ms -: m) n in\n rewrite minusOfSuccs (pred (ms -: m)) n in\n rewrite succOfPred (ms -: m) uninhabited in Refl\n\nminusTwiceLeft : (l, m, n : BiNat) -> minus (minus l m) n = minus l (plus m n)\nminusTwiceLeft l m n = induction\n (\\k => minus (minus l k) n = minus l (plus k n))\n (\\k, pk =>\n rewrite sym $ predIntoMinusSucc l k in\n rewrite sym $ jPlusIsSucc k in\n rewrite sym $ plusAssociative J k n in\n rewrite jPlusIsSucc (plus k n) in\n rewrite sym $ predIntoMinusSucc l (plus k n) in\n rewrite sym $ predIntoMinus (minus l k) n in\n rewrite pk in Refl\n )\n (\n rewrite minusJIsPred l in\n rewrite sym $ predIntoMinus l n in\n rewrite jPlusIsSucc n in\n rewrite sym $ predIntoMinusSucc l n in Refl\n )\n m\n\nminusLessThanOriginal : (m, n : BiNat) -> GT m J -> LT (minus m n) m\nminusLessThanOriginal m n mgtj = induction\n (\\k => LT (minus m k) m)\n (\\k, pk =>\n let lte1 = predLessThanEqual (minus m k) in\n replace {P = \\z => LT z m} (predIntoMinusSucc m k) (transLTEandLT lte1 pk)\n )\n (replace {P = \\z => LT z m} (sym $ minusJIsPred m) (predIsLessThan m mgtj))\n n\n\nmultDistributesMinusLeft : (l, m, n : BiNat) -> GT l m -> mult (minus l m) n = minus (mult l n) (mult m n)\nmultDistributesMinusLeft l m n gt = induction\n (\\k => GT k m -> mult (minus k m) n = minus (mult k n) (mult m n))\n (\\k, pk, succkGTm =>\n case lessThanImpliesLTEPred m (succ k) succkGTm of\n LTEEqual _ _ eq =>\n rewrite eq in\n rewrite predOfSucc k in\n rewrite succNMinusNIsJ k in\n rewrite plusJIsSucc n in\n rewrite predOfSucc n in\n rewrite multOfSuccLeft k n in\n rewrite plusNMinusN n (mult k n) in Refl\n LTELessThan _ _ lt =>\n let mLTk = replace (predOfSucc k) lt in\n rewrite sym $ succIntoMinus k m mLTk in\n rewrite multOfSuccLeft (minus k m) n in\n rewrite pk mLTk in\n rewrite multOfSuccLeft k n in\n rewrite minusIntoPlusRight n (mult k n) (mult m n) (multNKeepsLT m k mLTk n) in Refl\n )\n (absurd . uninhabited)\n l gt\n\nmultDistributesMinusRight : (l, m, n : BiNat) -> GT m n -> mult l (minus m n) = minus (mult l m) (mult l n)\nmultDistributesMinusRight l m n gt =\n rewrite multSymmetric l (minus m n) in\n rewrite multDistributesMinusLeft m n l gt in\n rewrite multSymmetric l m in\n rewrite multSymmetric l n in Refl\n", "meta": {"hexsha": "6aee134737ad6bbfc92241c7c90747b3c96147e4", "size": 19937, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "BiNat/Properties/Minus.idr", "max_stars_repo_name": "SekiT/BiNat", "max_stars_repo_head_hexsha": "1ac44fa9d5f60e1fb6ceee6394d49c0ecd8aebfd", "max_stars_repo_licenses": ["WTFPL"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "BiNat/Properties/Minus.idr", "max_issues_repo_name": "SekiT/BiNat", "max_issues_repo_head_hexsha": "1ac44fa9d5f60e1fb6ceee6394d49c0ecd8aebfd", "max_issues_repo_licenses": ["WTFPL"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "BiNat/Properties/Minus.idr", "max_forks_repo_name": "SekiT/BiNat", "max_forks_repo_head_hexsha": "1ac44fa9d5f60e1fb6ceee6394d49c0ecd8aebfd", "max_forks_repo_licenses": ["WTFPL"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 43.6258205689, "max_line_length": 110, "alphanum_fraction": 0.5997893364, "num_tokens": 6826, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6334102498375401, "lm_q2_score": 0.5698526514141571, "lm_q1q2_score": 0.3609505103028259}} {"text": "module Effekt.CpsUnstaged\n\npublic export\nCps : Type -> Type -> Type\nCps r a = (a -> r) -> r\n\nshift0 : ((a -> r) -> r) -> Cps r a\nshift0 = id\n\nrunIn0 : Cps r a -> (a -> r) -> r\nrunIn0 = id\n\nreset0 : Cps r r -> r\nreset0 m = runIn0 m id\n\npure : a -> Cps r a\npure a = \\k => k a\n\npush : (a -> Cps r b) -> (b -> r) -> (a -> r)\npush f k = \\a => f a k\n\nbind : Cps r a -> (a -> Cps r b) -> Cps r b\nbind m f = \\k => m (push f k)\n\n(>>=) : Cps r a -> (a -> Cps r b) -> Cps r b\nm >>= f = bind m f\n\nexample : Int\nexample = 1 + reset0 (do\n x <- shift0 (\\k => k (k 100))\n pure (10 + x))\n", "meta": {"hexsha": "12ccf18e87a012cd4b2819db879092ff0be7a2df", "size": 573, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Effekt/CpsUnstaged.idr", "max_stars_repo_name": "b-studios/idris-effekt", "max_stars_repo_head_hexsha": "d9c5094456677914e034ef1ade9525ac0c338108", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2020-10-14T00:28:55.000Z", "max_stars_repo_stars_event_max_datetime": "2020-10-14T00:28:55.000Z", "max_issues_repo_path": "Effekt/CpsUnstaged.idr", "max_issues_repo_name": "b-studios/idris-effekt", "max_issues_repo_head_hexsha": "d9c5094456677914e034ef1ade9525ac0c338108", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Effekt/CpsUnstaged.idr", "max_forks_repo_name": "b-studios/idris-effekt", "max_forks_repo_head_hexsha": "d9c5094456677914e034ef1ade9525ac0c338108", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 17.90625, "max_line_length": 45, "alphanum_fraction": 0.4816753927, "num_tokens": 251, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6825737473266736, "lm_q2_score": 0.5273165233795671, "lm_q1q2_score": 0.35993241539046467}} {"text": "module Circuits.NetList.Linear.Usage.DataType.Use.Partial\n\nimport Decidable.Equality\n\nimport Data.Nat\nimport Data.List.Elem\nimport Data.List.Quantifiers\n\nimport Data.Vect\nimport Data.Vect.AtIndex\nimport Data.Vect.Quantifiers\n\nimport Data.String\n\nimport Toolkit.Data.Whole\nimport Toolkit.Data.DList\nimport Toolkit.Data.DList.Elem\n\nimport Toolkit.Data.Vect.Extra\n\nimport Circuits.Common\nimport Circuits.NetList.Types\nimport Circuits.NetList.Linear.Usage.DataType\n\nimport Circuits.NetList.Linear.Usage.DataType.Use.Full\n\n%default total\n\nmutual\n public export\n data Use : (idx : Fin m)\n\n -> (type : DType)\n -> (old : Usage (BVECT (W (S n) ItIsSucc) type))\n -> (prfF : IsFreeAt idx (BVECT (W (S n) ItIsSucc) type) old)\n\n -> (new : Usage (BVECT (W (S n) ItIsSucc) type))\n -> (prfU : IsUsedAt idx (BVECT (W (S n) ItIsSucc) type) new)\n -> Type\n where\n UA : Use idx type fs prfFS us prfUS\n -> Use idx type (Array fs) (FreeAt prfFS) (Array us) (UsedAt prfUS)\n\n public export\n data Result : (idx : Fin m)\n -> (type : DType)\n -> (old : Usage (BVECT (W (S n) ItIsSucc) type))\n -> (free : IsFreeAt idx (BVECT (W (S n) ItIsSucc) type) old)\n -> Type\n where\n R : (new : Usage (BVECT (W (S n) ItIsSucc) type))\n -> (prfU : IsUsedAt idx (BVECT (W (S n) ItIsSucc) type) new)\n -> (holds : Use idx type old prfF new prfU)\n -> Result idx type old prfF\n\n namespace Vect\n public export\n data Use : (idx : Fin m)\n -> (type : DType)\n -> (old : Vect n (Usage type))\n -> (this : AtIndexI (Usage type) (IsFree type) m n idx old)\n -> (new : Vect n (Usage type))\n -> (that : AtIndexI (Usage type) (IsUsed type) m n idx new)\n -> Type\n where\n Here : (use : Use type f prfF u prfU)\n -> Use FZ type (f::fs) (At (Here prfF)) (u::fs) (At (Here prfU))\n\n Next : Use next type fs (At next_f) us (At next_u)\n -> Use (FS next) type (not_f::fs) (At (There next_f)) (not_u::us) (At (There next_u))\n\n public export\n data Result : (idx : Fin m)\n -> (type : DType)\n -> (old : Vect n (Usage type))\n -> (this : AtIndexI (Usage type) (IsFree type) m n idx old)\n -> Type\n where\n R : (new : Vect n (Usage type))\n -> (prfU : AtIndexI (Usage type) (IsUsed type) m n idx new)\n -> (holds : Use idx type old this new prfU)\n -> Result idx type old this\n\n\nmutual\n\n\n use : {type : DType}\n -> (idx : Fin m)\n -> {old : Usage (BVECT (W (S n) ItIsSucc) type)}\n -> (free : IsFreeAt idx (BVECT (W (S n) ItIsSucc) type) old)\n -> Result idx type old free\n use idx (FreeAt prf) with (use idx prf)\n use idx (FreeAt prf) | (R new prfU holds)\n = R (Array new) (UsedAt prfU) (UA holds)\n\n\n namespace Vect\n\n export\n use : {type : DType}\n -> (idx : Fin m)\n -> {old : Vect n (Usage type)}\n -> (this : AtIndexI (Usage type) (IsFree type) m n idx old)\n -> Result idx type old this\n use FZ {old=(x :: xs)} (At (Here prf)) with (use prf)\n use FZ {old=(x :: xs)} (At (Here prf)) | (R u used result)\n = R (u :: xs) (At (Here used)) (Here result)\n\n use (FS next) {old=(not_x :: xs)} (At (There later)) with (use next (At later))\n use (FS next) {old=(not_x :: xs)} (At (There later)) | (R new (At x) holds)\n = R (not_x :: new) (At (There x)) (Next holds)\n\n-- [ EOF ]\n", "meta": {"hexsha": "055a2db04707901a4ff673e7376728819eadbb29", "size": 3870, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Circuits/NetList/Linear/Usage/DataType/Use/Partial.idr", "max_stars_repo_name": "gallais/linear-circuits", "max_stars_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_stars_repo_licenses": ["BSD-3-Clause-Clear"], "max_stars_count": 8, "max_stars_repo_stars_event_min_datetime": "2021-11-29T17:20:04.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-10T21:41:44.000Z", "max_issues_repo_path": "src/Circuits/NetList/Linear/Usage/DataType/Use/Partial.idr", "max_issues_repo_name": "gallais/linear-circuits", "max_issues_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_issues_repo_licenses": ["BSD-3-Clause-Clear"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Circuits/NetList/Linear/Usage/DataType/Use/Partial.idr", "max_forks_repo_name": "gallais/linear-circuits", "max_forks_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_forks_repo_licenses": ["BSD-3-Clause-Clear"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-02-09T19:49:11.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-09T19:49:11.000Z", "avg_line_length": 33.652173913, "max_line_length": 97, "alphanum_fraction": 0.5085271318, "num_tokens": 1185, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6825737344123242, "lm_q2_score": 0.5273165233795671, "lm_q1q2_score": 0.3599324085805148}} {"text": "module InvParComb2\n\n%default total\n%hide Prelude.Algebra.(<*>)\n%hide Prelude.Applicative.(<|>)\n\n-- http://www.informatik.uni-marburg.de/~rendel/unparse/\n\n\n-- core definitions\n\ndata PartIso a b = MkPartIso (a -> Maybe b) (b -> Maybe a)\n\nclass PartIsoFunctor (f : Type -> Type -> Type) where\n (<$>) : PartIso a b -> (f a c -> f b c)\n\nclass PFunctor (f : Type -> Type -> Type) where\n (<*>) : f a c -> Lazy (f b c) -> f (a, b) c\n\nclass PAlternative (f : Type -> Type -> Type) where\n (<|>) : f a c -> Lazy (f a c) -> f a c\n empty : f a c\n\nclass (PartIsoFunctor d, PFunctor d, PAlternative d) => Syntax (d : Type -> Type -> Type) c where\n pure : Eq a => a -> d a c\n item : d c c\n\n\n-- helper functions\n\nipc_inverse : PartIso a b -> PartIso b a\nipc_inverse (MkPartIso f g) = MkPartIso g f\n\nipc_apply : PartIso a b -> a -> Maybe b\nipc_apply (MkPartIso f g) = f\n\nipc_unapply : PartIso a b -> b -> Maybe a\nipc_unapply = ipc_apply . ipc_inverse\n\n\n-- Algebra\n\ninfixr 1 >=>\n(>=>) : Monad m => (a -> m b) -> (b -> m c) -> (a -> m c)\nf >=> g = \\x => f x >>= g\n\npId : PartIso a a\npId = MkPartIso (\\x => Just x) (\\x => Just x)\n\n(.) : PartIso b c -> PartIso a b -> PartIso a c\ng . f = MkPartIso (ipc_apply f >=> ipc_apply g) (ipc_unapply g >=> ipc_unapply f)\n\n\npTup : PartIso a b -> PartIso c d -> PartIso (a, c) (b, d)\npTup i j = MkPartIso f g where\n f (a, b) = case (ipc_apply i a) of\n Nothing => Nothing\n Just x => case (ipc_apply j b) of\n Nothing => Nothing\n Just y => Just (x, y)\n g (c, d) = case (ipc_unapply i c) of\n Nothing => Nothing\n Just x => case (ipc_unapply j d) of\n Nothing => Nothing\n Just y => Just (x, y)\n\nassociate : PartIso (a, (b, c)) ((a, b), c)\nassociate = MkPartIso f g where\n f (a, (b, c)) = Just ((a, b), c)\n g ((a, b), c) = Just (a, (b, c))\n\ncommute : PartIso (a, b) (b, a)\ncommute = MkPartIso f f where\n f : (c, d) -> Maybe (d, c)\n f (a, b) = Just (b, a)\n\nunit : PartIso a (a, ())\nunit = MkPartIso f g where\n f a = Just (a, ())\n g (a, ()) = Just a\n\n\n-- *>, <*\n\ninfixl 3 *>\n(*>) : Syntax d c => d () c -> d a c -> d a c\np *> q = ipc_inverse unit . commute <$> p <*> q\n\ninfixl 3 <*\n(<*) : Syntax d c => d a c -> d () c -> d a c\np <* q = ipc_inverse unit <$> p <*> q\n\nignore : a -> PartIso a ()\nignore x = MkPartIso f g where\n f y = Just ()\n g () = Just x\n\n\n-- Parser\n\ndata Parser a c = MkParser (List c -> Maybe (a, List c))\n\nparse : Parser a c -> List c -> Maybe a\nparse (MkParser p) s = p s >>= pure . fst\n\ninstance PartIsoFunctor Parser where\n iso <$> (MkParser p) = MkParser pf\n where\n pf l = do\n (x, rest) <- p l\n y <- ipc_apply iso x\n return (y, rest)\n\ninstance PFunctor Parser where\n (MkParser p) <*> mkpq = MkParser pf\n where\n pf l = do\n (x, rest) <- p l\n case mkpq of\n (MkParser q) => do\n (y, ret) <- q rest\n return ((x, y), ret)\n\ninstance PAlternative Parser where\n (MkParser p) <|> mkpq = MkParser pf\n where\n pf l = case p l of\n Just x => Just x\n Nothing => case mkpq of\n (MkParser q) => q l\n empty = MkParser (\\s => Nothing)\n\ninstance Syntax Parser c where\n pure x = MkParser (\\s => Just (x, s))\n item = MkParser f\n where\n f [] = Nothing\n f (x :: xs) = Just (x, xs)\n\n\n-- Printer\n\ndata Printer a c = MkPrinter (a -> Maybe (List c))\n\ncompose : Printer a c -> a -> Maybe (List c)\ncompose (MkPrinter p) x = p x\n\ninstance PartIsoFunctor Printer where\n iso <$> (MkPrinter p) = MkPrinter (\\b => ipc_unapply iso b >>= p)\n\ninstance PFunctor Printer where\n (MkPrinter p) <*> mkpq = MkPrinter pf\n where\n pf (x, y) = do\n x' <- p x\n case mkpq of\n (MkPrinter q) => do\n y' <- q y\n return (x' ++ y')\n\ninstance PAlternative Printer where\n (MkPrinter p) <|> mkpq = MkPrinter $ \\s =>\n case (p s) of\n Nothing => case mkpq of\n (MkPrinter q) => q s\n x => x\n empty = MkPrinter (\\s => Nothing)\n\n\ninstance Syntax Printer γ where\n pure x = MkPrinter (\\y =>\n if x == y\n then Just []\n else Nothing)\n item = MkPrinter (\\t => Just [t])\n\n\n-- Basic parsers/composers\n\nsat : Syntax d a => (a -> Bool) -> d a a\nsat p = (MkPartIso check check) <$> item\n where check x = if p x then Just x else Nothing\n\nval : (Syntax d a, Eq a) => a -> d a a\nval x = sat (== x)\n\n\n-- rep\n\nnilv : PartIso () (Vect 0 a)\nnilv = MkPartIso (const . Just $ Vect.Nil {a=a})\n (\\xs => case xs of\n [] => Just ()\n _ => Nothing)\n\nconsv : PartIso (a, Vect n a) (Vect (S n) a)\nconsv = MkPartIso c1 c2\n where c1 (x, xs) = Just (x :: xs)\n c2 (x :: xs) = Just (x, xs)\n\nrep : Syntax d c => (n : Nat) -> d a c -> d (Vect n a) c\nrep Z p = nilv <$> pure ()\nrep (S k) p = consv <$> p <*> rep k p\n\n\n-- many\n\nnil : PartIso () (List a)\nnil = MkPartIso c1 c2\n where\n c1 () = Just []\n c2 [] = Just ()\n c2 (x :: xs) = Nothing\n\ncons : PartIso (a, List a) (List a)\ncons = MkPartIso c1 c2\n where\n c1 (x, l) = Just $ x :: l\n c2 [] = Nothing\n c2 (x :: xs) = Just (x, xs)\n\npartial many : Syntax d c => d a c -> d (List a) c\nmany p = (cons <$> (p <*> (many p)))\n <|> (nil <$> pure ())\n\n\n-- Various types\n\n-- List Bool <-> Nat, with size and endianness\n\ndata Endianness = BE | LE\n\norder : Endianness -> Vect n Bool -> Vect n Bool\norder BE = reverse\norder LE = id\n\nnatToBits : Nat -> Endianness -> (k : Nat) -> Vect k Bool\nnatToBits n e v = order e $ natToBits' n v\n where natToBits' : Nat -> (k : Nat) -> Vect k Bool\n natToBits' n Z = []\n natToBits' Z bits = replicate bits False\n natToBits' n (S bits) = (mod n 2 /= Z) :: natToBits' (div n 2) bits\n\nbitsToNat : Vect n Bool -> Endianness -> Nat\nbitsToNat v e = bitsToNat' (order e v)\n where bitsToNat' : Vect k Bool -> Nat\n bitsToNat' [] = Z\n bitsToNat' (v :: l) = (if v then 1 else 0) + 2 * bitsToNat' l\n\nnat : Syntax d Bool => Endianness -> Nat -> d Nat Bool\nnat endianness size = MkPartIso pf cf <$> rep size item\n where\n pf l = Just $ bitsToNat l endianness\n cf x = Just $ natToBits x endianness size\n\n\n-- testing\n\ntest : Syntax d Nat => d (Nat, Nat) Nat\ntest = (val 1) <*> item\n <|> (val 2) <*> (val 3)\n\ntest2 : Syntax d Bool => d (Nat, Bool) Bool\ntest2 = (nat BE 4) <*> (val True)\n <|> (nat BE 2) <*> (val False)\n\npartial test3 : Syntax d Bool => d (Bool, List Nat) Bool\ntest3 = (val True) <*> ((ignore False <$> item) *> (many $ nat BE 4))\n <|> (val False) <*> ((ignore True <$> item) *> (many $ nat LE 3))\n\n-- compose test3 (False, [1,2,3])\n-- parse test3 [False, True, False, False, False, True, False, True, True, False]\n\n\n-- foldl\n\npartial driver : (a -> Maybe a) -> (a -> a)\ndriver step state = case step state of\n Just state' => driver step state'\n Nothing => state\n\npartial iterate : PartIso a a -> PartIso a a\niterate step = MkPartIso f g where\n f = Just . driver (ipc_apply step)\n g = Just . driver (ipc_unapply step)\n\nstep : PartIso (a, b) a -> PartIso (a, List b) (a, List b)\nstep i = (pTup i pId) . associate . (pTup pId (ipc_inverse cons))\n\npartial foldl : PartIso (a, b) a -> PartIso (a, List b) a\nfoldl i = ipc_inverse unit . (pTup pId (ipc_inverse nil)) . iterate (step i)\n", "meta": {"hexsha": "442d763975115667711095ef0086e20862fa320c", "size": 7131, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "playing-around/InvParComb2.idr", "max_stars_repo_name": "defanor/parcomb", "max_stars_repo_head_hexsha": "64e69395b6580cd0a9cc973cd2b3c8d04b5d1a89", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "playing-around/InvParComb2.idr", "max_issues_repo_name": "defanor/parcomb", "max_issues_repo_head_hexsha": "64e69395b6580cd0a9cc973cd2b3c8d04b5d1a89", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "playing-around/InvParComb2.idr", "max_forks_repo_name": "defanor/parcomb", "max_forks_repo_head_hexsha": "64e69395b6580cd0a9cc973cd2b3c8d04b5d1a89", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 24.4212328767, "max_line_length": 97, "alphanum_fraction": 0.5589678867, "num_tokens": 2479, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6224593452091672, "lm_q2_score": 0.5774953651858118, "lm_q1q2_score": 0.3594673868748893}} {"text": "module Circuits.NetList.Linear.Usage.DataType\n\nimport Decidable.Equality\n\nimport Data.Nat\nimport Data.List.Elem\nimport Data.List.Quantifiers\n\nimport Data.Vect\nimport Data.Vect.AtIndex\nimport Data.Vect.Quantifiers\n\nimport Data.String\n\nimport Toolkit.Data.Whole\nimport Toolkit.Data.DList\nimport Toolkit.Data.DList.Elem\n\n--import Toolkit.Data.Vect.Leanings\nimport Toolkit.Data.Vect.Extra\nimport Toolkit.Data.DVect\n\nimport Circuits.Common\n\nimport Circuits.NetList.Types\n\n%default total\n\n\npublic export\ndata Usage : DType -> Type where\n Logic : (u : Usage) -> Usage LOGIC\n\n Array : (us : Vect (S n) (Usage type))\n -> Usage (BVECT (W (S n) ItIsSucc) type)\n\nmutual\n namespace Free\n public export\n data IsFree : (type : DType) -> (u : Usage type) -> Type\n where\n FreeL : IsFree LOGIC (Logic FREE)\n FreeA : (prf : All (IsFree type) os)\n -> IsFree (BVECT (W (S n) ItIsSucc) type) (Array os)\n\n Uninhabited (IsFree LOGIC (Logic USED)) where\n uninhabited FreeL impossible\n\n\n namespace Used\n public export\n data IsUsed : (type : DType) -> (u : Usage type) -> Type\n where\n UsedL : IsUsed LOGIC (Logic USED)\n UsedA : (prf : All (IsUsed type) os)\n -> IsUsed (BVECT (W (S n) ItIsSucc) type) (Array os)\n\n Uninhabited (IsUsed LOGIC (Logic FREE)) where\n uninhabited UsedL impossible\n\n namespace Part\n public export\n data IsPart : (type : DType) -> (u : Usage type) -> Type\n where\n PartA : (notF : Any (IsFree type) os )\n -> (notU : Any (IsUsed type) os )\n -> IsPart (BVECT (W (S n) ItIsSucc) type) (Array os)\n\n Uninhabited (IsPart LOGIC (Logic u)) where\n uninhabited PartA impossible\n\nmutual\n\n namespace Free\n notFree : (All (IsFree type) us -> Void)\n -> IsFree (BVECT (W (S n) ItIsSucc) type) (Array us)\n -> Void\n notFree f (FreeA prf) = f prf\n\n export\n isFree : {type : DType}\n -> (u : Usage type)\n -> Dec (IsFree type u)\n isFree (Logic USED)\n = No absurd\n isFree (Logic FREE)\n = Yes FreeL\n\n isFree (Array us) with (all isFree us)\n isFree (Array us) | (Yes prf)\n = Yes (FreeA prf)\n isFree (Array us) | (No contra)\n = No (notFree contra)\n\n namespace Used\n notUsed : (All (IsUsed type) us -> Void)\n -> IsUsed (BVECT (W (S n) ItIsSucc) type) (Array us)\n -> Void\n notUsed f (UsedA prf) = f prf\n\n export\n isUsed : {type : DType}\n -> (u : Usage type)\n -> Dec (IsUsed type u)\n isUsed (Logic FREE)\n = No absurd\n isUsed (Logic USED)\n = Yes UsedL\n\n isUsed (Array us) with (all isUsed us)\n isUsed (Array us) | (Yes prf)\n = Yes (UsedA prf)\n isUsed (Array us) | (No contra)\n = No (notUsed contra)\n\n namespace Part\n\n export\n isPart : {type : DType}\n -> (u : Usage type)\n -> Dec (IsPart type u)\n isPart (Logic u)\n = No absurd\n\n isPart (Array us) with (any isFree us)\n isPart (Array us) | (Yes prfF) with (any isUsed us)\n isPart (Array us) | (Yes prfF) | (Yes prfU)\n = Yes (PartA prfF prfU)\n isPart (Array us) | (Yes prfF) | (No contra)\n = No (\\(PartA fs us) => contra us)\n\n isPart (Array us) | (No contra)\n = No (\\(PartA fs us) => contra fs)\n\n\npublic export\ndata IsFreeAt : (idx : Fin n) -> (type : DType) -> (u : Usage type) -> Type\n where\n FreeAt : {idx : Fin m}\n -> {us : Vect (S n) (Usage type)}\n -> (prf : AtIndexI (Usage type) (IsFree type) m (S n) idx us)\n -> IsFreeAt idx (BVECT (W (S n) ItIsSucc) type) (Array us)\n\nUninhabited (IsFreeAt idx LOGIC u) where\n uninhabited (FreeAt prf) impossible\n\n\nnotFreeAtIndex : (AtIndexI (Usage type) (IsFree type) m (S n) idx us -> Void)\n -> IsFreeAt idx (BVECT (W (S n) ItIsSucc) type) (Array us) -> Void\nnotFreeAtIndex f (FreeAt prf) = f prf\n\nexport\nisFreeAt : {type : DType}\n -> {n : Nat}\n -> (idx : Fin n)\n -> (u : Usage type)\n -> Dec (IsFreeAt idx type u)\n\nisFreeAt {n = n} idx (Logic u)\n = No absurd\n\nisFreeAt {n = n} idx (Array us) with (atIndexI isFree idx us)\n isFreeAt {n = (S n)} idx (Array us) | (Yes prf)\n = Yes (FreeAt prf)\n\n isFreeAt {n = n} idx (Array us) | (No contra)\n = No (notFreeAtIndex contra)\n\n\npublic export\ndata IsUsedAt : (idx : Fin n) -> (type : DType) -> (u : Usage type) -> Type\n where\n UsedAt : {idx : Fin m}\n -> (prf : AtIndexI (Usage type) (IsUsed type) m (S n) idx us)\n -> IsUsedAt idx (BVECT (W (S n) ItIsSucc) type) (Array us)\n\nUninhabited (IsUsedAt idx LOGIC u) where\n uninhabited (UsedAt prf) impossible\n\nnotUsedAtIndex : (AtIndexI (Usage type) (IsUsed type) m (S n) idx us -> Void)\n -> IsUsedAt idx (BVECT (W (S n) ItIsSucc) type) (Array us) -> Void\nnotUsedAtIndex f (UsedAt prf) = f prf\n\n\nexport\nisUsedAt : {type : DType}\n -> {n : Nat}\n -> (idx : Fin n)\n -> (u : Usage type)\n -> Dec (IsUsedAt idx type u)\n\nisUsedAt {n = n} idx (Logic u)\n = No absurd\n\nisUsedAt {n = n} idx (Array us) with (atIndexI isUsed idx us)\n isUsedAt {n = (S n)} idx (Array us) | (Yes prf)\n = Yes (UsedAt prf)\n\n isUsedAt {n = n} idx (Array us) | (No contra)\n = No (notUsedAtIndex contra)\n\n\nmutual\n\n export\n init : (type : DType) -> DPair (Usage type) (IsFree type)\n init LOGIC\n = MkDPair (Logic FREE) FreeL\n\n init (BVECT (W (S n) ItIsSucc) type) with (init type)\n init (BVECT (W (S n) ItIsSucc) type) | (MkDPair u prf) with (init (S n) u prf)\n init (BVECT (W (S n) ItIsSucc) type) | (MkDPair u prf) | (MkDPair os pU)\n = MkDPair (Array os) (FreeA pU)\n\n namespace Vect\n export\n init : (n : Nat)\n -> (u : Usage type)\n -> (prf : IsFree type u)\n -> DPair (Vect n (Usage type)) (All (IsFree type))\n init Z _ _ = MkDPair [] []\n init (S k) u prf with (init k u prf)\n init (S k) u prf | (MkDPair fst snd)\n = MkDPair (u :: fst) (prf :: snd)\n\n-- [ EOF ]\n", "meta": {"hexsha": "859471b21b8fa9f2e0baa282710318ec88ac2bdd", "size": 6154, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Circuits/NetList/Linear/Usage/DataType.idr", "max_stars_repo_name": "gallais/linear-circuits", "max_stars_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_stars_repo_licenses": ["BSD-3-Clause-Clear"], "max_stars_count": 8, "max_stars_repo_stars_event_min_datetime": "2021-11-29T17:20:04.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-10T21:41:44.000Z", "max_issues_repo_path": "src/Circuits/NetList/Linear/Usage/DataType.idr", "max_issues_repo_name": "gallais/linear-circuits", "max_issues_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_issues_repo_licenses": ["BSD-3-Clause-Clear"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Circuits/NetList/Linear/Usage/DataType.idr", "max_forks_repo_name": "gallais/linear-circuits", "max_forks_repo_head_hexsha": "5d13d955eafc2d92beae363e96d3cec8695830f2", "max_forks_repo_licenses": ["BSD-3-Clause-Clear"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2022-02-09T19:49:11.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-09T19:49:11.000Z", "avg_line_length": 27.1101321586, "max_line_length": 82, "alphanum_fraction": 0.5656483588, "num_tokens": 2024, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6893056040203135, "lm_q2_score": 0.5195213219520929, "lm_q1q2_score": 0.3581089586296191}} {"text": "\nmodule TypeFuns\n\nSorI : Bool -> Type\nSorI False = String\nSorI True = Int\n\ngetStringOrInt : (isInt : Bool) -> SorI isInt\ngetStringOrInt False = \"Twenty four\"\ngetStringOrInt True = 24\n\nvalToString : (isInt : Bool) -> SorI isInt -> String\nvalToString False x = trim x\nvalToString True x = cast x\n\nvts : (isInt : Bool) -> (case isInt of\n False => String\n True => Int) -> String\nvts False x = trim x\nvts True x = cast x\n", "meta": {"hexsha": "6afe07b17539b97eb27cc6deecb9d3804cf7f055", "size": 474, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Chapter6/TypeFuns.idr", "max_stars_repo_name": "robkorn/idris-type-driven-development-exercises", "max_stars_repo_head_hexsha": "d3dcf7e0e0707c991a20c020e671e6e0aa21cf84", "max_stars_repo_licenses": ["Unlicense"], "max_stars_count": 2, "max_stars_repo_stars_event_min_datetime": "2019-12-18T12:54:01.000Z", "max_stars_repo_stars_event_max_datetime": "2020-03-28T09:54:21.000Z", "max_issues_repo_path": "Chapter6/TypeFuns.idr", "max_issues_repo_name": "robkorn/idris-type-driven-development-exercises", "max_issues_repo_head_hexsha": "d3dcf7e0e0707c991a20c020e671e6e0aa21cf84", "max_issues_repo_licenses": ["Unlicense"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Chapter6/TypeFuns.idr", "max_forks_repo_name": "robkorn/idris-type-driven-development-exercises", "max_forks_repo_head_hexsha": "d3dcf7e0e0707c991a20c020e671e6e0aa21cf84", "max_forks_repo_licenses": ["Unlicense"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2019-12-18T12:54:05.000Z", "max_forks_repo_forks_event_max_datetime": "2019-12-18T12:54:05.000Z", "avg_line_length": 22.5714285714, "max_line_length": 52, "alphanum_fraction": 0.6012658228, "num_tokens": 139, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.6406358411176238, "lm_q2_score": 0.5583269943353745, "lm_q1q2_score": 0.35768428363471744}} {"text": "module Main\n\nimport Data.Vect as V\n\ninfixr 5 .+.\n\ndata Schema = SString\n | SInt\n | SChar\n | (.+.) Schema Schema\n\nSchemaType : Schema -> Type\nSchemaType SString = String\nSchemaType SInt = Int\nSchemaType SChar = Char\nSchemaType (x .+. y) = (SchemaType x, SchemaType y)\n\ndata Command : Schema -> Type where\n SetSchema : (newSchema : Schema) -> Command schema\n Add : SchemaType schema -> Command schema\n Get : Maybe Integer -> Command schema\n Quit : Command schema\n\nrecord DataStore where\n constructor MkData\n schema : Schema\n size : Nat\n items : Vect size (SchemaType schema)\n\n-- Writing definitons like below to extract fields for types will become tedious.\n-- Instead we can use Idris' record syntax (above), which gives accessor functions as default.\n{-\ndata DataStore : Type where\n MkData : (schema : Schema) ->\n (size : Nat) ->\n (items : Vect size (SchemaType schema)) ->\n DataStore\n\nsize : DataStore -> Nat\nsize (MkData schema size items) = size\n\nschema : DataStore -> Schema\nschema (MkData schema size items) = schema\n\nitems : (store : DataStore) -> Vect (size store) (SchemaType (schema store))\nitems (MkData schema size items) = items\n-}\n\nparseSchema : List String -> Maybe Schema\nparseSchema (\"String\" :: xs) = case xs of\n [] => Just SString\n _ => do xs_sch <- parseSchema xs\n Just (SString .+. xs_sch)\nparseSchema (\"Int\" :: xs) = case xs of\n [] => Just SInt\n _ => do xs_sch <- parseSchema xs\n Just (SInt .+. xs_sch)\nparseSchema (\"Char\" :: xs) = case xs of\n [] => Just SChar\n _ => do xs_sch <- parseSchema xs\n Just (SChar .+. xs_sch)\nparseSchema _ = Nothing\n\naddToStore : (store : DataStore) -> (SchemaType (schema store)) -> DataStore\naddToStore (MkData schema size store) newItem = MkData schema _ (addToData store)\n where\n addToData : Vect oldSize (SchemaType schema) -> Vect (S oldSize) (SchemaType schema)\n addToData [] = [newItem]\n addToData (item :: items) = item :: (addToData items)\n\ndisplay : SchemaType schema -> String\ndisplay {schema = SString} item = item\ndisplay {schema = SInt} item = cast item\ndisplay {schema = SChar} item = cast item\ndisplay {schema = (x .+. y)} (iteml, itemr) = \"(\" ++ (display $ iteml) ++ \",\" ++ (display $ itemr) ++ \")\"\n\ngetItem : (id : Integer) -> (store : DataStore) -> Maybe (String, DataStore)\ngetItem id store = let storeItems = items store in\n case integerToFin id (size store) of\n Nothing => Just $ (\"Out of range\\n\", store)\n (Just pos) => Just $ ((display (V.index pos storeItems)) ++ \"\\n\", store)\n\nparsePrefix : (schema : Schema) -> String -> Maybe (SchemaType schema, String)\nparsePrefix SString input = getQuoted (unpack input)\n where\n getQuoted : List Char -> Maybe (String, String)\n getQuoted ('\"' :: xs)\n = case span (/= '\"') xs of\n (quoted, '\"' :: rest) => Just (pack quoted, ltrim (pack rest))\n _ => Nothing\n getQuoted _ = Nothing\nparsePrefix SChar input = case unpack input of\n (c :: ' ' :: rest) => Just (c, ltrim (pack rest))\n _ => Nothing\nparsePrefix SInt input = case span isDigit input of\n (\"\", rest) => Nothing\n (num, rest) => Just (cast num, ltrim rest)\nparsePrefix (schemal .+. schemar) input = case parsePrefix schemal input of\n Nothing => Nothing\n Just (l_val, input') =>\n case parsePrefix schemar input' of\n Nothing => Nothing\n Just (r_val, input'') => Just ((l_val, r_val), input'')\n\nparseBySchema : (schema : Schema) -> (value : String) -> Maybe (SchemaType schema)\nparseBySchema schema input = case parsePrefix schema input of\n Just (res, \"\") => Just res\n Just _ => Nothing\n Nothing => Nothing\n\nsetSchema : (store : DataStore) -> Schema -> Maybe DataStore\nsetSchema store schema = case size store of\n Z => Just (MkData schema _ [])\n (S k) => Nothing\n\ntotal parseCommand : (schema : Schema) -> (cmd : String) -> (args : String) -> Maybe (Command schema)\nparseCommand schema \"add\" value = do schemaType <- parseBySchema schema value\n Just $ Add schemaType\nparseCommand schema \"get\" id = case unpack id of\n [] => Just $ Get Nothing\n l => case all isDigit l of\n False => Nothing\n True => Just $ Get (Just $ cast id)\n-- parseCommand \"size\" _ = Just Size\nparseCommand schema \"quit\" _ = Just Quit\n-- parseCommand \"search\" str = Just $ Search str\n{- ... rest of definition as before ... -}\nparseCommand schema \"schema\" rest\n = do schemaok <- parseSchema (words rest)\n Just (SetSchema schemaok)\nparseCommand _ _ _ = Nothing\n\nparse : (schema : Schema) ->\n (input : String) ->\n Maybe (Command schema)\nparse schema input = case span (/= ' ') input of\n (cmd, args) => parseCommand schema cmd (ltrim args)\n\nprocessInput : DataStore -> String -> Maybe (String, DataStore)\nprocessInput store input\n = case parse (schema store) input of\n Nothing => Just (\"Invalid command\\n\", store)\n Just (Add item) =>\n Just (\"ID \" ++ show (size store) ++ \"\\n\", addToStore store item)\n Just (SetSchema schema') =>\n case setSchema store schema' of\n Nothing => Just (\"Can't update schema\\n\", store)\n Just store' => Just (\"OK\\n\", store')\n Just (Get pos) => case pos of\n Just position => getItem position store\n Nothing => Just $ (unlines $ toList $ map display (items store), store)\n Just Quit => Nothing\n\nmain : IO ()\nmain = replWith (MkData (SString .+. SString .+. SInt) _ []) \"Command: \" processInput\n\n{-\n\n-- Below seems unnecessarily long and verbose to me, need to refactor!\nsearchStoreItems : (str : String) -> (storeItems : Vect size String) -> (count : Int) -> (acc : String) -> String\nsearchStoreItems str [] count acc = acc\nsearchStoreItems str (x :: xs) count acc = if (isInfixOf str x) then searchStoreItems str xs (count + 1) (acc ++ (show count) ++ \": \" ++ x ++ \"\\n\")\n else searchStoreItems str xs (count + 1) acc\n\nsearchStore : (str : String) -> (store : DataStore) -> String\nsearchStore str store = let storeItems = items store in (searchStoreItems str storeItems 0 \"\")\n\nprocessCommand : (command : Command) -> (store : DataStore) -> Maybe (String, DataStore)\nprocessCommand (Add str) store = Just $ (\"Added \" ++ str ++ \" to store at id \" ++ show (size store) ++ \"\\n\", addToStore store str)\nprocessCommand (Get id) store = getItem id store\nprocessCommand Size store = Just $ (\"No. of Items in Store is \" ++ show (size store) ++ \"\\n\", store)\nprocessCommand (Search str) store = Just $ (searchStore str store, store)\nprocessCommand Quit store = Nothing\n\nprocessInput : DataStore -> String -> Maybe (String, DataStore)\nprocessInput store input = case parse input of\n Nothing => Just $ (\"Invalid Command\\n\", store)\n (Just command) => processCommand command store\n-}\n", "meta": {"hexsha": "edfee7170c43975ba26fe95fd24107fc2b48cf4e", "size": 8441, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "DataStore.idr", "max_stars_repo_name": "balajisivaraman/idris-book", "max_stars_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 1, "max_stars_repo_stars_event_min_datetime": "2017-12-06T12:38:55.000Z", "max_stars_repo_stars_event_max_datetime": "2017-12-06T12:38:55.000Z", "max_issues_repo_path": "DataStore.idr", "max_issues_repo_name": "balajisivaraman/idris-book", "max_issues_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "DataStore.idr", "max_forks_repo_name": "balajisivaraman/idris-book", "max_forks_repo_head_hexsha": "2452de85e54de0242ec074a95762bde6fc4fe672", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-08-04T17:48:35.000Z", "max_forks_repo_forks_event_max_datetime": "2018-08-04T17:48:35.000Z", "avg_line_length": 46.8944444444, "max_line_length": 147, "alphanum_fraction": 0.5180665798, "num_tokens": 1850, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6187804478040616, "lm_q2_score": 0.5774953651858117, "lm_q1q2_score": 0.35734284067444666}} {"text": "module Flexidisc.OrdList.Sub\n\nimport Flexidisc.Dec.IsYes\nimport Flexidisc.OrdList.Fresh\nimport Flexidisc.OrdList.Label\nimport Flexidisc.OrdList.Nub\nimport Flexidisc.OrdList.Row\nimport Flexidisc.OrdList.Type\n\n%default total\n%access public export\n\n||| Proof that an `OrdList` is a sublist of another vect\npublic export\ndata Sub : (xs, ys : OrdList k v o) -> Type where\n ||| The empty `Ordlist` is a sublist of the empty `OrdList`\n Empty : Sub [] []\n ||| Making the second list larger don't change the property\n Skip : Sub xs ys -> Sub xs (y::ys)\n ||| To add an element to the first list, we need to add it to the second one\n Keep : Sub xs ys -> Sub (x::xs) (x::ys)\n\n%name Sub sub, issub, ss\n\n||| An empty `OrdList` is an ordered subset of any `Any`\nsubEmpty' : (xs : OrdList k v o) -> Sub [] xs\nsubEmpty' [] = Empty\nsubEmpty' (_ :: xs) = Skip (subEmpty' xs)\n\n||| An empty `OrdList` is an ordered subset of any `OrdList`\nsubEmpty : Sub [] xs\nsubEmpty {xs} = subEmpty' xs\n\nimplementation Uninhabited (Sub (x::xs) []) where\n uninhabited Empty impossible\n uninhabited (Skip _) impossible\n uninhabited (Keep _) impossible\n\n||| A `OrdList` is an ordered subset of itself\nsubRefl' : (xs : OrdList k v o) -> Sub xs xs\nsubRefl' [] = Empty\nsubRefl' (x :: xs) = Keep (subRefl' xs)\n\n||| A `OrdList` is an ordered subset of itself\nsubRefl : Sub xs xs\nsubRefl {xs} = subRefl' xs\n\nfreshInSub : Sub xs ys -> Fresh l ys -> Fresh l xs\nfreshInSub Empty fresh = fresh\nfreshInSub (Skip sub) (f :: fresh) = freshInSub sub fresh\nfreshInSub (Keep sub) (f :: fresh) = f :: freshInSub sub fresh\n\n||| If the original vector doesn't contain any duplicate,\n||| an orderred subset doesn't contain duplicate as well\nisNubFromSub : Sub xs ys -> Nub ys -> Nub xs\nisNubFromSub Empty y = y\nisNubFromSub (Skip sub) (yes :: prf) = isNubFromSub sub prf\nisNubFromSub (Keep sub) (yes :: prf) =\n freshInSub sub yes :: isNubFromSub sub prf\n\n%hint\nrowFromSub : Sub xs ys -> OrdRow key ty xs -> OrdRow key ty ys\nrowFromSub Empty lbl = lbl\nrowFromSub (Skip sub) loc = There (rowFromSub sub loc)\nrowFromSub (Keep sub) Here = Here\nrowFromSub (Keep sub) (There later) = There (rowFromSub sub later)\n\n\n||| Given the proof that a Label is in an subset of a vect\n||| provide a proof that this label is in the initial vect\n%hint\nlabelFromSub : Sub xs ys -> OrdLabel x xs -> OrdLabel x ys\nlabelFromSub Empty y = y\nlabelFromSub (Skip z) loc = There (labelFromSub z loc)\nlabelFromSub (Keep _) Here = Here\nlabelFromSub (Keep sub) (There later) = There (labelFromSub sub later)\n", "meta": {"hexsha": "b4ef8a83a5b26040b63c35787605ac78509d09e8", "size": 2531, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/Flexidisc/OrdList/Sub.idr", "max_stars_repo_name": "berewt/flexidisc", "max_stars_repo_head_hexsha": "8a0c367244229be5d417c04588d8d41b6030dba2", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 4, "max_stars_repo_stars_event_min_datetime": "2020-04-02T09:51:01.000Z", "max_stars_repo_stars_event_max_datetime": "2020-04-03T05:15:49.000Z", "max_issues_repo_path": "src/Flexidisc/OrdList/Sub.idr", "max_issues_repo_name": "LIST-LUXEMBOURG/flexidisc", "max_issues_repo_head_hexsha": "f5a9cdc81554359e324b64400d8479494cd45a8c", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/Flexidisc/OrdList/Sub.idr", "max_forks_repo_name": "LIST-LUXEMBOURG/flexidisc", "max_forks_repo_head_hexsha": "f5a9cdc81554359e324b64400d8479494cd45a8c", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 32.8701298701, "max_line_length": 78, "alphanum_fraction": 0.7040695377, "num_tokens": 801, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6334102636778401, "lm_q2_score": 0.5621765008857981, "lm_q1q2_score": 0.35608836565955887}} {"text": "module Imp\n\nimport Expr\nimport Logic\nimport Maps\n\n%access public export\n\n%default total\n\ndata Com : Type where\n CSkip : Com\n CAss : Id -> AExp -> Com\n CSeq : Com -> Com -> Com\n CIf : BExp -> Com -> Com -> Com\n CIf1 : BExp -> Com -> Com\n CWhile : BExp -> Com -> Com\n CFor : Com -> BExp -> Com -> Com -> Com\n CRepeat : Com -> BExp -> Com\n\ninfix 5 ::=\n\nSKIP : Com\nSKIP = CSkip\n\n(::=) : Id -> AExp -> Com\n(::=) = CAss\n\n(>>=) : Com -> (() -> Com) -> Com\n(>>=) c f = CSeq c (f ())\n\nWHILE : BExp -> Com -> Com\nWHILE = CWhile\n\nsyntax IFB [b] THEN [c1] ELSE [c2] FI = CIf b c1 c2\n\nsyntax IF1 [b] THEN [c] FI = CIf1 b c\n\nsyntax FOR [init] \";\" [cond] \";\" [updt] DO [body] DONE = CFor init cond updt body\n\nsyntax REPEAT [c] UNTIL [b] END = CRepeat c b\n\ndata CEval : Com -> State -> State -> Type where\n E_Skip : CEval CSkip st st\n E_Ass : aeval st a1 = n -> CEval (CAss x a1) st (t_update x n st)\n E_Seq : CEval c1 st1 st2 -> CEval c2 st2 st3 ->\n CEval (CSeq c1 c2) st1 st3\n E_IfTrue : beval st b = True -> CEval c1 st st1 ->\n CEval (CIf b c1 c2) st st1\n E_IfFalse : beval st b = False -> CEval c2 st st1 ->\n CEval (CIf b c1 c2) st st1\n E_If1True : beval st b = True -> CEval c st st1 ->\n CEval (CIf1 b c) st st1\n E_If1False : beval st b = False -> CEval (CIf1 b c) st st\n E_WhileEnd : beval st b = False -> CEval (CWhile b c) st st\n E_WhileLoop : beval st b = True ->\n CEval c st st1 -> CEval (CWhile b c) st1 st2 ->\n CEval (CWhile b c) st st2\n E_For : CEval init st1 st2 ->\n CEval (CWhile cond (CSeq body updt)) st2 st3 ->\n CEval (CFor init cond updt body) st1 st3\n E_Repeat : CEval c st st1 ->\n CEval (CWhile (not b) c) st1 st2 ->\n CEval (CRepeat c b) st st2\n\nsyntax [c1] \"/\" [st1] \"\\\\\\\\\" [st2] = CEval c1 st1 st2\n\nrepeat_example_1 : CEval (REPEAT do\n X ::= 1\n Y ::= Y + 1\n UNTIL X == 1 END)\n Expr.empty_state\n (t_update Y 1 (t_update X 1 Expr.empty_state))\nrepeat_example_1 = E_Repeat (E_Seq (E_Ass Refl)\n (E_Ass Refl))\n (E_WhileEnd Refl)\n\nceval_deterministic : (c / st \\\\ st1) -> (c / st \\\\ st2) -> st1 = st2\nceval_deterministic E_Skip E_Skip = Refl\nceval_deterministic (E_Ass aev1) (E_Ass aev2) =\n rewrite sym aev1\n in rewrite sym aev2\n in Refl\nceval_deterministic {st2} (E_Seq cev11 cev12) (E_Seq {c2} cev21 cev22) =\n let ih = ceval_deterministic cev11 cev21\n cev22' = replace (sym ih) cev22 {P=\\x=>CEval c2 x st2}\n in ceval_deterministic cev12 cev22'\nceval_deterministic (E_IfTrue _ cev1) (E_IfTrue _ cev2) =\n ceval_deterministic cev1 cev2\nceval_deterministic (E_IfTrue prf1 _) (E_IfFalse prf2 _) =\n absurd $ replace prf1 prf2 {P=\\x=>x=False}\nceval_deterministic (E_IfFalse prf1 _) (E_IfTrue prf2 _) =\n absurd $ replace prf2 prf1 {P=\\x=>x=False}\nceval_deterministic (E_IfFalse _ cev1) (E_IfFalse _ cev2) =\n ceval_deterministic cev1 cev2\nceval_deterministic (E_If1True _ cc1) (E_If1True _ cc2) =\n ceval_deterministic cc1 cc2\nceval_deterministic (E_If1True prf1 _) (E_If1False prf2) =\n absurd $ trans (sym prf1) prf2\nceval_deterministic (E_If1False prf1) (E_If1True prf2 _) =\n absurd $ trans (sym prf1) prf2\nceval_deterministic (E_If1False _) (E_If1False _) = Refl\nceval_deterministic (E_WhileEnd _) (E_WhileEnd _) = Refl\nceval_deterministic (E_WhileEnd prf1) (E_WhileLoop prf2 _ _) =\n absurd $ replace prf2 prf1 {P=\\x=>x=False}\nceval_deterministic (E_WhileLoop prf1 _ _) (E_WhileEnd prf2) =\n absurd $ replace prf1 prf2 {P=\\x=>x=False}\nceval_deterministic {st2} (E_WhileLoop _ cev11 cev12)\n (E_WhileLoop {b} {c} _ cev21 cev22) =\n let ih = ceval_deterministic cev11 cev21\n cev22' = replace (sym ih) cev22 {P=\\x=>CEval (CWhile b c) x st2}\n in ceval_deterministic cev12 cev22'\nceval_deterministic {st2}\n (E_For cinit1 cwhile1)\n (E_For {cond} {body} {updt} cinit2 cwhile2) =\n let ih = ceval_deterministic cinit1 cinit2\n cwhile2' = replace {P=\\x => CEval (CWhile cond (CSeq body updt)) x st2}\n (sym ih) cwhile2\n in ceval_deterministic cwhile1 cwhile2'\nceval_deterministic (E_Repeat cc1 cwhile1) (E_Repeat {b} {c} {st2} cc2 cwhile2) =\n let ih = ceval_deterministic cc1 cc2\n cwhile2' = replace {P=\\x => CEval (CWhile (not b) c) x st2}\n (sym ih) cwhile2\n in ceval_deterministic cwhile1 cwhile2'\n", "meta": {"hexsha": "1a1965ea13eae43b222ff983c415c8140143bb42", "size": 4558, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Imp.idr", "max_stars_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_stars_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "Imp.idr", "max_issues_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_issues_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Imp.idr", "max_forks_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_forks_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 36.464, "max_line_length": 81, "alphanum_fraction": 0.6105748135, "num_tokens": 1693, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6370307806984444, "lm_q2_score": 0.5583269943353745, "lm_q1q2_score": 0.35567148108647956}} {"text": "||| A telescope is the variable context in a dependently typed program.\n||| Dependent types with free varialbes are really only well-defined in a telescope.\n|||\n||| A segment of a telescope is a tuple of types in that\n||| telescope. These are usually implicit in formal developments, but\n||| seem to be crucial to get a compositional account. Here we use\n||| them to get 'n-ary dependent function' (compare with `Data.Fun`\n||| and `Data.Rel`).\n|||\n||| I've learned this from Conor McBride on an SPLV'19 bus ride.\n||| A literary reference would be welcome. This paper is a start:\n||| Unifiers as Equivalences: Proof-Relevant Unification of Dependently Typed Data.\n||| Jesper Cockx, Dominique Devriese, Frank Piessens, ICFP'16.\n||| but they don't seem to have segments and their left action on contexts.\nmodule Data.Telescope\n\nimport public Data.Telescope.Telescope\nimport public Data.Telescope.Segment\nimport public Data.Telescope.SimpleFun\nimport public Data.Telescope.Fun\nimport public Data.Telescope.Congruence\n", "meta": {"hexsha": "397106e34b3ed4b6492b56844edbca1fc6fc7abd", "size": 1014, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "libs/contrib/Data/Telescope.idr", "max_stars_repo_name": "ska80/idris-jvm", "max_stars_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 396, "max_stars_repo_stars_event_min_datetime": "2016-07-17T08:00:45.000Z", "max_stars_repo_stars_event_max_datetime": "2022-02-21T22:47:13.000Z", "max_issues_repo_path": "libs/contrib/Data/Telescope.idr", "max_issues_repo_name": "ska80/idris-jvm", "max_issues_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 54, "max_issues_repo_issues_event_min_datetime": "2016-08-04T06:13:36.000Z", "max_issues_repo_issues_event_max_datetime": "2022-01-03T04:00:31.000Z", "max_forks_repo_path": "libs/contrib/Data/Telescope.idr", "max_forks_repo_name": "ska80/idris-jvm", "max_forks_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 28, "max_forks_repo_forks_event_min_datetime": "2016-09-15T15:19:03.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-27T13:05:48.000Z", "avg_line_length": 46.0909090909, "max_line_length": 85, "alphanum_fraction": 0.7662721893, "num_tokens": 255, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.6150878555160664, "lm_q2_score": 0.5774953651858118, "lm_q1q2_score": 0.3552103857426086}} {"text": "-- Printf.idr\n-- A C-style printf function, demonstarting\n-- variable function arguments\n\n\nmodule Printf\n\nexport\ndata Format = Num Format\n | Chr Format\n | Dbl Format\n | Str Format\n | Lit String Format\n | End\n\n%name Format fmt\n\nexport\nPrintfType : Format -> Type\nPrintfType (Num fmt) = (i : Int) -> PrintfType fmt\nPrintfType (Chr fmt) = (c : Char) -> PrintfType fmt\nPrintfType (Dbl fmt) = (f : Double) -> PrintfType fmt\nPrintfType (Str fmt) = (str : String) -> PrintfType fmt\nPrintfType (Lit str fmt) = PrintfType fmt\nPrintfType End = String\n\n\n||| Generates a string from the given format spec\nexport\nprintfFmt : (fmt : Format) -> (acc : String) -> PrintfType fmt\nprintfFmt (Num fmt) acc = \\i => printfFmt fmt (acc ++ (show i))\nprintfFmt (Chr fmt) acc = \\c => printfFmt fmt (acc ++ (show c))\nprintfFmt (Dbl fmt) acc = \\f => printfFmt fmt (acc ++ (show f))\nprintfFmt (Str fmt) acc = \\str => printfFmt fmt (acc ++ str)\nprintfFmt (Lit str fmt) acc = printfFmt fmt (acc ++ str)\nprintfFmt End acc = acc\n\n||| Convert given char list to format data type\nexport\ntoFormat : (xs : List Char) -> Format\ntoFormat [] = End\ntoFormat ('%' :: 'd' :: chars) = Num (toFormat chars)\ntoFormat ('%' :: 'c' :: chars) = Chr (toFormat chars)\ntoFormat ('%' :: 'f' :: chars) = Dbl (toFormat chars)\ntoFormat ('%' :: 's' :: chars) = Str (toFormat chars)\ntoFormat ('%' :: chars) = Lit \"%\" (toFormat chars)\ntoFormat (c :: chars) = case toFormat chars of\n (Lit lit chars') => Lit (strCons c lit) chars'\n fmt => Lit (strCons c \"\") fmt\n\n||| Outputs the given format string as String\n||| @fmt Format specification\nexport\nprintf : (fmt : String) -> PrintfType (toFormat (unpack fmt))\nprintf fmt = printfFmt _ \"\"\n\n\n\n", "meta": {"hexsha": "c1336cedc351980bd3f4f051985b6ce00a686bfd", "size": 1790, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Idris/TDD/Chapter_6/Printf.idr", "max_stars_repo_name": "kkirstein/proglang-playground", "max_stars_repo_head_hexsha": "d00be09ba2bb2351c6f5287cc4d93fcaf21f75fd", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "Idris/TDD/Chapter_6/Printf.idr", "max_issues_repo_name": "kkirstein/proglang-playground", "max_issues_repo_head_hexsha": "d00be09ba2bb2351c6f5287cc4d93fcaf21f75fd", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Idris/TDD/Chapter_6/Printf.idr", "max_forks_repo_name": "kkirstein/proglang-playground", "max_forks_repo_head_hexsha": "d00be09ba2bb2351c6f5287cc4d93fcaf21f75fd", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 30.3389830508, "max_line_length": 75, "alphanum_fraction": 0.6189944134, "num_tokens": 501, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.5736784074525096, "lm_q2_score": 0.6187804337438501, "lm_q1q2_score": 0.3549809737929451}} {"text": "module LightClick.Types.Direction\n\nimport Decidable.Equality\n\nimport Toolkit.Decidable.Informative\n\n%default total\n\npublic export\ndata Direction = IN | OUT | INOUT\n\nexport\nShow Direction where\n show IN = \"IN\"\n show OUT = \"OUT\"\n show INOUT = \"INOUT\"\n\ninNotOut : (IN = OUT) -> Void\ninNotOut Refl impossible\n\ninNotInOut : (IN = INOUT) -> Void\ninNotInOut Refl impossible\n\noutNotInOut : (OUT = INOUT) -> Void\noutNotInOut Refl impossible\n\nexport\nDecEq Direction where\n decEq IN IN = Yes Refl\n decEq IN OUT = No inNotOut\n decEq IN INOUT = No inNotInOut\n\n decEq OUT IN = No (negEqSym inNotOut)\n decEq OUT OUT = Yes Refl\n decEq OUT INOUT = No outNotInOut\n\n decEq INOUT IN = No (negEqSym inNotInOut)\n decEq INOUT OUT = No (negEqSym outNotInOut)\n decEq INOUT INOUT = Yes Refl\n\nnamespace Valid\n\n public export\n data Valid : (src,dest : Direction) -> Type where\n VOI : Valid OUT IN\n VBI : Valid INOUT IN\n VOB : Valid OUT INOUT\n VBB : Valid INOUT INOUT\n\n dirIsLR : Valid IN dest -> Void\n dirIsLR VOI impossible\n dirIsLR VBI impossible\n dirIsLR VOB impossible\n dirIsLR VBB impossible\n\n dirAreSame : Valid OUT OUT -> Void\n dirAreSame VOI impossible\n dirAreSame VBI impossible\n dirAreSame VOB impossible\n dirAreSame VBB impossible\n\n dirIsLR' : Valid INOUT OUT -> Void\n dirIsLR' VOI impossible\n dirIsLR' VBI impossible\n dirIsLR' VOB impossible\n dirIsLR' VBB impossible\n\n public export\n data Error = InputCannotSend | DirIsSame | OutputCannotReceive\n\n\n export\n valid : (src, dest : Direction)\n -> DecInfo Direction.Valid.Error (Valid src dest)\n valid IN dest = No InputCannotSend dirIsLR\n valid OUT dest with (dest)\n valid OUT dest | IN = Yes VOI\n valid OUT dest | OUT = No DirIsSame dirAreSame\n valid OUT dest | INOUT = Yes VOB\n\n valid INOUT dest with (dest)\n valid INOUT dest | IN = Yes VBI\n valid INOUT dest | OUT = No OutputCannotReceive (dirIsLR')\n valid INOUT dest | INOUT = Yes VBB\n\n\nnamespace Safe\n\n public export\n data Safe : (src,dest : Direction) -> Type where\n SOI : Safe OUT IN\n SBI : Safe INOUT IN\n SBB : Safe INOUT INOUT\n\n safeDirCannotIn : Safe IN dest -> Void\n safeDirCannotIn SOI impossible\n safeDirCannotIn SBI impossible\n safeDirCannotIn SBB impossible\n\n safeDirNotOO : Safe OUT OUT -> Void\n safeDirNotOO SOI impossible\n safeDirNotOO SBI impossible\n safeDirNotOO SBB impossible\n\n safeDirNoFeedbackOO : Safe OUT INOUT -> Void\n safeDirNoFeedbackOO SOI impossible\n safeDirNoFeedbackOO SBI impossible\n safeDirNoFeedbackOO SBB impossible\n\n safeDirNoFeedbackBO : Safe INOUT OUT -> Void\n safeDirNoFeedbackBO SOI impossible\n safeDirNoFeedbackBO SBI impossible\n safeDirNoFeedbackBO SBB impossible\n\n public export\n data Error = VCError Direction.Valid.Error\n | PossibleFeedbackFromReceiver\n | PossibleFeedbackFromSender\n\n export\n safe : (src, dest : Direction) -> DecInfo Direction.Safe.Error (Safe src dest)\n safe IN dest = No (VCError InputCannotSend) safeDirCannotIn\n safe OUT dest with (dest)\n safe OUT dest | IN = Yes SOI\n safe OUT dest | OUT = No (VCError DirIsSame) safeDirNotOO\n safe OUT dest | INOUT = No PossibleFeedbackFromReceiver safeDirNoFeedbackOO\n\n safe INOUT dest with (dest)\n safe INOUT dest | IN = Yes SBI\n safe INOUT dest | OUT = No PossibleFeedbackFromSender safeDirNoFeedbackBO\n safe INOUT dest | INOUT = Yes SBB\n", "meta": {"hexsha": "694fd703c859b95b1cfffec9002add52847a3db2", "size": 3393, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/LightClick/Types/Direction.idr", "max_stars_repo_name": "border-patrol/lightclick", "max_stars_repo_head_hexsha": "1f52fc27674f244c399e5e579403e8075f982a37", "max_stars_repo_licenses": ["BSD-3-Clause-Clear"], "max_stars_count": 9, "max_stars_repo_stars_event_min_datetime": "2020-11-03T11:33:57.000Z", "max_stars_repo_stars_event_max_datetime": "2021-11-14T17:11:38.000Z", "max_issues_repo_path": "src/LightClick/Types/Direction.idr", "max_issues_repo_name": "border-patrol/lightclick", "max_issues_repo_head_hexsha": "1f52fc27674f244c399e5e579403e8075f982a37", "max_issues_repo_licenses": ["BSD-3-Clause-Clear"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "src/LightClick/Types/Direction.idr", "max_forks_repo_name": "border-patrol/lightclick", "max_forks_repo_head_hexsha": "1f52fc27674f244c399e5e579403e8075f982a37", "max_forks_repo_licenses": ["BSD-3-Clause-Clear"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 25.7045454545, "max_line_length": 80, "alphanum_fraction": 0.7229590333, "num_tokens": 993, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6825737473266735, "lm_q2_score": 0.519521321952093, "lm_q1q2_score": 0.35461161554094733}} {"text": "module Data.SortedMap\n\nimport Data.Nat\n\n-- TODO: write split\n\nprivate\ndata Tree : Nat -> (k : Type) -> Type -> Ord k -> Type where\n Leaf : k -> v -> Tree Z k v o\n Branch2 : Tree n k v o -> k -> Tree n k v o -> Tree (S n) k v o\n Branch3 : Tree n k v o -> k -> Tree n k v o -> k -> Tree n k v o -> Tree (S n) k v o\n\nbranch4 :\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o ->\n Tree (S (S n)) k v o\nbranch4 a b c d e f g =\n Branch2 (Branch2 a b c) d (Branch2 e f g)\n\nbranch5 :\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o ->\n Tree (S (S n)) k v o\nbranch5 a b c d e f g h i =\n Branch2 (Branch2 a b c) d (Branch3 e f g h i)\n\nbranch6 :\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o ->\n Tree (S (S n)) k v o\nbranch6 a b c d e f g h i j k =\n Branch3 (Branch2 a b c) d (Branch2 e f g) h (Branch2 i j k)\n\nbranch7 :\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o -> k ->\n Tree n k v o ->\n Tree (S (S n)) k v o\nbranch7 a b c d e f g h i j k l m =\n Branch3 (Branch3 a b c d e) f (Branch2 g h i) j (Branch2 k l m)\n\nmerge1 : Tree n k v o -> k -> Tree (S n) k v o -> k -> Tree (S n) k v o -> Tree (S (S n)) k v o\nmerge1 a b (Branch2 c d e) f (Branch2 g h i) = branch5 a b c d e f g h i\nmerge1 a b (Branch2 c d e) f (Branch3 g h i j k) = branch6 a b c d e f g h i j k\nmerge1 a b (Branch3 c d e f g) h (Branch2 i j k) = branch6 a b c d e f g h i j k\nmerge1 a b (Branch3 c d e f g) h (Branch3 i j k l m) = branch7 a b c d e f g h i j k l m\n\nmerge2 : Tree (S n) k v o -> k -> Tree n k v o -> k -> Tree (S n) k v o -> Tree (S (S n)) k v o\nmerge2 (Branch2 a b c) d e f (Branch2 g h i) = branch5 a b c d e f g h i\nmerge2 (Branch2 a b c) d e f (Branch3 g h i j k) = branch6 a b c d e f g h i j k\nmerge2 (Branch3 a b c d e) f g h (Branch2 i j k) = branch6 a b c d e f g h i j k\nmerge2 (Branch3 a b c d e) f g h (Branch3 i j k l m) = branch7 a b c d e f g h i j k l m\n\nmerge3 : Tree (S n) k v o -> k -> Tree (S n) k v o -> k -> Tree n k v o -> Tree (S (S n)) k v o\nmerge3 (Branch2 a b c) d (Branch2 e f g) h i = branch5 a b c d e f g h i\nmerge3 (Branch2 a b c) d (Branch3 e f g h i) j k = branch6 a b c d e f g h i j k\nmerge3 (Branch3 a b c d e) f (Branch2 g h i) j k = branch6 a b c d e f g h i j k\nmerge3 (Branch3 a b c d e) f (Branch3 g h i j k) l m = branch7 a b c d e f g h i j k l m\n\ntreeLookup : (Ord k) => k -> Tree n k v o -> Maybe v\ntreeLookup k (Leaf k' v) =\n if k == k'\n then Just v\n else Nothing\ntreeLookup k (Branch2 t1 k' t2) =\n if k <= k' then\n treeLookup k t1\n else\n treeLookup k t2\ntreeLookup k (Branch3 t1 k1 t2 k2 t3) =\n if k <= k1 then\n treeLookup k t1\n else if k <= k2 then\n treeLookup k t2\n else\n treeLookup k t3\n\ntreeInsert' : (Ord k) => k -> v -> Tree n k v o -> Either (Tree n k v o) (Tree n k v o, k, Tree n k v o)\ntreeInsert' k v (Leaf k' v') =\n case compare k k' of\n LT => Right (Leaf k v, k, Leaf k' v')\n EQ => Left (Leaf k v)\n GT => Right (Leaf k' v', k', Leaf k v)\ntreeInsert' k v (Branch2 t1 k' t2) =\n if k <= k' then\n case treeInsert' k v t1 of\n Left t1' => Left (Branch2 t1' k' t2)\n Right (a, b, c) => Left (Branch3 a b c k' t2)\n else\n case treeInsert' k v t2 of\n Left t2' => Left (Branch2 t1 k' t2')\n Right (a, b, c) => Left (Branch3 t1 k' a b c)\ntreeInsert' k v (Branch3 t1 k1 t2 k2 t3) =\n if k <= k1 then\n case treeInsert' k v t1 of\n Left t1' => Left (Branch3 t1' k1 t2 k2 t3)\n Right (a, b, c) => Right (Branch2 a b c, k1, Branch2 t2 k2 t3)\n else\n if k <= k2 then\n case treeInsert' k v t2 of\n Left t2' => Left (Branch3 t1 k1 t2' k2 t3)\n Right (a, b, c) => Right (Branch2 t1 k1 a, b, Branch2 c k2 t3)\n else\n case treeInsert' k v t3 of\n Left t3' => Left (Branch3 t1 k1 t2 k2 t3')\n Right (a, b, c) => Right (Branch2 t1 k1 t2, k2, Branch2 a b c)\n\ntreeInsert : (Ord k) => k -> v -> Tree n k v o -> Either (Tree n k v o) (Tree (S n) k v o)\ntreeInsert k v t =\n case treeInsert' k v t of\n Left t' => Left t'\n Right (a, b, c) => Right (Branch2 a b c)\n\ndelType : Nat -> (k : Type) -> Type -> Ord k -> Type\ndelType Z k v o = ()\ndelType (S n) k v o = Tree n k v o\n\ntreeDelete : (Ord k) => {n : Nat} -> k -> Tree n k v o -> Either (Tree n k v o) (delType n k v o)\ntreeDelete k (Leaf k' v) =\n if k == k' then\n Right ()\n else\n Left (Leaf k' v)\ntreeDelete {n=S Z} k (Branch2 t1 k' t2) =\n if k <= k' then\n case treeDelete k t1 of\n Left t1' => Left (Branch2 t1' k' t2)\n Right () => Right t2\n else\n case treeDelete k t2 of\n Left t2' => Left (Branch2 t1 k' t2')\n Right () => Right t1\ntreeDelete {n=S Z} k (Branch3 t1 k1 t2 k2 t3) =\n if k <= k1 then\n case treeDelete k t1 of\n Left t1' => Left (Branch3 t1' k1 t2 k2 t3)\n Right () => Left (Branch2 t2 k2 t3)\n else if k <= k2 then\n case treeDelete k t2 of\n Left t2' => Left (Branch3 t1 k1 t2' k2 t3)\n Right () => Left (Branch2 t1 k1 t3)\n else\n case treeDelete k t3 of\n Left t3' => Left (Branch3 t1 k1 t2 k2 t3')\n Right () => Left (Branch2 t1 k1 t2)\ntreeDelete {n=S (S _)} k (Branch2 t1 k' t2) =\n if k <= k' then\n case treeDelete k t1 of\n Left t1' => Left (Branch2 t1' k' t2)\n Right t1' =>\n case t2 of\n Branch2 a b c => Right (Branch3 t1' k' a b c)\n Branch3 a b c d e => Left (branch4 t1' k' a b c d e)\n else\n case treeDelete k t2 of\n Left t2' => Left (Branch2 t1 k' t2')\n Right t2' =>\n case t1 of\n Branch2 a b c => Right (Branch3 a b c k' t2')\n Branch3 a b c d e => Left (branch4 a b c d e k' t2')\ntreeDelete {n=(S (S _))} k (Branch3 t1 k1 t2 k2 t3) =\n if k <= k1 then\n case treeDelete k t1 of\n Left t1' => Left (Branch3 t1' k1 t2 k2 t3)\n Right t1' => Left (merge1 t1' k1 t2 k2 t3)\n else if k <= k2 then\n case treeDelete k t2 of\n Left t2' => Left (Branch3 t1 k1 t2' k2 t3)\n Right t2' => Left (merge2 t1 k1 t2' k2 t3)\n else\n case treeDelete k t3 of\n Left t3' => Left (Branch3 t1 k1 t2 k2 t3')\n Right t3' => Left (merge3 t1 k1 t2 k2 t3')\n\ntreeToList : {n: Nat} -> Tree n k v o -> List (k, v)\ntreeToList = treeToList' (:: [])\n where\n treeToList' : ((k, v) -> List (k, v)) -> {n: Nat} -> Tree n k v o -> List (k, v)\n treeToList' cont {n = Z} (Leaf k v) = cont (k, v)\n treeToList' cont (Branch2 t1 _ t2) = treeToList' (:: treeToList' cont t2) t1\n treeToList' cont (Branch3 t1 _ t2 _ t3) = treeToList' (:: treeToList' (:: treeToList' cont t3) t2) t1\n\npublic export\ndata SortedMap : Type -> Type -> Type where\n Empty : Ord k => SortedMap k v\n M : (o : Ord k) => (n:Nat) -> Tree n k v o -> SortedMap k v\n\nexport\nempty : Ord k => SortedMap k v\nempty = Empty\n\nexport\nlookup : k -> SortedMap k v -> Maybe v\nlookup _ Empty = Nothing\nlookup k (M _ t) = treeLookup k t\n\nexport\ninsert : k -> v -> SortedMap k v -> SortedMap k v\ninsert k v Empty = M Z (Leaf k v)\ninsert k v (M _ t) =\n case treeInsert k v t of\n Left t' => (M _ t')\n Right t' => (M _ t')\n\nexport\ninsertFrom : Foldable f => f (k, v) -> SortedMap k v -> SortedMap k v\ninsertFrom = flip $ foldl $ flip $ uncurry insert\n\nexport\ndelete : k -> SortedMap k v -> SortedMap k v\ndelete _ Empty = Empty\ndelete k (M Z t) =\n case treeDelete k t of\n Left t' => (M _ t')\n Right () => Empty\ndelete k (M (S _) t) =\n case treeDelete k t of\n Left t' => (M _ t')\n Right t' => (M _ t')\n\nexport\nfromList : Ord k => List (k, v) -> SortedMap k v\nfromList l = foldl (flip (uncurry insert)) empty l\n\nexport\ntoList : SortedMap k v -> List (k, v)\ntoList Empty = []\ntoList (M _ t) = treeToList t\n\n||| Gets the keys of the map.\nexport\nkeys : SortedMap k v -> List k\nkeys = map fst . toList\n\n||| Gets the values of the map. Could contain duplicates.\nexport\nvalues : SortedMap k v -> List v\nvalues = map snd . toList\n\nexport\nnull : SortedMap k v -> Bool\nnull Empty = True\nnull (M _ _) = False\n\ntreeMap : (a -> b) -> Tree n k a o -> Tree n k b o\ntreeMap f (Leaf k v) = Leaf k (f v)\ntreeMap f (Branch2 t1 k t2) = Branch2 (treeMap f t1) k (treeMap f t2)\ntreeMap f (Branch3 t1 k1 t2 k2 t3)\n = Branch3 (treeMap f t1) k1 (treeMap f t2) k2 (treeMap f t3)\n\nexport\nimplementation Functor (SortedMap k) where\n map _ Empty = Empty\n map f (M n t) = M _ (treeMap f t)\n\n||| Merge two maps. When encountering duplicate keys, using a function to combine the values.\n||| Uses the ordering of the first map given.\nexport\nmergeWith : (v -> v -> v) -> SortedMap k v -> SortedMap k v -> SortedMap k v\nmergeWith f x y = insertFrom inserted x where\n inserted : List (k, v)\n inserted = do\n (k, v) <- toList y\n let v' = (maybe id f $ lookup k x) v\n pure (k, v')\n\n||| Merge two maps using the Semigroup (and by extension, Monoid) operation.\n||| Uses mergeWith internally, so the ordering of the left map is kept.\nexport\nmerge : Semigroup v => SortedMap k v -> SortedMap k v -> SortedMap k v\nmerge = mergeWith (<+>)\n\n||| Left-biased merge, also keeps the ordering specified by the left map.\nexport\nmergeLeft : SortedMap k v -> SortedMap k v -> SortedMap k v\nmergeLeft = mergeWith const\n\nexport\n(Show k, Show v) => Show (SortedMap k v) where\n show m = \"fromList \" ++ (show $ toList m)\n\n-- TODO: is this the right variant of merge to use for this? I think it is, but\n-- I could also see the advantages of using `mergeLeft`. The current approach is\n-- strictly more powerful I believe, because `mergeLeft` can be emulated with\n-- the `First` monoid. However, this does require more code to do the same\n-- thing.\nexport\nSemigroup v => Semigroup (SortedMap k v) where\n (<+>) = merge\n\n||| For `neutral <+> y`, y is rebuilt in `Ord k`, so this is not a \"strict\" Monoid.\n||| However, semantically, it should be equal.\nexport\n(Ord k, Semigroup v) => Monoid (SortedMap k v) where\n neutral = empty\n", "meta": {"hexsha": "736e92b42bf5c976aee63da98df707be3cad26b4", "size": 9972, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "bautzen1945/idris/Data/SortedMap.idr", "max_stars_repo_name": "steshaw/hsgames", "max_stars_repo_head_hexsha": "4cf8cd02fcc93d1e030144676e2e1cbf9da2514f", "max_stars_repo_licenses": ["Apache-2.0"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "bautzen1945/idris/Data/SortedMap.idr", "max_issues_repo_name": "steshaw/hsgames", "max_issues_repo_head_hexsha": "4cf8cd02fcc93d1e030144676e2e1cbf9da2514f", "max_issues_repo_licenses": ["Apache-2.0"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "bautzen1945/idris/Data/SortedMap.idr", "max_forks_repo_name": "steshaw/hsgames", "max_forks_repo_head_hexsha": "4cf8cd02fcc93d1e030144676e2e1cbf9da2514f", "max_forks_repo_licenses": ["Apache-2.0"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 32.2718446602, "max_line_length": 105, "alphanum_fraction": 0.5823305255, "num_tokens": 3728, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6619228758499942, "lm_q2_score": 0.5350984286266115, "lm_q1q2_score": 0.35419389073933955}} {"text": "--\n-- Primitive casts: Specification\n--\n-- a. Unsigned integers\n--\n-- Unsigned integers with a precision of x bit have a valid\n-- range of [0,2^x - 1]. When casting from another integral type of value y,\n-- the value is checked for being in bounds, and if it is not, the\n-- unsigned remainder modulo 2^x of y is returned.\n--\n-- When casting from a `Double`, the value is first truncated towards 0,\n-- before applying the inbounds check and (if necessary) calculating\n-- the unsigned remainder modulo 2^x.\n--\n-- When casting from a `String`, the value is first converted to a floating\n-- point number by the backend and then truncated as described above.\n--\n-- Example: For `Bits8` the valid range is [0,255]. Below are some\n-- example casts.\n--\n-- cast {from = Integer} {to = Bits8} 12 = 12\n-- cast {from = Integer} {to = Bits8} 256 = 0\n-- cast {from = Integer} {to = Bits8} 259 = 3\n-- cast {from = Integer} {to = Bits8} (-2) = 254\n-- cast {from = Double} {to = Bits8} (-12.001) = 244\n-- cast {from = Double} {to = Bits8} (\"-12.001\") = 244\n--\n-- b. Signed integers\n--\n-- Signed integers with a precision of x bit have a valid\n-- range of [-2^(x-1),2^(x-1) - 1]. When casting from another\n-- integral type of value y, the unsigned remainder module 2^x\n-- is calculated. If the result is >= 2^(x-1), 2^x is subtracted\n-- from the result. This is the same behavior as for instance in Haskell.\n--\n-- When casting from a `Double`, the value is first truncated towards 0,\n-- before applying the inbounds check and (if necessary) truncating\n-- the value.\n--\n-- When casting from a `String`, the value is first converted to a floating\n-- point number by the backend and then truncated as described above.\n--\n-- Example: For `Int8` the valid range is [-128,127]. Below are some\n-- example casts.\n--\n-- cast {from = Integer} {to = Int8} 12 = 12\n-- cast {from = Integer} {to = Int8} 256 = 0\n-- cast {from = Integer} {to = Int8} 259 = 4\n-- cast {from = Integer} {to = Int8} (-128) = (-128)\n-- cast {from = Integer} {to = Int8} (-129) = 127\n-- cast {from = Double} {to = Int8} (-12.001) = (-12)\n-- cast {from = Double} {to = Int8} (\"-12.001\") = (-12)\n--\n-- c. Characters\n--\n-- Casts from all integral types to `Char` are supported. Note however,\n-- that only casts in the non-surrogate range are supported, that is\n-- values in the ranges [0,0xd7ff] and [0xe000,0x10ffff], or, in decimal\n-- notation, [0,55295] and [57344,1114111].\n--\n-- All casts from integer types to `Char` are therefore submitted to a\n-- bounds check, and, in case the value is out of bounds, are converted to `'\\0'`.\n--\n--\n-- Test all casts from and to integral types.\n-- The `Cast` implementations in here should go to `Prelude`, once\n-- a new minor version of the compiler is released.\n--\n-- These tests verify also that the full range of integer literals\n-- is supported for every integral type.\n--\n-- Nothing fancy is being done here:\n-- All test cases have been hand-written.\n\nimport Data.List\n\n--------------------------------------------------------------------------------\n-- Tests\n--------------------------------------------------------------------------------\n\nshowTpe : Type -> String\nshowTpe Bits16 = \"Bits16\"\nshowTpe Bits32 = \"Bits32\"\nshowTpe Bits64 = \"Bits64\"\nshowTpe Bits8 = \"Bits8\"\nshowTpe Char = \"Char\"\nshowTpe Double = \"Double\"\nshowTpe Int = \"Int\"\nshowTpe Int16 = \"Int16\"\nshowTpe Int32 = \"Int32\"\nshowTpe Int64 = \"Int64\"\nshowTpe Int8 = \"Int8\"\nshowTpe Integer = \"Integer\"\nshowTpe String = \"String\"\nshowTpe _ = \"unknown type\"\n\ntestCasts : (a: Type) -> (b : Type) -> (Cast a b, Show a, Show b, Eq b) =>\n List (a,b) -> List String\ntestCasts a b = mapMaybe doTest\n where doTest : (a,b) -> Maybe String\n doTest (x,y) =\n let y2 = cast {to = b} x\n in if y == y2 then Nothing\n else Just $ #\"Invalid cast from \\#{showTpe a} to \\#{showTpe b}: \"#\n ++ #\"expected \\#{show y} but got \\#{show y2} when casting from \\#{show x}\"#\n\nmaxBits8 : Bits8\nmaxBits8 = 0xff\n\nmaxBits16 : Bits16\nmaxBits16 = 0xffff\n\nmaxBits32 : Bits32\nmaxBits32 = 0xffffffff\n\nmaxBits64 : Bits64\nmaxBits64 = 0xffffffffffffffff\n\nresults : List String\nresults = testCasts Int8 Int16 [(-129,127),(-128,-128),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 Int32 [(-129,127),(-128,-128),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 Int64 [(-129,127),(-128,-128),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 Int [(-129,127),(-128,-128),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 Double [(-129,127),(-128,-128),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 String [(-129,\"127\"),(-128,\"-128\"),(0,\"0\"),(127,\"127\"),(128,\"-128\")]\n ++ testCasts Int8 Integer [(-129,127),(-128,-128),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 Bits8 [(-129,127),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 Bits16 [(-129,127),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 Bits32 [(-129,127),(0,0),(127,127),(128,-128)]\n ++ testCasts Int8 Bits64 [(-129,127),(0,0),(127,127),(128,-128)]\n\n ++ testCasts Int16 Int8 [(-32769,32767),(-32768,0),(0,0),(32767,-1),(32768,0)]\n ++ testCasts Int16 Int32 [(-32769,32767),(-32768,-32768),(0,0),(32767,32767),(32768,-32768)]\n ++ testCasts Int16 Int64 [(-32769,32767),(-32768,-32768),(0,0),(32767,32767),(32768,-32768)]\n ++ testCasts Int16 Int [(-32769,32767),(-32768,-32768),(0,0),(32767,32767),(32768,-32768)]\n ++ testCasts Int16 Double [(-32769,32767),(-32768,-32768),(0,0),(32767,32767),(32768,-32768)]\n ++ testCasts Int16 String [(-32769,\"32767\"),(-32768,\"-32768\"),(0,\"0\"),(32767,\"32767\"),(32768,\"-32768\")]\n ++ testCasts Int16 Integer [(-32769,32767),(-32768,-32768),(0,0),(32767,32767),(32768,-32768)]\n ++ testCasts Int16 Bits8 [(-32769,32767),(0,0),(32767,32767),(32768,-32768)]\n ++ testCasts Int16 Bits16 [(-32769,32767),(0,0),(32767,32767),(32768,-32768)]\n ++ testCasts Int16 Bits32 [(-32769,32767),(0,0),(32767,32767),(32768,-32768)]\n ++ testCasts Int16 Bits64 [(-32769,32767),(0,0),(32767,32767),(32768,-32768)]\n\n ++ testCasts Int32 Int8 [(-2147483649,2147483647),(-2147483648,0),(0,0),(2147483647,-1),(2147483648,0)]\n ++ testCasts Int32 Int16 [(-2147483649,2147483647),(-2147483648,0),(0,0),(2147483647,-1),(2147483648,0)]\n ++ testCasts Int32 Int64 [(-2147483649,2147483647),(-2147483648,-2147483648),(0,0),(2147483647,2147483647),(2147483648,-2147483648)]\n ++ testCasts Int32 Int [(-2147483649,2147483647),(-2147483648,-2147483648),(0,0),(2147483647,2147483647),(2147483648,-2147483648)]\n ++ testCasts Int32 Double [(-2147483649,2147483647),(-2147483648,-2147483648),(0,0),(2147483647,2147483647),(2147483648,-2147483648)]\n ++ testCasts Int32 String [(-2147483649,\"2147483647\"),(-2147483648,\"-2147483648\"),(0,\"0\"),(2147483647,\"2147483647\"),(2147483648,\"-2147483648\")]\n ++ testCasts Int32 Integer [(-2147483649,2147483647),(-2147483648,-2147483648),(0,0),(2147483647,2147483647),(2147483648,-2147483648)]\n ++ testCasts Int32 Bits8 [(-2147483649,2147483647),(0,0),(2147483647,2147483647),(2147483648,-2147483648)]\n ++ testCasts Int32 Bits16 [(-2147483649,2147483647),(0,0),(2147483647,2147483647),(2147483648,-2147483648)]\n ++ testCasts Int32 Bits32 [(-2147483649,2147483647),(0,0),(2147483647,2147483647),(2147483648,-2147483648)]\n ++ testCasts Int32 Bits64 [(-2147483649,2147483647),(0,0),(2147483647,2147483647),(2147483648,-2147483648)]\n\n ++ testCasts Int64 Int8 [(-9223372036854775809,9223372036854775807),(-9223372036854775808,0),(0,0),(9223372036854775807,-1),(9223372036854775808,0)]\n ++ testCasts Int64 Int16 [(-9223372036854775809,9223372036854775807),(-9223372036854775808,0),(0,0),(9223372036854775807,-1),(9223372036854775808,0)]\n ++ testCasts Int64 Int32 [(-9223372036854775809,9223372036854775807),(-9223372036854775808,0),(0,0),(9223372036854775807,-1),(9223372036854775808,0)]\n ++ testCasts Int64 Int [(-9223372036854775809,9223372036854775807),(-9223372036854775808,-9223372036854775808),(0,0),(9223372036854775807,9223372036854775807),(9223372036854775808,-9223372036854775808)]\n ++ testCasts Int64 Double [(-9223372036854775809,9223372036854775807),(-9223372036854775808,-9223372036854775808),(0,0),(9223372036854775807,9223372036854775807),(9223372036854775808,-9223372036854775808)]\n ++ testCasts Int64 String [(-9223372036854775809,\"9223372036854775807\"),(-9223372036854775808,\"-9223372036854775808\"),(0,\"0\"),(9223372036854775807,\"9223372036854775807\"),(9223372036854775808,\"-9223372036854775808\")]\n ++ testCasts Int64 Integer [(-9223372036854775809,9223372036854775807),(-9223372036854775808,-9223372036854775808),(0,0),(9223372036854775807,9223372036854775807),(9223372036854775808,-9223372036854775808)]\n ++ testCasts Int64 Bits8 [(-9223372036854775809,255),(0,0),(9223372036854775807,0xff),(9223372036854775808,0)]\n ++ testCasts Int64 Bits16 [(-9223372036854775809,65535),(0,0),(9223372036854775807,0xffff),(9223372036854775808,0)]\n ++ testCasts Int64 Bits32 [(-9223372036854775809,4294967295),(0,0),(9223372036854775807,0xffffffff),(9223372036854775808,0)]\n ++ testCasts Int64 Bits64 [(-9223372036854775809,9223372036854775807),(0,0),(9223372036854775807,9223372036854775807),(9223372036854775808,-9223372036854775808)]\n\n ++ testCasts Int Int8 [(-9223372036854775809,9223372036854775807),(-9223372036854775808,0),(0,0),(9223372036854775807,-1),(9223372036854775808,0)]\n ++ testCasts Int Int16 [(-9223372036854775809,9223372036854775807),(-9223372036854775808,0),(0,0),(9223372036854775807,-1),(9223372036854775808,0)]\n ++ testCasts Int Int32 [(-9223372036854775809,9223372036854775807),(-9223372036854775808,0),(0,0),(9223372036854775807,-1),(9223372036854775808,0)]\n ++ testCasts Int Int64 [(-9223372036854775809,9223372036854775807),(-9223372036854775808,-9223372036854775808),(0,0),(9223372036854775807,9223372036854775807),(9223372036854775808,-9223372036854775808)]\n ++ testCasts Int Double [(-9223372036854775809,9223372036854775807),(-9223372036854775808,-9223372036854775808),(0,0),(9223372036854775807,9223372036854775807),(9223372036854775808,-9223372036854775808)]\n ++ testCasts Int String [(-9223372036854775809,\"9223372036854775807\"),(-9223372036854775808,\"-9223372036854775808\"),(0,\"0\"),(9223372036854775807,\"9223372036854775807\"),(9223372036854775808,\"-9223372036854775808\")]\n ++ testCasts Int Integer [(-9223372036854775809,9223372036854775807),(-9223372036854775808,-9223372036854775808),(0,0),(9223372036854775807,9223372036854775807),(9223372036854775808,-9223372036854775808)]\n ++ testCasts Int Bits8 [(-9223372036854775809,255),(0,0),(9223372036854775807,0xff),(9223372036854775808,0)]\n ++ testCasts Int Bits16 [(-9223372036854775809,65535),(0,0),(9223372036854775807,0xffff),(9223372036854775808,0)]\n ++ testCasts Int Bits32 [(-9223372036854775809,4294967295),(0,0),(9223372036854775807,0xffffffff),(9223372036854775808,0)]\n ++ testCasts Int Bits64 [(-9223372036854775809,9223372036854775807),(0,0),(9223372036854775807,9223372036854775807),(9223372036854775808,-9223372036854775808)]\n\n ++ testCasts Integer Int8 [(-170141183460469231731687303715884105729,-1),(-170141183460469231731687303715884105728,0),(0,0),(170141183460469231731687303715884105727,-1),(170141183460469231731687303715884105728,0)]\n ++ testCasts Integer Int16 [(-170141183460469231731687303715884105729,-1),(-170141183460469231731687303715884105728,0),(0,0),(170141183460469231731687303715884105727,-1),(170141183460469231731687303715884105728,0)]\n ++ testCasts Integer Int32 [(-170141183460469231731687303715884105729,-1),(-170141183460469231731687303715884105728,0),(0,0),(170141183460469231731687303715884105727,-1),(170141183460469231731687303715884105728,0)]\n ++ testCasts Integer Int64 [(-170141183460469231731687303715884105729,-1),(-170141183460469231731687303715884105728,0),(0,0),(170141183460469231731687303715884105727,-1),(170141183460469231731687303715884105728,0)]\n ++ testCasts Integer Int [(-170141183460469231731687303715884105729,-1),(-170141183460469231731687303715884105728,0),(0,0),(170141183460469231731687303715884105727,-1),(170141183460469231731687303715884105728,0)]\n ++ testCasts Integer String [(-170141183460469231731687303715884105729,\"-170141183460469231731687303715884105729\"),(-170141183460469231731687303715884105728,\"-170141183460469231731687303715884105728\"),(0,\"0\"),(170141183460469231731687303715884105727,\"170141183460469231731687303715884105727\"),(170141183460469231731687303715884105728,\"170141183460469231731687303715884105728\")]\n ++ testCasts Integer Bits8 [(-170141183460469231731687303715884105729,maxBits8),(0,0),(170141183460469231731687303715884105727,0xff),(170141183460469231731687303715884105728,0)]\n ++ testCasts Integer Bits16 [(-170141183460469231731687303715884105729,maxBits16),(0,0),(170141183460469231731687303715884105727,0xffff),(170141183460469231731687303715884105728,0)]\n ++ testCasts Integer Bits32 [(-170141183460469231731687303715884105729,maxBits32),(0,0),(170141183460469231731687303715884105727,0xffffffff),(170141183460469231731687303715884105728,0)]\n ++ testCasts Integer Bits64 [(-170141183460469231731687303715884105729,maxBits64),(0,0),(170141183460469231731687303715884105727,0xffffffffffffffff),(170141183460469231731687303715884105728,0)]\n\n ++ testCasts Bits8 Int8 [(0,0),(255,-1),(256,0)]\n ++ testCasts Bits8 Int16 [(0,0),(255,255),(256,0)]\n ++ testCasts Bits8 Int32 [(0,0),(255,255),(256,0)]\n ++ testCasts Bits8 Int64 [(0,0),(255,255),(256,0)]\n ++ testCasts Bits8 Int [(0,0),(255,255),(256,0)]\n ++ testCasts Bits8 Double [(0,0),(255,255),(256,0)]\n ++ testCasts Bits8 String [(0,\"0\"),(255,\"255\"),(256,\"0\")]\n ++ testCasts Bits8 Integer [(0,0),(255,255),(256,0)]\n ++ testCasts Bits8 Bits16 [(0,0),(255,255),(256,0)]\n ++ testCasts Bits8 Bits32 [(0,0),(255,255),(256,0)]\n ++ testCasts Bits8 Bits64 [(0,0),(255,255),(256,0)]\n\n ++ testCasts Bits16 Int8 [(0,0),(0xffff,-1),(0x10000,0)]\n ++ testCasts Bits16 Int16 [(0,0),(0xffff,-1),(0x10000,0)]\n ++ testCasts Bits16 Int32 [(0,0),(0xffff,0xffff),(0x10000,0)]\n ++ testCasts Bits16 Int64 [(0,0),(0xffff,0xffff),(0x10000,0)]\n ++ testCasts Bits16 Int [(0,0),(0xffff,0xffff),(0x10000,0)]\n ++ testCasts Bits16 Double [(0,0),(0xffff,0xffff),(0x10000,0)]\n ++ testCasts Bits16 String [(0,\"0\"),(0xffff,\"65535\"),(0x10000,\"0\")]\n ++ testCasts Bits16 Integer [(0,0),(0xffff,0xffff),(0x10000,0)]\n ++ testCasts Bits16 Bits8 [(0,0),(0xffff,0xff),(0x10000,0)]\n ++ testCasts Bits16 Bits32 [(0,0),(0xffff,0xffff),(0x10000,0)]\n ++ testCasts Bits16 Bits64 [(0,0),(0xffff,0xffff),(0x10000,0)]\n\n ++ testCasts Bits32 Int8 [(0,0),(0xffffffff,-1),(0x100000000,0)]\n ++ testCasts Bits32 Int16 [(0,0),(0xffffffff,-1),(0x100000000,0)]\n ++ testCasts Bits32 Int32 [(0,0),(0xffffffff,-1),(0x100000000,0)]\n ++ testCasts Bits32 Int64 [(0,0),(0xffffffff,0xffffffff),(0x100000000,0)]\n ++ testCasts Bits32 Int [(0,0),(0xffffffff,0xffffffff),(0x100000000,0)]\n ++ testCasts Bits32 Double [(0,0),(0xffffffff,0xffffffff),(0x100000000,0)]\n ++ testCasts Bits32 String [(0,\"0\"),(0xffffffff,\"4294967295\"),(0x100000000,\"0\")]\n ++ testCasts Bits32 Integer [(0,0),(0xffffffff,0xffffffff),(0x100000000,0)]\n ++ testCasts Bits32 Bits8 [(0,0),(0xffffffff,0xff),(0x100000000,0)]\n ++ testCasts Bits32 Bits16 [(0,0),(0xffffffff,0xffff),(0x100000000,0)]\n ++ testCasts Bits32 Bits64 [(0,0),(0xffffffff,0xffffffff),(0x100000000,0)]\n\n ++ testCasts Bits64 Int8 [(0,0),(0xffffffffffffffff,-1),(0x10000000000000000,0)]\n ++ testCasts Bits64 Int16 [(0,0),(0xffffffffffffffff,-1),(0x10000000000000000,0)]\n ++ testCasts Bits64 Int32 [(0,0),(0xffffffffffffffff,-1),(0x10000000000000000,0)]\n ++ testCasts Bits64 Int64 [(0,0),(0xffffffffffffffff,-1),(0x10000000000000000,0)]\n ++ testCasts Bits64 Int [(0,0),(0xffffffffffffffff,-1),(0x10000000000000000,0)]\n ++ testCasts Bits64 Double [(0,0),(0xffffffffffffffff,0xffffffffffffffff),(0x10000000000000000,0)]\n ++ testCasts Bits64 String [(0,\"0\"),(0xffffffffffffffff,\"18446744073709551615\"),(0x10000000000000000,\"0\")]\n ++ testCasts Bits64 Integer [(0,0),(0xffffffffffffffff,0xffffffffffffffff),(0x10000000000000000,0)]\n ++ testCasts Bits64 Bits8 [(0,0),(0xffffffffffffffff,0xff),(0x10000000000000000,0)]\n ++ testCasts Bits64 Bits16 [(0,0),(0xffffffffffffffff,0xffff),(0x10000000000000000,0)]\n ++ testCasts Bits64 Bits32 [(0,0),(0xffffffffffffffff,0xffffffff),(0x10000000000000000,0)]\n\n ++ testCasts String Int8 [(\"-129\",127),(\"-128\",-128),(\"0\",0),(\"127\",127), (\"128\",-128)]\n ++ testCasts String Int16 [(\"-32769\",32767),(\"-32768\",-32768),(\"0\",0),(\"32767\",32767), (\"32768\",-32768)]\n ++ testCasts String Int32 [(\"-2147483649\",2147483647),(\"-2147483648\",-2147483648),(\"0\",0),(\"2147483647\",2147483647), (\"2147483648\",-2147483648)]\n ++ testCasts String Int64 [(\"-9223372036854775809\",9223372036854775807),(\"-9223372036854775808\",-9223372036854775808),(\"0\",0),(\"9223372036854775807\",9223372036854775807), (\"9223372036854775808\",-9223372036854775808)]\n ++ testCasts String Int [(\"-9223372036854775809\",9223372036854775807),(\"-9223372036854775808\",-9223372036854775808),(\"0\",0),(\"9223372036854775807\",9223372036854775807), (\"9223372036854775808\",-9223372036854775808)]\n ++ testCasts String Integer [(\"-170141183460469231731687303715884105728\",-170141183460469231731687303715884105728),(\"-170141183460469231731687303715884105728\",-170141183460469231731687303715884105728),(\"0\",0),(\"170141183460469231731687303715884105728\",170141183460469231731687303715884105728)]\n ++ testCasts String Bits8 [(\"0\",0),(\"255\",255), (\"256\",0)]\n ++ testCasts String Bits16 [(\"0\",0),(\"65535\",65535), (\"65536\",0)]\n ++ testCasts String Bits32 [(\"0\",0),(\"4294967295\",4294967295), (\"4294967296\",0)]\n ++ testCasts String Bits64 [(\"0\",0),(\"18446744073709551615\",18446744073709551615), (\"18446744073709551616\",0)]\n\n ++ testCasts Double Int8 [(-129.0, 127),(-128.0,-128),(-12.001,-12),(12.001,12),(127.0,127),(128.0,-128)]\n ++ testCasts Double Int16 [(-32769.0, 32767),(-32768.0,-32768),(-12.001,-12),(12.001,12),(32767.0,32767),(32768.0,-32768)]\n ++ testCasts Double Int32 [(-2147483649.0,2147483647),(-2147483648.0,-2147483648),(-12.001,-12),(12.001,12),(2147483647.0,2147483647),(2147483648.0,-2147483648)]\n ++ testCasts Double Int64 [(-9223372036854775808.0,-9223372036854775808),(-12.001,-12),(12.001,12),(9223372036854775808.0,-9223372036854775808)]\n ++ testCasts Double Int [(-9223372036854775808.0,-9223372036854775808),(-12.001,-12),(12.001,12),(9223372036854775808.0,-9223372036854775808)]\n ++ testCasts Double Bits8 [(0.0,0),(255.0,255), (256.0,0)]\n ++ testCasts Double Bits16 [(0.0,0),(65535.0,65535), (65536.0,0)]\n ++ testCasts Double Bits32 [(0.0,0),(4294967295.0,4294967295), (4294967296.0,0)]\n ++ testCasts Double Bits64 [(0.0,0),(18446744073709551616.0,0)]\n\n ++ testCasts Int8 Char [(-1, '\\x0'), (80, 'P')]\n ++ testCasts Int16 Char [(-1, '\\x0'), (80, 'P')]\n ++ testCasts Int32 Char [(-1, '\\x0'), (80, 'P'), (55295, '\\xd7ff'), (55296, '\\x0'), (57344, '\\xe000'), (1114111, '\\x10ffff'), (1114112, '\\x0')]\n ++ testCasts Int64 Char [(-1, '\\x0'), (80, 'P'), (55295, '\\xd7ff'), (55296, '\\x0'), (57344, '\\xe000'), (1114111, '\\x10ffff'), (1114112, '\\x0')]\n ++ testCasts Int Char [(-1, '\\x0'), (80, 'P'), (55295, '\\xd7ff'), (55296, '\\x0'), (57344, '\\xe000'), (1114111, '\\x10ffff'), (1114112, '\\x0')]\n ++ testCasts Bits8 Char [(80, 'P')]\n ++ testCasts Bits16 Char [(80, 'P'), (55295, '\\xd7ff'), (55296, '\\x0'), (57344, '\\xe000')]\n ++ testCasts Bits32 Char [(80, 'P'), (55295, '\\xd7ff'), (55296, '\\x0'), (57344, '\\xe000'), (1114111, '\\x10ffff'), (1114112, '\\x0')]\n ++ testCasts Bits64 Char [(80, 'P'), (55295, '\\xd7ff'), (55296, '\\x0'), (57344, '\\xe000'), (1114111, '\\x10ffff'), (1114112, '\\x0')]\n ++ testCasts Integer Char [(-1, '\\x0'), (80, 'P'), (55295, '\\xd7ff'), (55296, '\\x0'), (57344, '\\xe000'), (1114111, '\\x10ffff'), (1114112, '\\x0')]\n\n--------------------------------------------------------------------------------\n-- Main\n--------------------------------------------------------------------------------\n\nmain : IO ()\nmain = traverse_ putStrLn results\n", "meta": {"hexsha": "ebbba9f6d6bfb46d13b2dd9958ba255a6f9d4275", "size": 21316, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "tests/chez/casts/Casts.idr", "max_stars_repo_name": "ska80/idris-jvm", "max_stars_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 128, "max_stars_repo_stars_event_min_datetime": "2020-06-09T21:25:49.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-31T23:50:24.000Z", "max_issues_repo_path": "tests/chez/casts/Casts.idr", "max_issues_repo_name": "ska80/idris-jvm", "max_issues_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 9, "max_issues_repo_issues_event_min_datetime": "2020-08-26T03:38:49.000Z", "max_issues_repo_issues_event_max_datetime": "2021-09-23T21:32:49.000Z", "max_forks_repo_path": "tests/chez/casts/Casts.idr", "max_forks_repo_name": "ska80/idris-jvm", "max_forks_repo_head_hexsha": "66223d026d034578876b325e9fcd95874faa6052", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 8, "max_forks_repo_forks_event_min_datetime": "2020-08-28T04:16:04.000Z", "max_forks_repo_forks_event_max_datetime": "2022-02-20T12:47:16.000Z", "avg_line_length": 76.9530685921, "max_line_length": 386, "alphanum_fraction": 0.6513886283, "num_tokens": 7519, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.5350984286266115, "lm_q2_score": 0.6619228758499942, "lm_q1q2_score": 0.35419389073933955}} {"text": "module ProofColDivSeqMain\r\n\r\nimport ProofColDivSeqBase\r\nimport ProofColDivSeqPostulate\r\nimport ProofColDivSeqLvDown\r\nimport Sub01Apply18x3\r\nimport Sub02Apply54x12\r\nimport Sub03Apply54x30\r\nimport Sub04Apply54x48\r\nimport Sub05Apply9x6\r\nimport Sub06Apply36x9\r\nimport Sub07Apply108x27\r\nimport Sub08Apply108x63\r\nimport Sub09Apply108x99\r\nimport Sub10Apply108x18\r\nimport Sub11Apply108x54\r\nimport Sub12Apply108x90\r\nimport Sub13Apply108x36\r\nimport Sub14Apply108x72\r\nimport Sub15Apply108x108\r\n\r\n%default total\r\n-- %language ElabReflection\r\n\r\n\r\n-- 無限降下法の十分条件\r\nunifi : (n:Nat) -> P (S n) 2 -> (m ** (LTE (S m) (S n), P m 2))\r\nunifi n prf with (mod3 n)\r\n unifi (j + j + j) prf | ThreeZero with (parity j)\r\n unifi ((k+k) + (k+k) + (k+k)) prf | ThreeZero | Even = apply18x3 prf\r\n unifi (S (k+k) + S (k+k) + S (k+k)) prf | ThreeZero | Odd with (mod3 k)\r\n unifi (S ((l+l+l)+(l+l+l)) + S ((l+l+l)+(l+l+l)) + S ((l+l+l)+(l+l+l))) prf | ThreeZero | Odd | ThreeZero = apply54x12 prf\r\n unifi (S ((S (l+l+l))+(S (l+l+l))) + S ((S (l+l+l))+(S (l+l+l))) + S ((S (l+l+l))+(S (l+l+l)))) prf | ThreeZero | Odd | ThreeOne = apply54x30 prf\r\n unifi (S ((S (S (l+l+l)))+(S (S (l+l+l)))) + S ((S (S (l+l+l)))+(S (S (l+l+l)))) + S ((S (S (l+l+l)))+(S (S (l+l+l))))) prf | ThreeZero | Odd | ThreeTwo = apply54x48 prf\r\n unifi (S (j + j + j)) prf | ThreeOne = apply9x6 prf\r\n unifi (S (S (j + j + j))) prf | ThreeTwo with (parity j)\r\n unifi (S (S ((k+k) + (k+k) + (k+k)))) prf | ThreeTwo | Even with (parity k)\r\n unifi (S (S (((l+l)+(l+l)) + ((l+l)+(l+l)) + ((l+l)+(l+l))))) prf | ThreeTwo | Even | Even = apply36x9 prf\r\n unifi (S (S ((S (l+l)+S (l+l)) + (S (l+l)+S (l+l)) + (S (l+l)+S (l+l))))) prf | ThreeTwo | Even | Odd with (mod3 l)\r\n unifi (S (S ((S ((o+o+o)+(o+o+o))+S ((o+o+o)+(o+o+o))) + (S ((o+o+o)+(o+o+o))+S ((o+o+o)+(o+o+o))) + (S ((o+o+o)+(o+o+o))+S ((o+o+o)+(o+o+o)))))) prf | ThreeTwo | Even | Odd | ThreeZero = apply108x27 prf\r\n unifi (S (S ((S (S (o+o+o)+S (o+o+o))+S (S (o+o+o)+ S (o+o+o))) + (S (S (o+o+o)+ S (o+o+o))+S (S (o+o+o)+ S (o+o+o))) + (S (S (o+o+o)+ S (o+o+o))+S (S (o+o+o)+ S (o+o+o)))))) prf | ThreeTwo | Even | Odd | ThreeOne = apply108x63 prf\r\n unifi (S (S ((S (S (S (o+o+o))+S (S (o+o+o)))+S (S (S (o+o+o))+ S (S (o+o+o))) + (S (S (S (o+o+o))+ S (S (o+o+o)))+S (S (S (o+o+o))+ S (S (o+o+o)))) + (S (S (S (o+o+o))+ S (S (o+o+o)))+S (S (S (o+o+o))+ S (S (o+o+o)))))))) prf | ThreeTwo | Even | Odd | ThreeTwo = apply108x99 prf\r\n unifi (S (S (S (k+k) + S (k+k) + S (k+k)))) prf | ThreeTwo | Odd with (parity k)\r\n unifi (S (S (S ((l+l)+(l+l)) + S ((l+l)+(l+l)) + S ((l+l)+(l+l))))) prf | ThreeTwo | Odd | Even with (mod3 l)\r\n unifi (S (S (S (((o+o+o)+(o+o+o))+((o+o+o)+(o+o+o))) + S (((o+o+o)+(o+o+o))+((o+o+o)+(o+o+o))) + S (((o+o+o)+(o+o+o))+((o+o+o)+(o+o+o)))))) prf | ThreeTwo | Odd | Even | ThreeZero = apply108x18 prf\r\n unifi (S (S (S ((S (o+o+o)+S (o+o+o))+(S (o+o+o)+S (o+o+o))) + S ((S (o+o+o)+S (o+o+o))+(S (o+o+o)+S (o+o+o))) + S ((S (o+o+o)+S (o+o+o))+(S (o+o+o)+S (o+o+o)))))) prf | ThreeTwo | Odd | Even | ThreeOne = apply108x54 prf\r\n unifi (S (S (S ((S (S (o+o+o))+S (S (o+o+o)))+(S (S (o+o+o))+S (S (o+o+o)))) + S ((S (S (o+o+o))+S (S (o+o+o)))+(S (S (o+o+o))+S (S (o+o+o)))) + S ((S (S (o+o+o))+S (S (o+o+o)))+(S (S (o+o+o))+S (S (o+o+o))))))) prf | ThreeTwo | Odd | Even | ThreeTwo = apply108x90 prf\r\n unifi (S (S (S (S (l+l)+ S (l+l)) + S (S (l+l)+S (l+l)) + S (S (l+l)+S (l+l))))) prf | ThreeTwo | Odd | Odd with (mod3 l)\r\n unifi (S (S (S (S ((o+o+o)+(o+o+o))+ S ((o+o+o)+(o+o+o))) + S (S ((o+o+o)+(o+o+o))+S ((o+o+o)+(o+o+o))) + S (S ((o+o+o)+(o+o+o))+S ((o+o+o)+(o+o+o)))))) prf | ThreeTwo | Odd | Odd | ThreeZero = apply108x36 prf\r\n unifi (S (S (S (S (S (o+o+o)+S (o+o+o))+ S (S (o+o+o)+S (o+o+o))) + S (S (S (o+o+o)+S (o+o+o))+S (S (o+o+o)+S (o+o+o))) + S (S (S (o+o+o)+S (o+o+o))+S (S (o+o+o)+S (o+o+o)))))) prf | ThreeTwo | Odd | Odd | ThreeOne = apply108x72 prf\r\n unifi (S (S (S (S (S (S (o+o+o))+S (S (o+o+o)))+ S (S (S (o+o+o))+S (S (o+o+o)))) + S (S (S (S (o+o+o))+S (S (o+o+o)))+S (S (S (o+o+o))+S (S (o+o+o)))) + S (S (S (S (o+o+o))+S (S (o+o+o)))+S (S (S (o+o+o))+S (S (o+o+o))))))) prf | ThreeTwo | Odd | Odd | ThreeTwo = apply108x108 prf\r\n\r\nallDivSeqInfFalse' : All Limited (allDivSeq (n+n+n) 2)\r\nallDivSeqInfFalse' = infiniteDescent unifi base0\r\n\r\n-- レベルを下げる関数2\r\nlvDown2 : (n, lv:Nat)\r\n -> All Limited (allDivSeq (n+n+n) lv)\r\n -> All Limited (allDivSeq (n+n+n) (pred lv))\r\nlvDown2 n Z = id\r\nlvDown2 n (S lv) = rewrite defini (n+n+n) lv in \\y =>\r\n all2 (allDivSeq (n+n+n) lv)\r\n (allDivSeqA (n+n+n) lv ++\r\n allDivSeqB (n+n+n) lv ++\r\n allDivSeqC (n+n+n) lv ++\r\n allDivSeqD (n+n+n) lv ++\r\n allDivSeqE (n+n+n) lv ++\r\n allDivSeqF (n+n+n) lv ++\r\n allDivSeqG (n+n+n) lv)\r\n y\r\n\r\n\r\n-- 最終的な定理\r\nallDivSeqInfFalse : (n:Nat)\r\n -> All Limited (allDivSeq (n+n+n) 0)\r\nallDivSeqInfFalse n = lvDown2 n 1 $ lvDown2 n 2 allDivSeqInfFalse'\r\n\r\n\r\n\r\n", "meta": {"hexsha": "fbcf65bdab8fa6f54e34624710add390b41e8a4d", "size": 5046, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "program/ProofColDivSeqMain.idr", "max_stars_repo_name": "righ1113/collatzProof_DivSeq", "max_stars_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "program/ProofColDivSeqMain.idr", "max_issues_repo_name": "righ1113/collatzProof_DivSeq", "max_issues_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 3, "max_issues_repo_issues_event_min_datetime": "2019-01-26T12:59:21.000Z", "max_issues_repo_issues_event_max_datetime": "2019-10-19T07:02:00.000Z", "max_forks_repo_path": "program/ProofColDivSeqMain.idr", "max_forks_repo_name": "righ1113/collatzProof_DivSeq", "max_forks_repo_head_hexsha": "eef9da457fe77f0b58fb4407ab128d38ada9071e", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 63.075, "max_line_length": 290, "alphanum_fraction": 0.4970273484, "num_tokens": 2420, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. NO", "lm_q1_score": 0.7248702761768248, "lm_q2_score": 0.48828339529583464, "lm_q1q2_score": 0.35394211960064936}} {"text": "module Himp\n\nimport Assn\nimport Expr\nimport Logic\nimport Maps\n\n%access public export\n\n%default total\n\ndata HCom : Type where\n HCSkip : HCom\n HCAss : (x : Id) -> (a : AExp) -> HCom\n HCSeq : (c1 : HCom) -> (c2 : HCom) -> HCom\n HCIf : (b : BExp) -> (ct : HCom) -> (cf : HCom) -> HCom\n HCWhile : (b : BExp) -> (c : HCom) -> HCom\n HCHavoc : (x : Id) -> HCom\n\nSKIP : HCom\nSKIP = HCSkip\n\ninfix 5 ::=\n\n(::=) : Id -> AExp -> HCom\n(::=) = HCAss\n\n(>>=) : HCom -> (() -> HCom) -> HCom\n(>>=) c f = HCSeq c (f ())\n\nWHILE : BExp -> HCom -> HCom\nWHILE = HCWhile\n\nsyntax IFB [b] THEN [ct] ELSE [cf] FI = HCIf b ct cf\n\nHAVOC : Id -> HCom\nHAVOC = HCHavoc\n\ndata HCEval : HCom -> State -> State -> Type where\n E_Skip : HCEval HCSkip st st\n E_Ass : aeval st a1 = n -> HCEval (HCAss x a1) st (t_update x n st)\n E_Seq : HCEval c1 st1 st2 -> HCEval c2 st2 st3 ->\n HCEval (HCSeq c1 c2) st1 st3\n E_IfTrue : beval st b = True -> HCEval c1 st st1 ->\n HCEval (HCIf b c1 c2) st st1\n E_IfFalse : beval st b = False -> HCEval c2 st st1 ->\n HCEval (HCIf b c1 c2) st st1\n E_WhileEnd : beval st b = False -> HCEval (HCWhile b c) st st\n E_WhileLoop : beval st b = True ->\n HCEval c st st1 -> HCEval (HCWhile b c) st1 st2 ->\n HCEval (HCWhile b c) st st2\n E_Havoc : (n : Nat) -> HCEval (HCHavoc x) st (t_update x n st)\n\nsyntax [c1] \"/\" [st1] \"\\\\\\\\\" [st2] = HCEval c1 st1 st2\n\nhavoc_example_1 : (HAVOC X) / Expr.empty_state \\\\ (t_update X 0 Expr.empty_state)\nhavoc_example_1 = E_Havoc 0\n\nhavoc_example_2 : (do SKIP; HAVOC Z)\n / Expr.empty_state \\\\ (t_update Z 42 Expr.empty_state)\nhavoc_example_2 = E_Seq E_Skip (E_Havoc 42)\n\nHCEquiv : (c1, c2 : HCom) -> Type\nHCEquiv c1 c2 = (st, st' : State) -> ((c1 / st \\\\ st') ↔ (c2 / st \\\\ st'))\n\nhavoc_property : Not (x = y) -> st x = n -> ((HAVOC y) / st \\\\ st') -> st' x = n\nhavoc_property contra prf (E_Havoc _) =\n rewrite snd beq_id_false_iff $ neqSym contra\n in prf\n\npXY : HCom\npXY = do HAVOC X\n HAVOC Y\n\npYX : HCom\npYX = do HAVOC Y\n HAVOC X\n\nx_neq_y : Not (Expr.X = Expr.Y)\nx_neq_y Refl impossible\n\npXY_equiv_pYX : Either (HCEquiv Himp.pXY Himp.pYX)\n (Not (HCEquiv Himp.pXY Himp.pYX))\npXY_equiv_pYX = Left $ \\st, st' =>\n (forward st st', backward st st')\nwhere forward : (st, st' : State) ->\n (Himp.pXY / st \\\\ st') -> (Himp.pYX / st \\\\ st')\n forward st _ (E_Seq (E_Havoc n) (E_Havoc m)) =\n rewrite t_update_permute {x1=Y} {v1=m} {x2=X} {v2=n} {m=st}\n x_neq_y\n in E_Seq (E_Havoc m) (E_Havoc n)\n backward : (st, st' : State) ->\n (Himp.pYX / st \\\\ st') -> (Himp.pXY / st \\\\ st')\n backward st _ (E_Seq (E_Havoc n) (E_Havoc m)) =\n rewrite t_update_permute {x1=X} {v1=m} {x2=Y} {v2=n} {m=st}\n (neqSym x_neq_y)\n in E_Seq (E_Havoc m) (E_Havoc n)\n\nptwice : HCom\nptwice = do HAVOC X\n HAVOC Y\n\npcopy : HCom\npcopy = do HAVOC X\n Y ::= X\n\nptwice_inequiv_pcopy : Either (HCEquiv Himp.ptwice Himp.pcopy)\n (Not (HCEquiv Himp.ptwice Himp.pcopy))\nptwice_inequiv_pcopy = Right $ \\equiv =>\n let st' = t_update Y 1 $ t_update X 0 empty_state\n in case fst (equiv empty_state st') (E_Seq (E_Havoc 0) (E_Havoc 1)) of\n E_Seq _ E_Skip impossible\n E_Seq _ (E_Ass _) impossible\n E_Seq _ (E_Seq _ _) impossible\n E_Seq _ (E_IfTrue _ _) impossible\n E_Seq _ (E_IfFalse _ _) impossible\n E_Seq _ (E_WhileEnd _) impossible\n E_Seq _ (E_WhileLoop _ _ _) impossible\n E_Seq _ (E_Havoc _) impossible\n\np1 : HCom\np1 = WHILE (not (X == 0)) $ do\n HAVOC Y\n X ::= X + 1\n\np2 : HCom\np2 = WHILE (not (X == 0)) $\n SKIP\n\np1_may_diverge : Not (st X = 0) -> Not (Himp.p1 / st \\\\ st')\np1_may_diverge {st'} contra (E_WhileEnd prf) with (st' X)\n p1_may_diverge {st'} contra (E_WhileEnd prf) | Z = contra Refl\n p1_may_diverge {st'} contra (E_WhileEnd prf) | S _ = absurd prf\np1_may_diverge contra (E_WhileLoop _ (E_Seq {st2} _ (E_Ass prf)) next) =\n let h_prf = sym $ trans (plusCommutative 1 (st2 X)) prf\n in p1_may_diverge {st=t_update X _ _}\n (n_eq_succ__n_neq_0 {k=st2 X} h_prf) next\n\np2_may_diverge : Not (st X = 0) -> Not (Himp.p2 / st \\\\ st')\np2_may_diverge {st'} contra (E_WhileEnd prf) =\n let st_X_beq_0 = trans (sym (notInvolutive (st' X == 0)))\n (cong {f=Bool.not} prf)\n in contra (fst (nat_beq_iff (st' X) 0) st_X_beq_0)\np2_may_diverge contra (E_WhileLoop _ E_Skip next) = p2_may_diverge contra next\n\np1_p2_equiv : HCEquiv Himp.p1 Himp.p2\np1_p2_equiv st st' = (forward, backward)\nwhere forward : (Himp.p1 / st \\\\ st') -> (Himp.p2 / st \\\\ st')\n forward rel = case rel of\n E_WhileEnd prf => E_WhileEnd prf\n E_WhileLoop prf _ _ =>\n let st_X_neq_0 = fst (nat_nbeq_iff (st X) 0)\n (trans (sym (notInvolutive (st X == 0)))\n (cong {f=Bool.not} prf))\n in absurd $ p1_may_diverge st_X_neq_0 rel\n backward : (Himp.p2 / st \\\\ st') -> (Himp.p1 / st \\\\ st')\n backward rel = case rel of\n E_WhileEnd prf => E_WhileEnd prf\n E_WhileLoop prf _ _ =>\n let st_X_neq_0 = fst (nat_nbeq_iff (st X) 0)\n (trans (sym (notInvolutive (st X == 0)))\n (cong {f=Bool.not} prf))\n in absurd $ p2_may_diverge st_X_neq_0 rel\n\np3 : HCom\np3 = do Z ::= 1\n WHILE (not (X == 0)) $ do\n HAVOC X\n HAVOC Z\n\np4 : HCom\np4 = do X ::= 0\n Z ::= 1\n\np3_p4_inequiv : Not (HCEquiv Himp.p3 Himp.p4)\np3_p4_inequiv equiv =\n let st = t_update X 1 empty_state\n st' = t_update Z 2 $ t_update X 0 $ t_update Z 1 st\n in case fst (equiv st st')\n (E_Seq (E_Ass Refl)\n (E_WhileLoop Refl\n (E_Seq (E_Havoc 0) (E_Havoc 2))\n (E_WhileEnd Refl))) of\n (E_Seq (E_Ass _) E_Skip) impossible\n (E_Seq (E_Ass _) (E_Ass _)) impossible\n (E_Seq (E_Ass _) (E_Seq _ _)) impossible\n (E_Seq (E_Ass _) (E_IfTrue _ _)) impossible\n (E_Seq (E_Ass _) (E_IfFalse _ _)) impossible\n (E_Seq (E_Ass _) (E_WhileEnd _)) impossible\n (E_Seq (E_Ass _) (E_WhileLoop _ _ _)) impossible\n (E_Seq (E_Ass _) (E_Havoc _)) impossible\n\np5 : HCom\np5 = WHILE (not (X == 1)) $\n HAVOC X\n\np6 : HCom\np6 = X ::= 1\n\noverwriting_write : ((x ::= ANum n) / (t_update x v st) \\\\ st') ->\n ((x ::= ANum n) / st \\\\ st')\noverwriting_write {x} {n} {v} {st} (E_Ass prf) =\n rewrite sym prf\n in rewrite t_update_shadow {x=x} {v2=n} {v1=v} {m=st}\n in E_Ass {n=n} Refl\n\np5_p6_equiv : HCEquiv Himp.p5 Himp.p6\np5_p6_equiv st st' = (forward st st', backward st st')\nwhere forward : (st, st' : State) ->\n (Himp.p5 / st \\\\ st') -> (Himp.p6 / st \\\\ st')\n forward st st' rel = case rel of\n E_WhileEnd prf =>\n let st_X_eq_1 = fst (nat_beq_iff (st X) 1)\n (trans (sym (notInvolutive (st X == 1)))\n (cong {f=Bool.not} prf))\n st_prf = replace {P=\\v => t_update X v st = st}\n st_X_eq_1 (t_update_same {m=st} {x=X})\n in replace {P=\\x => HCEval (HCAss X 1) st x}\n st_prf (Himp.E_Ass Refl)\n E_WhileLoop {st1 = (t_update Expr.X n st)} _ (E_Havoc n) next =>\n overwriting_write $ forward (t_update X n st) st' next\n backward : (st, st' : State) ->\n (Himp.p6 / st \\\\ st') -> (Himp.p5 / st \\\\ st')\n backward st st' rel with (st X) proof st_X_prf\n backward st st' rel | Z = case rel of\n E_Ass prf => let pf = cong {f=Bool.not . (==1)} $ sym st_X_prf\n in rewrite sym prf\n in E_WhileLoop pf (E_Havoc 1) (E_WhileEnd Refl)\n backward st st' rel | S Z = case rel of\n E_Ass prf => let pf = cong {f=Bool.not . (==1)} $ sym st_X_prf\n in rewrite sym prf\n in rewrite st_X_prf\n in rewrite t_update_same {m=st} {x=X}\n in rewrite sym st_X_prf\n in E_WhileEnd pf\n backward st st' rel | S (S k) = case rel of\n E_Ass prf => let pf = cong {f=Bool.not . (== 1)} $ sym st_X_prf\n in rewrite sym prf\n in E_WhileLoop pf (E_Havoc 1) (E_WhileEnd Refl)\n\nHoareTriple : (p : Assertion) -> (c : HCom) -> (q : Assertion) -> Type\nHoareTriple p c q = (st, st' : State) -> (c / st \\\\ st') -> p st -> q st'\n\nHavocPre : (x : Id) -> (q : Assertion) -> Assertion\nHavocPre x q = \\st => (n : Nat) -> q (t_update x n st)\n\nhoare_havoc : (q : Assertion) -> (x : Id) ->\n HoareTriple (HavocPre x q) (HAVOC x) q\nhoare_havoc q x st _ (E_Havoc n) p_st = p_st n\n\nIsWP : (p : Assertion) -> (c : HCom) -> (q : Assertion) -> Type\nIsWP p c q = ( HoareTriple p c q\n , (p' : Assertion) -> HoareTriple p' c q -> p' ->> p )\n\nhoare_havoc_weakest : IsWP (HavocPre x q) (HAVOC x) q\nhoare_havoc_weakest {x} {q} = (hoare_havoc q x, imp)\nwhere imp : (p' : Assertion) -> HoareTriple p' (HAVOC x) q -> p' ->> HavocPre x q\n imp p' ht st p'_st n = ht st _ (E_Havoc n) p'_st\n", "meta": {"hexsha": "0b74cc409e252650b33b0893d230b59e2c509086", "size": 9371, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Himp.idr", "max_stars_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_stars_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_stars_repo_licenses": ["MIT"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "Himp.idr", "max_issues_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_issues_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_issues_repo_licenses": ["MIT"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "Himp.idr", "max_forks_repo_name": "minhnhdo/programming-language-foundations-in-idris", "max_forks_repo_head_hexsha": "0881c34307afa8c90cda2290bf72910be4a1ea57", "max_forks_repo_licenses": ["MIT"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 36.1814671815, "max_line_length": 81, "alphanum_fraction": 0.5449791911, "num_tokens": 3428, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6334102498375401, "lm_q2_score": 0.5583269943353745, "lm_q1q2_score": 0.3536500409730124}} {"text": "module Data.Tree\n\n%default total\n%access public export\n\n||| A key-value tree data structure.\n|||\n||| This structure doesn't encode the invariants of the tree and is\n||| *simply* a container. This structure ideally shouldn't be exposed\n||| to the user at all. This structure should be used to build other\n||| data structures. See the modules alongside this for appropriate\n||| interfaces for using the tree.\n|||\n||| @keyTy The type associated with the key.\n||| @valTy The type associated with the value.\ndata Tree : (keyTy : Type)\n -> (valTy : Type)\n -> Type\n where\n ||| An empty Tree node.\n Empty : Tree k v\n\n ||| A Key Value node in the Tree.\n |||\n ||| @key The key.\n ||| @val The value associated with the key.\n ||| @left The left child of the Node\n ||| @right THe right child of the Node.\n Node : (key : k)\n -> (val : v)\n -> (left : Tree k v)\n -> (right : Tree k v)\n -> Tree k v\n\n%name Tree t, tree\n\nnamespace Keys\n\n ||| A proof that some key is found in a Tree\n data IsKeyIn : k -> Tree k v -> Type where\n Here : IsKeyIn key (Node key _ _ _)\n InRight : (later : IsKeyIn key r) -> IsKeyIn key (Node not_key _ _ r)\n InLeft : (later : IsKeyIn key l) -> IsKeyIn key (Node not_key _ l _)\n\n\n ||| An empty tree has no key\n emptyTreeHasNoKey : {key : k} -> IsKeyIn key Empty -> Void\n emptyTreeHasNoKey Here impossible\n emptyTreeHasNoKey (InRight _) impossible\n emptyTreeHasNoKey (InLeft _) impossible\n\n Uninhabited (IsKeyIn key Empty) where\n uninhabited = emptyTreeHasNoKey\n\n ||| An item that is not in the root, not in the left child and not in the\n ||| right child is not in the Tree at all\n noKeyFound : {key : k}\n -> {val : v}\n -> {key' : k}\n -> {l : Tree k v}\n -> {r : Tree k v}\n -> Not (key = key')\n -> Not (IsKeyIn key l)\n -> Not (IsKeyIn key r)\n -> Not (IsKeyIn key (Node key' val l r))\n noKeyFound notHere notInLeft notInRight Here = notHere Refl\n noKeyFound notHere notInLeft notInRight (InLeft later) = notInLeft later\n noKeyFound notHere notInLeft notInRight (InRight later) = notInRight later\n\n ||| A decision procedure for Key\n isKey : DecEq k\n => (key : k)\n -> (tree : Tree k v)\n -> Dec (IsKeyIn key tree)\n isKey key Empty = No emptyTreeHasNoKey\n isKey key (Node key' _ l r) with (decEq key key')\n isKey key (Node key _ l r) | (Yes Refl) = Yes Here\n isKey key (Node key' _ l r) | (No notHere) with (isKey key l)\n isKey key (Node key' _ l r) | (No notHere) | (Yes inLeft) = Yes (InLeft inLeft)\n isKey key (Node key' _ l r) | (No notHere) | (No notInLeft) with (isKey key r)\n isKey key (Node key' _ l r) | (No notHere) | (No notInLeft) | (Yes inRight) = Yes (InRight inRight)\n isKey key (Node key' _ l r) | (No notHere) | (No notInLeft) | (No notInRight) = No (noKeyFound notHere notInLeft notInRight)\n\n public export\n data All : (predicate : typeKey -> Type)\n -> (tree : Tree typeKey typeValue)\n -> Type\n where\n Leaf : All p Empty\n Node : (prf : p key)\n -> (leftBranch : All p left)\n -> (rightBranch : All p right)\n -> All p (Node key _ left right)\n\n\nnamespace Values\n public export\n data IsValueIn : (value : typeValue)\n -> (tree : Tree typeKey typeValue)\n -> Type\n where\n Here : IsValueIn value (Node _ value _ _)\n InRight : (later : IsValueIn value r) -> IsValueIn value (Node _ not_value _ r)\n InLeft : (later : IsValueIn value l) -> IsValueIn value (Node _ not_value l _)\n\n emptyTreeHasNoValue : IsValueIn value Empty -> Void\n emptyTreeHasNoValue Here impossible\n emptyTreeHasNoValue (InRight _) impossible\n emptyTreeHasNoValue (InLeft _) impossible\n\n Uninhabited (IsValueIn value Empty) where\n uninhabited Here impossible\n uninhabited (InRight _) impossible\n uninhabited (InLeft _) impossible\n\n ||| A decision procedure for Value\n valueNotFound : (notHere : (value = val) -> Void)\n -> (isNotLeft : IsValueIn value left -> Void)\n -> (isNotRight : IsValueIn value right -> Void)\n -> IsValueIn value (Node key val left right)\n -> Void\n valueNotFound notHere isNotLeft isNotRight Here = notHere Refl\n valueNotFound notHere isNotLeft isNotRight (InRight later) = isNotRight later\n valueNotFound notHere isNotLeft isNotRight (InLeft later) = isNotLeft later\n\n isValue : DecEq typeValue\n => (value : typeValue)\n -> (tree : Tree typeKey typeValue)\n -> Dec (IsValueIn value tree)\n isValue value Empty = No emptyTreeHasNoValue\n isValue value (Node key val left right) with (decEq value val)\n isValue val (Node key val left right) | (Yes Refl) = Yes Here\n isValue value (Node key val left right) | (No notHere) with (isValue value left)\n isValue value (Node key val left right) | (No notHere) | (Yes prf) = Yes (InLeft prf)\n isValue value (Node key val left right) | (No notHere) | (No isNotLeft) with (isValue value right)\n isValue value (Node key val left right) | (No notHere) | (No isNotLeft) | (Yes prf) = Yes (InRight prf)\n isValue value (Node key val left right) | (No notHere) | (No isNotLeft) | (No isNotRight) = No (valueNotFound notHere isNotLeft isNotRight)\n\n public export\n data All : (predicate : typeValue -> Type)\n -> (tree : Tree typeKey typeValue)\n -> Type\n where\n Leaf : Values.All p Empty\n Node : (prf : p value)\n -> (leftBranch : Values.All p left)\n -> (rightBranch : Values.All p right)\n -> Values.All p (Node _ value left right)\n\n\nnamespace KVPairs\n public export\n data All : (predicate : typeKey -> typeValue -> Type)\n -> (tree : Tree typeKey typeValue)\n -> Type\n where\n Leaf : KVPairs.All p Empty\n Node : (prf : p key value)\n -> (leftBranch : KVPairs.All p left)\n -> (rightBranch : KVPairs.All p right)\n -> KVPairs.All p (Node key value left right)\n", "meta": {"hexsha": "9f48f523cc47976416e4c5dd60be1bd734d81e2f", "size": 6127, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "Data/Tree.idr", "max_stars_repo_name": "witt3rd/idris-containers", "max_stars_repo_head_hexsha": "6f4e06a0e85ee6336e493cee800fff42215da2ac", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 99, "max_stars_repo_stars_event_min_datetime": "2015-03-01T20:22:37.000Z", "max_stars_repo_stars_event_max_datetime": "2021-09-01T02:17:39.000Z", "max_issues_repo_path": "Data/Tree.idr", "max_issues_repo_name": "witt3rd/idris-containers", "max_issues_repo_head_hexsha": "6f4e06a0e85ee6336e493cee800fff42215da2ac", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 30, "max_issues_repo_issues_event_min_datetime": "2015-03-23T19:17:35.000Z", "max_issues_repo_issues_event_max_datetime": "2020-10-01T13:05:44.000Z", "max_forks_repo_path": "Data/Tree.idr", "max_forks_repo_name": "witt3rd/idris-containers", "max_forks_repo_head_hexsha": "6f4e06a0e85ee6336e493cee800fff42215da2ac", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 26, "max_forks_repo_forks_event_min_datetime": "2015-06-02T17:20:48.000Z", "max_forks_repo_forks_event_max_datetime": "2021-01-13T14:51:07.000Z", "avg_line_length": 37.8209876543, "max_line_length": 153, "alphanum_fraction": 0.6175942549, "num_tokens": 1784, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6187804196836383, "lm_q2_score": 0.5698526514141571, "lm_q1q2_score": 0.35261366279988615}} {"text": "||| Vertical composition of morphisms\nmodule VertComp\n\nimport Data.Vect\nimport VectHelp\nimport ProcessLib\nimport Util\nimport Proto\n\n%default total\n\n-- TODO: we aren't handling any errors here\n||| Connect two process\nmakeConnection: (w: DTy) ->\n (loc: Elem w cut_b) ->\n ProcPID (MkNiche cut_a cut_b) ->\n ProcPID (MkNiche cut_b cut_c) ->\n Process (ProcIF (MkNiche cut_a cut_c)) () Ready Ready\nmakeConnection (Down a) loc pid_f pid_g = do r <- Request pid_f (Conn (BotOutWire loc) pid_g (TopInWire loc))\n Action $ putStrLn $ \"CONN: Down: \" ++ show r\nmakeConnection (Up a) loc pid_f pid_g = do r <- Request pid_g (Conn (TopOutWire loc) pid_f (BotInWire loc))\n Action $ putStrLn $ \"CONN: Up : \" ++ show r\n\n||| Connect two process that have a common cut\nmakeConnections: (cut_b: Cut m1) ->\n ProcPID (MkNiche cut_a cut_b) ->\n ProcPID (MkNiche cut_b cut_c) ->\n Process (ProcIF (MkNiche cut_a cut_c)) () Ready Ready\nmakeConnections cut_b pid_f pid_g = let locs = allElems cut_b\n in sequence (map (\\(dt ** loc) => makeConnection dt loc pid_f pid_g) locs)\n\n||| Handle incoming requests\n||| Just reroutes the requests to the appropriate morphism\nresp: ProcPID (MkNiche cut_a cut_b) ->\n ProcPID (MkNiche cut_b cut_c) ->\n (msg : Req (MkNiche cut_a cut_c)) ->\n Process (ProcIF (MkNiche cut_a cut_c))\n (ProcIF (MkNiche cut_a cut_c) msg)\n Ready\n Ready\nresp pid_f pid_g con@(Conn (TopOutWire _) _ _) = Request pid_f con\nresp pid_f pid_g con@(Conn (BotOutWire _) _ _) = Request pid_g con\nresp pid_f pid_g val@(Val (TopInWire _) _) = do r <- Request pid_f val\n --Action $ putStrLn $ \"vert: reroute top val: \" ++ show r\n Pure r\nresp pid_f pid_g val@(Val (BotInWire _) _) = do r <- Request pid_g val\n --Action $ putStrLn $ \"vert: reroute bot val: \" ++ show r\n Pure r\n\ninfixl 3 -*-\n\n||| Vertical composition of morphisms in the category of processes\npublic export partial\n(-*-): {l,m,n: Nat} -> {cut_a: Cut l} -> {cut_b: Cut m} -> {cut_c: Cut n} ->\n Hom cut_a cut_b -> Hom cut_b cut_c -> Hom cut_a cut_c\n(-*-) {cut_b} f g = do Just pid_f <- Spawn f | _ => do Action $ putStrLn \"ERROR: (-*-): failed spawn 1\"\n f -*- g\n Just pid_g <- Spawn g | _ => do Action $ putStrLn \"ERROR: (-*-): failed spawn 2\"\n f -*- g\n makeConnections cut_b pid_f pid_g\n looper pid_f pid_g\n where\n looper : ProcPID (MkNiche cut_a cut_b) ->\n ProcPID (MkNiche cut_b cut_c) ->\n Process (ProcIF (MkNiche cut_a cut_c)) () Ready Looping\n looper pid_f pid_g = do --Action $ putStrLn $ \"(-*-): normal loop\"\n Respond (resp pid_f pid_g)\n Loop (looper pid_f pid_g)\n", "meta": {"hexsha": "ecd0a12b9fdbfa06afc9bce1915b1df059b201c2", "size": 3235, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "src/VertComp.idr", "max_stars_repo_name": "jameshaydon/smproc", "max_stars_repo_head_hexsha": "d816ad7db67affae634a854a9550d4b90206db6d", "max_stars_repo_licenses": ["MIT"], "max_stars_count": 23, "max_stars_repo_stars_event_min_datetime": "2017-01-30T21:32:12.000Z", "max_stars_repo_stars_event_max_datetime": "2021-02-18T04:37:43.000Z", "max_issues_repo_path": "src/VertComp.idr", "max_issues_repo_name": "jameshaydon/smproc", "max_issues_repo_head_hexsha": "d816ad7db67affae634a854a9550d4b90206db6d", "max_issues_repo_licenses": ["MIT"], "max_issues_count": 2, "max_issues_repo_issues_event_min_datetime": "2017-08-15T09:13:42.000Z", "max_issues_repo_issues_event_max_datetime": "2018-02-08T13:13:11.000Z", "max_forks_repo_path": "src/VertComp.idr", "max_forks_repo_name": "jameshaydon/smproc", "max_forks_repo_head_hexsha": "d816ad7db67affae634a854a9550d4b90206db6d", "max_forks_repo_licenses": ["MIT"], "max_forks_count": 1, "max_forks_repo_forks_event_min_datetime": "2018-02-07T16:31:05.000Z", "max_forks_repo_forks_event_max_datetime": "2018-02-07T16:31:05.000Z", "avg_line_length": 46.884057971, "max_line_length": 109, "alphanum_fraction": 0.5350850077, "num_tokens": 828, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6992544335934765, "lm_q2_score": 0.5039061705290805, "lm_q1q2_score": 0.35235862385756994}} {"text": "module Main\n\ndata Format = End | FInt Format | FStr Format | FChar Char Format\n\nfromList : List Char -> Format\nfromList Nil = End\nfromList ('%' :: 'd' :: cs) = FInt (fromList cs)\nfromList ('%' :: 's' :: cs) = FStr (fromList cs)\nfromList (c :: cs) = FChar c (fromList cs)\n\nPrintfType : Format -> Type\nPrintfType End = String\nPrintfType (FInt rest) = Int -> PrintfType rest\nPrintfType (FStr rest) = String -> PrintfType rest\nPrintfType (FChar c rest) = PrintfType rest\n\nprintf : (fmt: String) -> PrintfType (fromList $ unpack fmt)\nprintf fmt = printFormat (fromList $ unpack fmt) where\n printFormat : (fmt: Format) -> PrintfType fmt\n printFormat fmt = rec fmt \"\" where\n rec : (f: Format) -> String -> PrintfType f\n rec End acc = acc\n rec (FInt rest) acc = \\i: Int => rec rest (acc ++ (show i))\n rec (FStr rest) acc = \\s: String => rec rest (acc ++ s)\n rec (FChar c rest) acc = rec rest (acc ++ (strCons c \"\"))\n\ntest : String\ntest = printf \"The %s is %d\" \"answer\" 42\n\nmain : IO ()\nmain = putStrLn test\n", "meta": {"hexsha": "e56db4dbf1919801e80fbc60cf66654e472c4cd1", "size": 1064, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "test/idris-dev/reg024/reg024.idr", "max_stars_repo_name": "grin-compiler/idris-grin", "max_stars_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_stars_repo_licenses": ["BSD-3-Clause"], "max_stars_count": 36, "max_stars_repo_stars_event_min_datetime": "2019-06-06T10:35:31.000Z", "max_stars_repo_stars_event_max_datetime": "2022-03-21T08:48:30.000Z", "max_issues_repo_path": "test/idris-dev/reg024/reg024.idr", "max_issues_repo_name": "grin-compiler/idris-grin", "max_issues_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_issues_repo_licenses": ["BSD-3-Clause"], "max_issues_count": 4, "max_issues_repo_issues_event_min_datetime": "2019-11-21T20:45:22.000Z", "max_issues_repo_issues_event_max_datetime": "2022-02-02T12:29:23.000Z", "max_forks_repo_path": "test/idris-dev/reg024/reg024.idr", "max_forks_repo_name": "grin-compiler/idris-grin", "max_forks_repo_head_hexsha": "0514e4d41933143223cb685e23f450dcbf3d5593", "max_forks_repo_licenses": ["BSD-3-Clause"], "max_forks_count": 3, "max_forks_repo_forks_event_min_datetime": "2019-06-14T13:14:47.000Z", "max_forks_repo_forks_event_max_datetime": "2019-12-07T06:20:45.000Z", "avg_line_length": 33.25, "max_line_length": 65, "alphanum_fraction": 0.6146616541, "num_tokens": 320, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES", "lm_q1_score": 0.6442251064863697, "lm_q2_score": 0.5467381519846138, "lm_q1q2_score": 0.3522224441824488}} {"text": "module Chapter6\n\nimport Data.Vect\n\n%default total\n\n-- type synonyms\n\nPosition : Type\nPosition = (Double, Double)\n\ntri : Vect 3 Position\ntri = [(0.0, 0.0), (1.0, 2.0), (-23.22, -11.089)]\n\n-- type-level functions\n-- type-level functions are merely functions that return a Type\n\n-- defining functions with a variable number of arguments\n\n\n", "meta": {"hexsha": "428260bd46125597c4808ed907d6eeda367fdb12", "size": 336, "ext": "idr", "lang": "Idris", "max_stars_repo_path": "chapter6/Chapter6.idr", "max_stars_repo_name": "timmyjose-study/tdd-with-idris", "max_stars_repo_head_hexsha": "be2cd6fc4bbcd58cb4e14ed1e22c9cc99aade4d0", "max_stars_repo_licenses": ["Unlicense"], "max_stars_count": null, "max_stars_repo_stars_event_min_datetime": null, "max_stars_repo_stars_event_max_datetime": null, "max_issues_repo_path": "chapter6/Chapter6.idr", "max_issues_repo_name": "timmyjose-study/tdd-with-idris", "max_issues_repo_head_hexsha": "be2cd6fc4bbcd58cb4e14ed1e22c9cc99aade4d0", "max_issues_repo_licenses": ["Unlicense"], "max_issues_count": null, "max_issues_repo_issues_event_min_datetime": null, "max_issues_repo_issues_event_max_datetime": null, "max_forks_repo_path": "chapter6/Chapter6.idr", "max_forks_repo_name": "timmyjose-study/tdd-with-idris", "max_forks_repo_head_hexsha": "be2cd6fc4bbcd58cb4e14ed1e22c9cc99aade4d0", "max_forks_repo_licenses": ["Unlicense"], "max_forks_count": null, "max_forks_repo_forks_event_min_datetime": null, "max_forks_repo_forks_event_max_datetime": null, "avg_line_length": 16.0, "max_line_length": 63, "alphanum_fraction": 0.7023809524, "num_tokens": 94, "lm_name": "Qwen/Qwen-72B", "lm_label": "1. YES\n2. YES\n\n", "lm_q1_score": 0.538983220687684, "lm_q2_score": 0.651354857898194, "lm_q1q2_score": 0.3510693391205374}}