Logs: freenode/#haskell
| 2020-11-19 16:16:33 | <dminuoso> | % :set -Wno-error |
| 2020-11-19 16:16:33 | <yahb> | dminuoso: ; <no location info>: warning: unrecognised warning flag: -Wno-error |
| 2020-11-19 16:16:35 | <dminuoso> | Mmm |
| 2020-11-19 16:16:45 | <dolio> | There's no `no-` for those for some reason. |
| 2020-11-19 16:16:52 | × | northman_ quits (~textual@204.111.252.124) (Quit: Textual IRC Client: www.textualapp.com) |
| 2020-11-19 16:17:02 | <[exa]> | dminuoso: I guess there's no better way, the indented stream itself is a series of commands encoded in the spaces...so what. :] |
| 2020-11-19 16:17:03 | × | raehik quits (~raehik@cpc95906-rdng25-2-0-cust156.15-3.cable.virginm.net) (Read error: Connection reset by peer) |
| 2020-11-19 16:17:19 | <dminuoso> | [exa]: Well I can always throw `indents` at it! |
| 2020-11-19 16:17:41 | → | raehik joins (~raehik@cpc95906-rdng25-2-0-cust156.15-3.cable.virginm.net) |
| 2020-11-19 16:18:21 | <boxscape> | hm I suppose if -Wno-warn existed the intuitive interpretation would be that it turns off warnings alltogether, and then it would be unclear if -Wno-error should put warnings into -Wwarn mode or into -Wno-warn mode |
| 2020-11-19 16:18:44 | → | northman_ joins (~textual@204.111.252.124) |
| 2020-11-19 16:19:36 | → | invaser joins (~Thunderbi@31.148.23.125) |
| 2020-11-19 16:19:51 | × | northman_ quits (~textual@204.111.252.124) (Client Quit) |
| 2020-11-19 16:20:12 | → | larou joins (5eae2591@gateway/web/cgi-irc/kiwiirc.com/ip.94.174.37.145) |
| 2020-11-19 16:20:17 | <larou> | hello! |
| 2020-11-19 16:20:42 | <boxscape> | hi |
| 2020-11-19 16:20:46 | → | huskyhaskell joins (~user@2001:9b1:29fe:fc00:55d8:279e:df7e:2d64) |
| 2020-11-19 16:20:52 | <larou> | I have code!! |
| 2020-11-19 16:21:10 | <[exa]> | dminuoso: careful not to end up with python. :D |
| 2020-11-19 16:21:16 | <larou> | no i dont, i only have rumours of code |
| 2020-11-19 16:21:28 | → | northman_ joins (~northman@204.111.252.124) |
| 2020-11-19 16:21:45 | ← | huskyhaskell parts (~user@2001:9b1:29fe:fc00:55d8:279e:df7e:2d64) () |
| 2020-11-19 16:22:08 | <larou> | i have a new type of tree |
| 2020-11-19 16:22:17 | × | howdoi quits (uid224@gateway/web/irccloud.com/x-zkpwgkjicmhndtdh) (Quit: Connection closed for inactivity) |
| 2020-11-19 16:22:25 | <larou> | its better than normal trees |
| 2020-11-19 16:22:41 | <larou> | it has upwards branches |
| 2020-11-19 16:22:48 | <larou> | iv been trying to do it for ages |
| 2020-11-19 16:22:55 | [exa] | briefly recalls "normal" trees |
| 2020-11-19 16:23:08 | <larou> | yeah, those have only downwards branches |
| 2020-11-19 16:23:32 | <larou> | these are way better |
| 2020-11-19 16:23:34 | <[exa]> | I mean the nature ones |
| 2020-11-19 16:24:03 | <larou> | never mind your vacant wonderings |
| 2020-11-19 16:24:42 | <larou> | they typecheck and everything |
| 2020-11-19 16:24:45 | <boxscape> | does it have upwards as well as downward branches or only upwards branches? |
| 2020-11-19 16:24:45 | → | knupfer joins (~Thunderbi@200116b82cfb87004c47b2fffe20891d.dip.versatel-1u1.de) |
| 2020-11-19 16:24:45 | × | knupfer quits (~Thunderbi@200116b82cfb87004c47b2fffe20891d.dip.versatel-1u1.de) (Client Quit) |
| 2020-11-19 16:25:01 | hackage | git-lfs 1.1.1 - git-lfs protocol https://hackage.haskell.org/package/git-lfs-1.1.1 (JoeyHess) |
| 2020-11-19 16:25:05 | <larou> | sure, its not just an upside down tree... |
| 2020-11-19 16:25:08 | → | knupfer joins (~Thunderbi@200116b82cfb8700fd61a7f6e9856548.dip.versatel-1u1.de) |
| 2020-11-19 16:25:14 | <boxscape> | ah, good |
| 2020-11-19 16:25:24 | <larou> | i put functions on them |
| 2020-11-19 16:25:30 | <larou> | at the branches |
| 2020-11-19 16:25:41 | <larou> | MIMO functions (multiple inputs multiple outputs) |
| 2020-11-19 16:25:58 | <larou> | just one input and one output argument, that are HLists |
| 2020-11-19 16:25:59 | boxscape | thinks the upwards branches should be called "roots" |
| 2020-11-19 16:26:13 | <larou> | original! |
| 2020-11-19 16:26:20 | → | p-core joins (~Thunderbi@2001:718:1e03:5128:2ab7:7f35:48a1:8515) |
| 2020-11-19 16:26:38 | <larou> | i call them output edges |
| 2020-11-19 16:26:43 | → | jneira joins (02896ac0@gateway/web/cgi-irc/kiwiirc.com/ip.2.137.106.192) |
| 2020-11-19 16:26:47 | <larou> | inputs go at the leafs |
| 2020-11-19 16:27:09 | <larou> | and they do the cyclic thing perfectly!!! |
| 2020-11-19 16:27:20 | <merijn> | So...graphs? |
| 2020-11-19 16:27:21 | <larou> | they are a list, instead of a free thing |
| 2020-11-19 16:27:34 | × | cocreature quits (~cocreatur@eirene.uberspace.de) (Read error: Connection reset by peer) |
| 2020-11-19 16:27:34 | <larou> | meijn: no they are trees |
| 2020-11-19 16:27:41 | <larou> | they just have lookup tables |
| 2020-11-19 16:27:49 | <larou> | but its just the same |
| 2020-11-19 16:27:50 | <merijn> | trees are graphs |
| 2020-11-19 16:28:02 | <larou> | but graphs can be cyclic, while trees cant |
| 2020-11-19 16:28:04 | <merijn> | They're just a more boring subset of graphs (i.e. on without cycles) |
| 2020-11-19 16:28:08 | <larou> | thats what makes them trees not graphs |
| 2020-11-19 16:28:11 | <larou> | and this is a tree |
| 2020-11-19 16:28:12 | → | cocreature joins (~cocreatur@eirene.uberspace.de) |
| 2020-11-19 16:28:31 | × | Mrkz71 quits (c1ef2595@193-239-37-149.ksi-system.net) (Remote host closed the connection) |
| 2020-11-19 16:28:33 | <larou> | so... not graphs... |
| 2020-11-19 16:28:40 | <larou> | i have also "sparks" |
| 2020-11-19 16:28:47 | <larou> | these are the bits that make them not graphs |
| 2020-11-19 16:28:58 | <larou> | when you see a cycle, you must make a spark |
| 2020-11-19 16:29:01 | <larou> | it is a state |
| 2020-11-19 16:29:06 | <[exa]> | larou: data structure folks demand a precise written definition |
| 2020-11-19 16:29:11 | × | justan0theruser quits (~justanoth@unaffiliated/justanotheruser) (Ping timeout: 272 seconds) |
| 2020-11-19 16:29:21 | <merijn> | [exa]: non-data structure folk too :p |
| 2020-11-19 16:29:41 | <larou> | it goes to an output instead of to the input variable, this is externally stored, as a state, and fed back in at the input at the next itteration |
| 2020-11-19 16:30:07 | <larou> | it would have been imposible to reference its current value to calculate itself at this iteration, so it has to be from the last |
| 2020-11-19 16:30:13 | <larou> | thats why we get "spark states" |
| 2020-11-19 16:30:51 | × | cosimone quits (~cosimone@2001:b07:ae5:db26:d849:743b:370b:b3cd) (Quit: cosimone) |
| 2020-11-19 16:31:01 | <[exa]> | like seriously, this sounds like the random rnn-generated paper about quantum physics. Get a piece of LaTeX and write it down, with examples and pics. |
| 2020-11-19 16:31:13 | → | heatsink joins (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net) |
| 2020-11-19 16:31:18 | <larou> | [exa]: its definition is an extension of the GADT for list, in that it has extra params on the thing being consed to. also, there is another record to the datatype which just wraps itself, but has a constraint that checks to see the sparks are correct in preventing cycles |
| 2020-11-19 16:31:49 | <larou> | oh you want the code, hang on |
| 2020-11-19 16:32:27 | × | enoq quits (~textual@194-208-146-143.lampert.tv) (Quit: Textual IRC Client: www.textualapp.com) |
| 2020-11-19 16:33:06 | <larou> | here |
| 2020-11-19 16:33:07 | <larou> | https://pastebin.com/raw/Kq05pARC |
| 2020-11-19 16:34:50 | <larou> | and here; https://pastebin.com/raw/gHZaze9F |
| 2020-11-19 16:34:51 | <[exa]> | on which line are the trees and sparks? |
| 2020-11-19 16:35:04 | <larou> | in the 2nd paste, its "Net" |
| 2020-11-19 16:35:07 | × | Ariakenom quits (~Ariakenom@h-98-128-229-104.NA.cust.bahnhof.se) (Quit: Leaving) |
| 2020-11-19 16:35:26 | → | Ariakenom joins (~Ariakenom@h-98-128-229-104.NA.cust.bahnhof.se) |
| 2020-11-19 16:35:50 | × | kritzefitz quits (~kritzefit@fw-front.credativ.com) (Remote host closed the connection) |
| 2020-11-19 16:36:13 | <[exa]> | ok cool, does it work? |
| 2020-11-19 16:36:14 | <larou> | now here i can specify the same graph, and using the definition of the input output pairs broken by designating "Sparks" |
| 2020-11-19 16:36:28 | <larou> | then, it will return a graph which passes the matrix test |
| 2020-11-19 16:36:33 | <larou> | ie, is not cyclic |
| 2020-11-19 16:36:42 | <larou> | this is the constraint on the CloseNet constructor |
| 2020-11-19 16:36:58 | <larou> | so you can, if you specify the correct sparks, as this check ensures you must |
| 2020-11-19 16:37:04 | × | jakob_ quits (~textual@p200300f49f162200c400a7daff5c73c4.dip0.t-ipconnect.de) (Ping timeout: 240 seconds) |
| 2020-11-19 16:38:01 | <larou> | you add functions to your net any which old way, and ensure that you have a way in mind to break the cycles (where you put the sparks, which inputs matched with outputs you do not pass as internal edges |
| 2020-11-19 16:38:03 | <larou> | ) |
| 2020-11-19 16:38:15 | <larou> | [exa]: i didnt make a graph yet |
| 2020-11-19 16:38:36 | <larou> | i need to shuffle them so the inputs to outputs are well ordered in the list of functions |
All times are in UTC.