Timeline for Question about "Type checking a multithreaded functional language with session types" by Vasconcelos et al
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Nov 3, 2015 at 16:02 | history | bounty ended | Christophe De Troyer | ||
| S Nov 3, 2015 at 16:02 | history | notice removed | Christophe De Troyer | ||
| Nov 3, 2015 at 16:02 | vote | accept | Christophe De Troyer | ||
| Nov 3, 2015 at 14:53 | answer | added | Stefan | timeline score: 4 | |
| Oct 29, 2015 at 0:31 | comment | added | vzn | while apropos/ significant think this question could be entirely radically rewritten to be clearer, self-contained & more concise. think you should cite the key rules/ lines in question (only a few are relevant). and you use $\Gamma, \Sigma$ without defining them at all. the question uses the specialized syntax of the paper. one would have to parse a large part of the paper to figure out their syntax, but your question can probably described in a far simpler way. my general thinking on this though is that arbitrary uses of lambdas has to be restricted in any strong typing system. | |
| Oct 28, 2015 at 23:20 | comment | added | Christophe De Troyer | Yes, that is my own example. The paper uses slightly different syntax. I'm thinking haskell/lambda calculus. | |
| Oct 28, 2015 at 21:25 | comment | added | vzn | is Listing 1 your own example, not from the paper? it would be helpful to analyze this complicated setup further in Computer Science Chat | |
| Oct 28, 2015 at 3:02 | history | tweeted | twitter.com/StackCompSci/status/659203591798943744 | ||
| S Oct 27, 2015 at 21:34 | history | bounty started | Christophe De Troyer | ||
| S Oct 27, 2015 at 21:34 | history | notice added | Christophe De Troyer | Draw attention | |
| Oct 25, 2015 at 14:28 | history | edited | Christophe De Troyer | CC BY-SA 3.0 |
added 158 characters in body
|
| Oct 25, 2015 at 14:23 | history | asked | Christophe De Troyer | CC BY-SA 3.0 |