Newest at the top
| 2025-01-13 18:46:02 +0100 | ystael | (~ystael@user/ystael) ystael |
| 2025-01-13 18:42:33 +0100 | <r-sta> | damn real world! |
| 2025-01-13 18:42:28 +0100 | <r-sta> | so it was breaking at some memory hanging exception somewhere away from the loop |
| 2025-01-13 18:42:11 +0100 | <r-sta> | so, just then my computer run out of memory, and the exception is not the loop!" |
| 2025-01-13 18:41:57 +0100 | <r-sta> | man, that is the most nondeterministic thing ever |
| 2025-01-13 18:35:18 +0100 | <r-sta> | at least initially because its in IO the main routine is sequential so you can do printouts after each line, but then it would be bredth first search through everything pure with trace debug which is way harder to keep track of |
| 2025-01-13 18:32:45 +0100 | <r-sta> | how can i tell where the loop is!? |
| 2025-01-13 18:30:50 +0100 | wootehfoot | (~wootehfoo@user/wootehfoot) (Ping timeout: 244 seconds) |
| 2025-01-13 18:29:33 +0100 | <r-sta> | hmm, ok the back thing works, but it takes it to part of the code where there is no loop! |
| 2025-01-13 18:29:14 +0100 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 260 seconds) |
| 2025-01-13 18:28:42 +0100 | ss4 | (~wootehfoo@user/wootehfoot) wootehfoot |
| 2025-01-13 18:27:42 +0100 | <r-sta> | thats ok i never used another language! |
| 2025-01-13 18:27:17 +0100 | <geekosaur> | keep in mind that `let x = x + 1` doesn't do what you think from other languages |
| 2025-01-13 18:27:06 +0100 | <r-sta> | it says, here, your ussposed to use :trace for a start, and then, this error it doesnt like so youl have to go backl |
| 2025-01-13 18:26:55 +0100 | <geekosaur> | it means you have something that evaluates itself |
| 2025-01-13 18:26:47 +0100 | <r-sta> | yeah it even has this special error |
| 2025-01-13 18:26:33 +0100 | <geekosaur> | I should mention that <<loop>> is a special exception that doesn't behave like normal ones; it's kinda manufactured by STG |
| 2025-01-13 18:26:33 +0100 | <r-sta> | Try rerunning with :trace, :back then :list |
| 2025-01-13 18:26:33 +0100 | <r-sta> | Unable to list source for <unknown> |
| 2025-01-13 18:26:32 +0100 | <r-sta> | [<unknown>] ghci> :list |
| 2025-01-13 18:26:32 +0100 | <r-sta> | _exception :: e = _ |
| 2025-01-13 18:26:31 +0100 | <r-sta> | "trades loaded; Stopped in <exception thrown>, <unknown> |
| 2025-01-13 18:26:30 +0100 | <r-sta> | ghci> main |
| 2025-01-13 18:26:30 +0100 | <r-sta> | ghci> :set -fbreak-on-exception |
| 2025-01-13 18:24:53 +0100 | <r-sta> | hmm, :list might be able to help me find ther <<loop>> without needing to step |
| 2025-01-13 18:23:44 +0100 | <r-sta> | based on what iv read i should be able to break and then step through line by line basically |
| 2025-01-13 18:23:15 +0100 | <geekosaur> | https://downloads.haskell.org/ghc/latest/docs/users_guide/ghci.html#the-ghci-debugger might be helpful |
| 2025-01-13 18:22:18 +0100 | <r-sta> | not forwards or backwards stepping to examine variables (i have never done this) |
| 2025-01-13 18:22:03 +0100 | <r-sta> | but it just stops! |
| 2025-01-13 18:21:27 +0100 | <r-sta> | i can insert breaks |
| 2025-01-13 18:21:15 +0100 | <r-sta> | btw geekosaur: the use of repl vs run does indeed not result in a pesky compiled version |
| 2025-01-13 18:17:51 +0100 | <r-sta> | yeah, idk if your going to be able to get the output you were looking for in a super easy way |
| 2025-01-13 18:17:50 +0100 | ash3en | (~Thunderbi@2a03:7846:b6eb:101:93ac:a90a:da67:f207) ash3en |
| 2025-01-13 18:17:21 +0100 | <haskellbridge> | <magic_rb> Ill add this to my ever growing list of side projects |
| 2025-01-13 18:17:11 +0100 | <haskellbridge> | <magic_rb> Looks good |
| 2025-01-13 18:17:10 +0100 | <haskellbridge> | <magic_rb> Okay ill keep llvm-hs-pure in mind |
| 2025-01-13 18:16:22 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 244 seconds) |
| 2025-01-13 18:16:20 +0100 | euleritian | (~euleritia@ip4d17fae8.dynamic.kabel-deutschland.de) |
| 2025-01-13 18:14:50 +0100 | <r-sta> | one of the most complicated pieces of code iv ever seen! |
| 2025-01-13 18:14:05 +0100 | ft | (~ft@p4fc2a354.dip0.t-ipconnect.de) ft |
| 2025-01-13 18:13:40 +0100 | <r-sta> | {btw whats happening here is a combo of utfse and why is your search engine better than mine} |
| 2025-01-13 18:13:06 +0100 | lxsameer | (~lxsameer@Serene/lxsameer) (Ping timeout: 276 seconds) |
| 2025-01-13 18:12:55 +0100 | <r-sta> | https://github.com/llvm-hs/llvm-hs-kaleidoscope |
| 2025-01-13 18:12:48 +0100 | <r-sta> | described as "A minimal LLVM builder" |
| 2025-01-13 18:11:41 +0100 | <r-sta> | https://github.com/sdiehl/kaleidoscope/tree/master |
| 2025-01-13 18:11:40 +0100 | <r-sta> | here |
| 2025-01-13 18:10:31 +0100 | <r-sta> | Stephen Diehl looks like your man |
| 2025-01-13 18:10:14 +0100 | <r-sta> | https://stackoverflow.com/questions/27696261/good-type-design-in-haskell-for-the-ast-of-a-simple-l… |
| 2025-01-13 18:09:10 +0100 | <r-sta> | that might be much easier to work with if you need the AST without the FFI |
| 2025-01-13 18:08:44 +0100 | <r-sta> | dont know if you seen this too https://hackage.haskell.org/package/llvm-hs-pure |