Home freenode/#haskell: Logs Calendar

Logs: freenode/#haskell

←Prev  Next→
Page 1 .. 680 681 682 683 684 685 686 687 688 689 690 .. 5022
502,152 events total
2020-10-16 18:29:25 × thir quits (~thir@p200300f27f02580074cf2a3fa9ab5ee7.dip0.t-ipconnect.de) (Ping timeout: 240 seconds)
2020-10-16 18:29:31 <larou> oh, they call it "programable routing"
2020-10-16 18:29:40 alp_ joins (~alp@2a01:e0a:58b:4920:70f4:103a:daad:d45e)
2020-10-16 18:30:27 <larou> or "programable interconnections"
2020-10-16 18:30:36 ephemera_ joins (~E@122.34.1.187)
2020-10-16 18:30:40 <larou> they just have a 2d grid, so its quite simple
2020-10-16 18:30:41 wroathe_ is now known as wroathe
2020-10-16 18:30:50 <hyperisco> dsal, mustache is oddly confused with both JSON and CLI
2020-10-16 18:30:56 <larou> with just 4 wires and the switching block
2020-10-16 18:30:58 <hyperisco> but those sorts of templates, yes
2020-10-16 18:31:03 <dsal> It's just the first thing I thought of.
2020-10-16 18:31:29 <hyperisco> not savvy on templating languages anymore
2020-10-16 18:31:43 <dsal> My last web thing was in elm, which doesn't do templating language at all. :/
2020-10-16 18:31:57 <larou> "Each CLB is tied to a switch matrix to access the general routing structure. The switch matrix provides programmable multiplexers, which are used to select the signals in a given routing channel and thereby connect vertical and horizontal lines."
2020-10-16 18:32:02 <larou> https://towardsdatascience.com/introduction-to-fpga-and-its-architecture-20a62c14421c
2020-10-16 18:32:15 <larou> i was thinking something like this might be doable with arrows
2020-10-16 18:32:29 <larou> but on an arbitrary architecture, not just a 2d grid
2020-10-16 18:32:50 DataComputist joins (~lumeng@static-50-43-26-251.bvtn.or.frontiernet.net)
2020-10-16 18:34:09 <larou> and obviously, with arbitrary types of data sent along the edges, not just the binary or floating point signals - since we have functions in a program instead of logic units, or configurable logic blocks, as in a FPGA
2020-10-16 18:34:12 <hyperisco> maybe I should just whip up my own with megaparsec lol, isn't that complicated oO
2020-10-16 18:34:28 hackage tasty-lua 0.2.3.1 - Write tests in Lua, integrate into tasty. https://hackage.haskell.org/package/tasty-lua-0.2.3.1 (tarleb)
2020-10-16 18:34:38 geekosaur joins (82659a0e@host154-014.vpn.uakron.edu)
2020-10-16 18:35:13 × heatsink quits (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net) (Remote host closed the connection)
2020-10-16 18:35:18 conal joins (~conal@64.71.133.70)
2020-10-16 18:36:32 <monochrom> larou: The value of your messages to #haskell is decreasing rapidly. I ask you to stop.
2020-10-16 18:37:57 hackage hslua-module-text 0.3.0.1 - Lua module for text https://hackage.haskell.org/package/hslua-module-text-0.3.0.1 (tarleb)
2020-10-16 18:38:08 <larou> ah, your right, im getting distracted - sorry. it was just an afterthought to a discussion about the "fanout" operation yesterday
2020-10-16 18:38:28 <larou> i guess id be better off trying to grapple with the arrows framework in a less complex application
2020-10-16 18:38:30 <hyperisco> why are all template processors dependent on Aeson lol
2020-10-16 18:38:34 tabaqui joins (~tabaqui@46.39.45.136)
2020-10-16 18:38:38 <tabaqui> hey all
2020-10-16 18:38:51 <monochrom> aeson is our go-to JSON library.
2020-10-16 18:39:57 <tabaqui> Do you know a good tutorial for recursion-schemes?
2020-10-16 18:40:28 hackage hslua-module-system 0.2.2.1 - Lua module wrapper around Haskell's System module. https://hackage.haskell.org/package/hslua-module-system-0.2.2.1 (tarleb)
2020-10-16 18:40:38 <phadej> tabaqui: there isn't
2020-10-16 18:40:47 <monochrom> Yes IMO but my opinion includes only learning catamorphisms and anamorphisms, and ignoring the rest.
2020-10-16 18:41:07 <phadej> that's not wrong :)
2020-10-16 18:41:28 hackage hakyll-process 0.0.2.0 - Hakyll compiler for arbitrary external processes. https://hackage.haskell.org/package/hakyll-process-0.0.2.0 (jhmcstanton)
2020-10-16 18:41:28 <tabaqui> well, -morphisms are pretty easy, but I'm interesting in Fi'ed datatype
2020-10-16 18:41:35 <tabaqui> *Fix'ed datatypes
2020-10-16 18:41:43 <phadej> you don't need Fix for recursion schemes
2020-10-16 18:42:14 <tabaqui> I want to combine them to build AST interpreter
2020-10-16 18:42:36 <phadej> you don
2020-10-16 18:42:37 <phadej> 't
2020-10-16 18:42:44 <phadej> use concretely recursive types
2020-10-16 18:42:54 <tabaqui> nah, it's boring:)
2020-10-16 18:43:01 × kuribas quits (~user@ptr-25vy0i94ezsnlaecbal.18120a2.ip6.access.telenet.be) (Quit: ERC (IRC client for Emacs 26.3))
2020-10-16 18:43:20 <monochrom> in which case something like http://www.cs.ox.ac.uk/publications/publication2360-abstract.html
2020-10-16 18:43:31 <phadej> you get barely any mileage from recursion s chemes for an AST
2020-10-16 18:43:44 <phadej> about everything interesting isn't just cata
2020-10-16 18:44:04 × ephemera_ quits (~E@122.34.1.187) (Ping timeout: 246 seconds)
2020-10-16 18:44:05 × jneira_ quits (~jneira@80.30.100.250) (Ping timeout: 240 seconds)
2020-10-16 18:44:21 <monochrom> and http://www.cs.ru.nl/B.Jacobs/PAPERS/JR.pdf
2020-10-16 18:44:23 ephemera_ joins (~E@122.34.1.187)
2020-10-16 18:44:33 <tabaqui> monochrom: seems good, thanks
2020-10-16 18:44:34 jneira_ joins (~jneira@191.red-37-10-143.dynamicip.rima-tde.net)
2020-10-16 18:45:25 × thc202 quits (~thc202@unaffiliated/thc202) (Ping timeout: 240 seconds)
2020-10-16 18:45:42 heatsink joins (~heatsink@107-136-5-69.lightspeed.sntcca.sbcglobal.net)
2020-10-16 18:46:20 <monochrom> Gibbon's work with the Fix type IIRC. Jacob's is general math.
2020-10-16 18:46:23 <tabaqui> phadej: why not, it looks very promising
2020-10-16 18:46:50 <monochrom> But I certainly needed Jacob's to prepare me. It also teaches many other things.
2020-10-16 18:48:16 kenran joins (~maier@b2b-37-24-119-190.unitymedia.biz)
2020-10-16 18:48:41 <monochrom> And now, for "just one step away from cata/ana", I present to you http://www.cs.ox.ac.uk/ralf.hinze/publications/index.html#P32
2020-10-16 18:50:11 <zincy__> What is/are Jacobs?
2020-10-16 18:50:26 <monochrom> Paper author
2020-10-16 18:50:47 <larou> "adjoint folds and unfolds" !?
2020-10-16 18:50:48 × jneira_ quits (~jneira@191.red-37-10-143.dynamicip.rima-tde.net) (Read error: Connection reset by peer)
2020-10-16 18:50:52 <monochrom> I guess Jacobs's
2020-10-16 18:50:54 <monochrom> Yeah
2020-10-16 18:50:59 <tabaqui> monochrom: till now, I've only learned this: https://www.youtube.com/watch?v=TEvDaKg4XXA
2020-10-16 18:51:19 jneira_ joins (~jneira@80.30.100.102)
2020-10-16 18:51:33 <larou> if there is a way to make anything less appealing it is to add the word "adjoint" to it...
2020-10-16 18:51:34 <geekosaur> "Jacobs'" if we're being pedantic. Except usage is still changing and not settled
2020-10-16 18:51:43 <geekosaur> yay natural language
2020-10-16 18:51:45 <zincy__> Can someone unpack this sentence "The distinction between algebra and coalgebra pervades CS .. described usually in terms of data versus machines?
2020-10-16 18:51:53 <monochrom> Well mine was a simple typo.
2020-10-16 18:52:15 <tabaqui> fun fact: haskell programmers don't laugh at function "anaL"
2020-10-16 18:52:23 <monochrom> Don't attribute to rich linguistic studies what can be attributed to typos and ELS.
2020-10-16 18:52:27 hackage hslua-aeson 1.0.3.1 - Allow aeson data types to be used with lua. https://hackage.haskell.org/package/hslua-aeson-1.0.3.1 (tarleb)
2020-10-16 18:52:51 <monochrom> Like, as well, "Gibbon's work with Fix" should be "Gibbon's works with Fix", too.
2020-10-16 18:52:53 <larou> zincy__ : its a nod towards folds and unfolds
2020-10-16 18:53:01 <larou> i think...
2020-10-16 18:53:07 <monochrom> err and there I have a new typo of a spurrious space
2020-10-16 18:53:11 <zincy__> Oh thanks
2020-10-16 18:53:13 <larou> slightly confused about this being in terms of "algebras"
2020-10-16 18:53:37 × kenran quits (~maier@b2b-37-24-119-190.unitymedia.biz) (Ping timeout: 264 seconds)
2020-10-16 18:54:08 <monochrom> I have a feeling that future archaelogical linguistics in the 25th century looking at my IRC log and trying to theorize on my peculiar writing "style", any theory except honest typo.
2020-10-16 18:54:28 Jesin joins (~Jesin@pool-72-66-101-18.washdc.fios.verizon.net)
2020-10-16 18:55:03 <larou> hmm, actually, if "coalgegras" is going to include "things that dont have constructors" including *modifiers*, im not sure the fold vs unfold perspective isnt stretched beyond applicability
2020-10-16 18:55:20 <geekosaur> one hopes their corpus consists of a bit more than just your IRC messages :)
2020-10-16 18:56:32 <geekosaur> (then again, if they've any sense at all they'll see English and give up :)
2020-10-16 18:56:51 <monochrom> zincy__: Do you already know of "Let F be a functor. An F-algebra is defined as: ..."?
2020-10-16 18:57:22 <monochrom> Err actually I have a more elementary way. Do you already know of both foldr and unfoldr for []?
2020-10-16 18:58:02 albertus1 joins (~seb@x4db5a1e1.dyn.telefonica.de)
2020-10-16 18:58:10 <monochrom> foldr is a logical conclusion of "data [] a = [] | a : [] a" so it feels like data.
2020-10-16 18:58:33 Guest88073 is now known as lep-delete
2020-10-16 18:58:55 <monochrom> unfoldr is a little program that emits a list, it feels like a list-producing machine. You can even ascribe an "internal state" to it.
2020-10-16 18:59:59 thir joins (~thir@p200300f27f02580074cf2a3fa9ab5ee7.dip0.t-ipconnect.de)
2020-10-16 19:00:10 <larou> i get confused about list being CoFree
2020-10-16 19:00:17 <zincy__> Yeah I only know about foldr and unfoldr

All times are in UTC.