Newest at the top
| 2024-06-30 20:47:16 +0200 | nhar | (~noah@user/nhar) |
| 2024-06-30 20:47:16 +0200 | nhar | (~noah@99-112-0-41.lightspeed.tukrga.sbcglobal.net) (Changing host) |
| 2024-06-30 20:46:41 +0200 | nhar | (~noah@99-112-0-41.lightspeed.tukrga.sbcglobal.net) |
| 2024-06-30 20:46:22 +0200 | mikess | (~mikess@user/mikess) (Ping timeout: 268 seconds) |
| 2024-06-30 20:43:54 +0200 | nhar | (~noah@user/nhar) (Ping timeout: 268 seconds) |
| 2024-06-30 20:42:06 +0200 | wootehfoot | (~wootehfoo@user/wootehfoot) |
| 2024-06-30 20:41:26 +0200 | TheCoffeMaker | (~TheCoffeM@user/thecoffemaker) (Ping timeout: 268 seconds) |
| 2024-06-30 20:40:36 +0200 | TheCoffeMaker_ | (~TheCoffeM@200.114.213.75) |
| 2024-06-30 20:39:35 +0200 | Maxdamantus | (~Maxdamant@user/maxdamantus) (Ping timeout: 264 seconds) |
| 2024-06-30 20:38:03 +0200 | Maxdaman1us | (~Maxdamant@user/maxdamantus) |
| 2024-06-30 20:37:28 +0200 | L29Ah | (~L29Ah@wikipedia/L29Ah) |
| 2024-06-30 20:33:37 +0200 | cheater_ | cheater |
| 2024-06-30 20:33:35 +0200 | cheater | (~Username@user/cheater) (Ping timeout: 264 seconds) |
| 2024-06-30 20:30:51 +0200 | cheater_ | (~Username@user/cheater) |
| 2024-06-30 20:27:14 +0200 | aaronv | (~aaronv@user/aaronv) |
| 2024-06-30 20:25:19 +0200 | nhar | (~noah@user/nhar) |
| 2024-06-30 20:25:19 +0200 | nhar | (~noah@99-112-0-41.lightspeed.tukrga.sbcglobal.net) (Changing host) |
| 2024-06-30 20:25:14 +0200 | L29Ah | (~L29Ah@wikipedia/L29Ah) () |
| 2024-06-30 20:24:03 +0200 | <nhar> | monochrom: thanks so much! i'll take a look. My goal is to implement the algorithms using recursion-schemes |
| 2024-06-30 20:21:33 +0200 | Sgeo | (~Sgeo@user/sgeo) |
| 2024-06-30 20:20:46 +0200 | <monochrom> | I wrote https://www.cs.utoronto.ca/~trebla/CSCC24-2024-Summer/11-type-inference.html for my course. |
| 2024-06-30 20:19:53 +0200 | <nhar> | Thanks! |
| 2024-06-30 20:19:50 +0200 | <nhar> | monochrom: ooo! Ok, I'll have a look. Most of the material on hidnley-milner is a bit obtuse. |
| 2024-06-30 20:19:33 +0200 | mreh | (~matthew@host86-160-168-12.range86-160.btcentralplus.com) (Ping timeout: 268 seconds) |
| 2024-06-30 20:19:01 +0200 | leah2 | (~leah@vuxu.org) |
| 2024-06-30 20:18:57 +0200 | <monochrom> | Does not. |
| 2024-06-30 20:18:45 +0200 | Lord_of_Life_ | Lord_of_Life |
| 2024-06-30 20:18:38 +0200 | <nhar> | monochrom: I'll have to pull it off the shelf. If you, by chance, remember: does the term-level syntax require type annotations? I'm implementing a language and I'd rather my user's not need type annotations |
| 2024-06-30 20:18:19 +0200 | Sgeo | (~Sgeo@user/sgeo) (Read error: Connection reset by peer) |
| 2024-06-30 20:17:31 +0200 | <nhar> | mreh: nice! Well, good luck! |
| 2024-06-30 20:16:29 +0200 | wootehfoot | (~wootehfoo@user/wootehfoot) (Ping timeout: 240 seconds) |
| 2024-06-30 20:16:27 +0200 | Lord_of_Life | (~Lord@user/lord-of-life/x-2819915) (Ping timeout: 264 seconds) |
| 2024-06-30 20:15:48 +0200 | Lord_of_Life_ | (~Lord@user/lord-of-life/x-2819915) |
| 2024-06-30 20:15:26 +0200 | <monochrom> | Chapter 22 "type reconstruction" is type inference. |
| 2024-06-30 20:13:30 +0200 | <mreh> | nhar: not quite, mainly taking out all the boilerplate of buffering data and then sprinkling some types on top |
| 2024-06-30 20:12:35 +0200 | <nhar> | mreh: oh fun...so you're leveraging the HS type sytem to make sure you're generating GLSL type-correct code? |
| 2024-06-30 20:11:51 +0200 | <mreh> | so it's strong but not static |
| 2024-06-30 20:11:27 +0200 | <nhar> | monochrom: yeah. TaPL (types and programing languages?) The typing systems there start with simply-typed lambda calculus and kinda ends at F-w (or F*...can't remember which)...I don't think he covers hindley-milner |
| 2024-06-30 20:11:11 +0200 | <mreh> | nhar: well, there are implicit casts, but the types are enforced by the compiler |
| 2024-06-30 20:10:16 +0200 | <monochrom> | Err maybe not, I am not reading carefully. |
| 2024-06-30 20:10:15 +0200 | <nhar> | mreh: is GLSL a strongly typed language? |
| 2024-06-30 20:09:28 +0200 | <monochrom> | I have not heard of the name "co-contextual", but Pierce's TaPL definitely presents type inference that way. |
| 2024-06-30 20:08:58 +0200 | <mreh> | I might make something a bit more abstract for writing the shader code |
| 2024-06-30 20:07:42 +0200 | <mreh> | it's only inputs to the pipeline that I'm going to record at the type level |
| 2024-06-30 20:06:21 +0200 | <monochrom> | Ugh type-level GLSL haha |
| 2024-06-30 20:06:18 +0200 | leah2 | (~leah@vuxu.org) (Ping timeout: 255 seconds) |
| 2024-06-30 20:06:16 +0200 | <nhar> | I'm learning how to implement a hindley-milner-damas type inference algorithm and it's hurting my brain...thought this might be a simpler solution... |
| 2024-06-30 20:05:43 +0200 | <nhar> | Rembane: thanks! |
| 2024-06-30 20:05:33 +0200 | <nhar> | has anyone ever heard of co-contextual type systems? https://www.informatik.uni-marburg.de/~seba/publications/cocontextual-type-checking.pdf |
| 2024-06-30 20:05:11 +0200 | <mreh> | nhar: ^ |