Newest at the top
| 2025-01-27 10:43:35 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 244 seconds) |
| 2025-01-27 10:42:41 +0100 | pabs3 | (~pabs3@user/pabs3) pabs3 |
| 2025-01-27 10:39:58 +0100 | machinedgod | (~machinedg@d108-173-18-100.abhsia.telus.net) machinedgod |
| 2025-01-27 10:38:48 +0100 | machinedgod | (~machinedg@d108-173-18-100.abhsia.telus.net) (Quit: leaving) |
| 2025-01-27 10:38:25 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 248 seconds) |
| 2025-01-27 10:35:59 +0100 | alp | (~alp@2001:861:8ca0:4940:94ba:2e4d:2c57:ff61) |
| 2025-01-27 10:34:59 +0100 | kuribas | (~user@ptr-17d51en30430ldpieyz.18120a2.ip6.access.telenet.be) kuribas |
| 2025-01-27 10:34:05 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-01-27 10:20:32 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-01-27 10:19:49 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 244 seconds) |
| 2025-01-27 10:18:19 +0100 | chele | (~chele@user/chele) chele |
| 2025-01-27 10:15:29 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-01-27 10:05:51 +0100 | <lisbeths`> | like what if you want a purely functional programming language to go into smartdust computers with very low computing power |
| 2025-01-27 10:03:34 +0100 | <lisbeths`> | This is about making a very small purely functional language in the order of under 8 megabytes |
| 2025-01-27 10:03:30 +0100 | merijn | (~merijn@77.242.116.146) (Ping timeout: 246 seconds) |
| 2025-01-27 10:03:16 +0100 | <lisbeths`> | indeed |
| 2025-01-27 10:03:01 +0100 | <probie> | So can a turing machine |
| 2025-01-27 10:02:46 +0100 | <lisbeths`> | binary lambda calculus can bootstraps system F or any type system that you'd like |
| 2025-01-27 10:02:28 +0100 | <probie> | System F with type equality |
| 2025-01-27 10:00:57 +0100 | <lisbeths`> | dminuoso: system fc? |
| 2025-01-27 10:00:33 +0100 | simplystuart | (~simplystu@c-75-75-152-164.hsd1.pa.comcast.net) |
| 2025-01-27 09:59:19 +0100 | Fischmiep | (~Fischmiep@user/Fischmiep) Fischmiep |
| 2025-01-27 09:58:49 +0100 | Fischmiep | (~Fischmiep@user/Fischmiep) (Quit: ZNC - https://znc.in) |
| 2025-01-27 09:51:15 +0100 | tnt2 | tnt1 |
| 2025-01-27 09:51:15 +0100 | tnt1 | (~Thunderbi@user/tnt1) (Ping timeout: 246 seconds) |
| 2025-01-27 09:50:12 +0100 | tnt2 | (~Thunderbi@user/tnt1) tnt1 |
| 2025-01-27 09:49:51 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 246 seconds) |
| 2025-01-27 09:45:41 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-01-27 09:40:54 +0100 | emmanuelux_ | (~emmanuelu@user/emmanuelux) (Quit: au revoir) |
| 2025-01-27 09:39:28 +0100 | merijn | (~merijn@77.242.116.146) merijn |
| 2025-01-27 09:38:47 +0100 | <dminuoso> | By extension that would include things like ConstraintKinds |
| 2025-01-27 09:38:24 +0100 | euleritian | (~euleritia@ip4d17fae8.dynamic.kabel-deutschland.de) |
| 2025-01-27 09:37:31 +0100 | euleritian | (~euleritia@ip4d17fae8.dynamic.kabel-deutschland.de) (Read error: Connection reset by peer) |
| 2025-01-27 09:37:22 +0100 | <dminuoso> | Just wondering whether "purely functional parts" includes all of GADTs. |
| 2025-01-27 09:37:14 +0100 | tnt2 | (~Thunderbi@user/tnt1) (Ping timeout: 260 seconds) |
| 2025-01-27 09:36:12 +0100 | <dminuoso> | lisbeths`: Do you just compile system FC to binary lambda calculus then? |
| 2025-01-27 09:35:56 +0100 | acidjnk | (~acidjnk@p200300d6e7283f58c4cea7af3a5e8af9.dip0.t-ipconnect.de) acidjnk |
| 2025-01-27 09:35:43 +0100 | tnt1 | (~Thunderbi@user/tnt1) tnt1 |
| 2025-01-27 09:34:03 +0100 | tnt1 | (~Thunderbi@user/tnt1) (Ping timeout: 244 seconds) |
| 2025-01-27 09:32:49 +0100 | <lisbeths`> | It should be compatible with the purely functional parts |
| 2025-01-27 09:32:45 +0100 | tnt2 | (~Thunderbi@user/tnt1) tnt1 |
| 2025-01-27 09:30:51 +0100 | <dminuoso> | How much of Haskell do you support? |
| 2025-01-27 09:30:37 +0100 | <dminuoso> | Sounds like a fun project |
| 2025-01-27 09:20:49 +0100 | Smiles | (uid551636@id-551636.lymington.irccloud.com) Smiles |
| 2025-01-27 09:17:15 +0100 | <lisbeths`> | so it can be embedded into haskell and haskell can be embedded into it |
| 2025-01-27 09:16:55 +0100 | <lisbeths`> | I wrote a language that compiles to binary lambda calculus |
| 2025-01-27 09:16:20 +0100 | <probie> | s/with pen/without pen/ |
| 2025-01-27 09:16:08 +0100 | <probie> | What does "very familiar" mean? I probably can't read a non-trivial expression and reduce with pen and paper (or a computer) |
| 2025-01-27 09:15:54 +0100 | xelxebar | (~xelxebar@wilsonb.com) xelxebar |
| 2025-01-27 09:14:49 +0100 | <lisbeths`> | are people in #haskell very familiar with binary lambda calculus? |