Squeak-dev March 2019

squeak-dev@lists.squeakfoundation.org

26 participants
85 discussions

unused method removal in Caffeine
by Craig Latta 09 Apr '19

09 Apr '19

Hi-- I got the unused-method-removal stuff from Spoon running in SqueakJS, and I wrote a blog post about it: https://thiscontext.com/2019/03/25/the-big-shake-out I'd love to hear of any use cases people are interested in pursuing. thanks, -C -- Craig Latta Black Page Digital Amsterdam :: San Francisco craig(a)blackpagedigital.com +31 6 2757 7177 + 1 415 287 3547

3 3

Modern way to load a picture from the web?
by H. Hirzel 02 Apr '19

02 Apr '19

Hello What is a good modern way in Squeak to load a picture from the web? I am looking for an equivalent of | pngPicURL aStream | pngPicURL := 'https://upload.wikimedia.org/wikipedia/commons/thumb/1/11/Squeak-x11.png/61…'. aStream := HTTPSocket httpGet: pngPicURL. (ImageReadWriter formFromStream: aStream) asMorph openInHand And answer or just comments are welcome. Thank you. Kind regards Hannes

5 10

Fw: network browser
by Robert 31 Mar '19

31 Mar '19

‐‐‐‐‐‐‐ Original Message ‐‐‐‐‐‐‐ On Saturday, March 30, 2019 12:33 AM, Robert <robert.withers(a)protonmail.com> wrote: > Is there any sort of network browser for Squeak? > > Best, > Robert

2 3

Re: [squeak-dev] The Inbox: TraitsTests-pre.19.mcz
by Jakob Reschke 28 Mar '19

28 Mar '19

Just in case anyone wonders: a workaround is to make the uses list empty #(), this will remove the traits from a class. And if I would not use traits, I wouldn't have known that. I use them to give objects a common protocol based on a few would-be template methods that are "required" by the trait (as described in the paper). I don't like to impose abstract superclasses if there is no common, mandatory state, such as instance variables. Often my trait methods are general defaults that implement the protocol simply, but not efficiently. This allows the user classes to adopt the protocol quickly, based on a few "primitives" (not real primitives, but the template methods). More efficient implementations can replace the trait methods later. But it gets you started. For the same reason I provide traits if I want others to implement that protocol in their objects. At the same time, the traits "document" that protocol, like interfaces in statically typed languages. Abstract superclasses fulfill the same requirements, but seem to dictate inheritance. While you can also just copy their methods, the copies will be out of date when these methods are changed in the abstract superclass. Am Do., 28. März 2019 um 16:22 Uhr schrieb <patrick.rein(a)hpi.uni-potsdam.de >: > The test documents the (currently not working) workflow for removing a > trait from a class by simply removing the "uses:" line from the class > definition. To make this work, we would have to make the > Class>>#subclass:instanceVariableNames:classVariableNames:poolDictionaries:category: > method aware of traits. The method would have to reset the trait > composition as > Class>>#subclass:uses:instanceVariableNames:classVariableNames:poolDictionaries:category: > currently does. Potentially, the change could also be embedded deeper in > the class creation code to avoid that duplication and make the other class > creation methods more robust. > > I am hesitant, as I am aware that traits have been prevented from being > integrated more deeply so far. At the same time, the described missing > workflow has already led users to struggle with using traits in the first > place. So as they are part of the system I would rather improve their > usability. Any other oppinions? > > Bests > Patrick > > >Patrick Rein uploaded a new version of TraitsTests to project The Inbox: > >http://source.squeak.org/inbox/TraitsTests-pre.19.mcz > > > >==================== Summary ==================== > > > >Name: TraitsTests-pre.19 > >Author: pre > >Time: 28 March 2019, 3:30:48.769796 pm > >UUID: 2ed07595-23e5-5f41-92ef-17c27ad0a017 > >Ancestors: TraitsTests-ul.18 > > > >Adds a test case for removing traits from a class by simply executing a > class creation method without a trait composition. This does currently not > yet work. > > > >=============== Diff against TraitsTests-ul.18 =============== > > > >Item was added: > >+ ----- Method: TraitTest>>expectedFailures (in category 'failures') ----- > >+ expectedFailures > >+ > >+ ^ #(testRemoveTraitBySimpleClassDefinition)! > > > >Item was added: > >+ ----- Method: TraitTest>>testRemoveTraitBySimpleClassDefinition (in > category 'testing') ----- > >+ testRemoveTraitBySimpleClassDefinition > >+ > >+ | classAv1 classAv2 | > >+ classAv1 := self createClassNamed: #TraitTestMethodClassA > superclass: Object uses: T1. > >+ classAv2 := self createClassNamed: #TraitTestMethodClassA > superclass: Object. > >+ > >+ self assert: classAv1 == classAv2. > >+ self assert: classAv2 traits isEmpty.! > > > >Item was added: > >+ ----- Method: TraitsTestCase>>createClassNamed:superclass: (in category > 'utility') ----- > >+ createClassNamed: aSymbol superclass: aClass > >+ | class | > >+ class := aClass > >+ subclass: aSymbol > >+ instanceVariableNames: '' > >+ classVariableNames: '' > >+ poolDictionaries: '' > >+ category: self categoryName. > >+ self createdClassesAndTraits add: class. > >+ ^class! > > > > > >

1 0

The Trunk: System-eem.1058.mcz
by commits＠source.squeak.org 28 Mar '19

28 Mar '19

Eliot Miranda uploaded a new version of System to project The Trunk: http://source.squeak.org/trunk/System-eem.1058.mcz ==================== Summary ==================== Name: System-eem.1058 Author: eem Time: 28 March 2019, 11:03:09.932094 am UUID: ebedf3e7-56ae-464d-a7fc-c507e370e4e7 Ancestors: System-eem.1057 A long-needed refactor of vmStatisticsReportString into vmStatisticsReportOn: =============== Diff against System-eem.1057 =============== Item was added: + ----- Method: SmalltalkImage>>vmStatisticsReportOn: (in category 'vm statistics') ----- + vmStatisticsReportOn: str + "(Workspace new contents: Smalltalk vmStatisticsReportString) + openLabel: 'VM Statistics'" + "StringHolderView + open: (StringHolder new contents: Smalltalk vmStatisticsReportString) + label: 'VM Statistics'" + + | params oldSpaceEnd youngSpaceEnd memorySize fullGCs fullGCTime fullGCCompactionTime incrGCs incrGCTime tenureCount upTime + upTime2 fullGCs2 fullGCTime2 incrGCs2 incrGCTime2 tenureCount2 freeSize youngSize used spur timeReporter idleMs idleMs2 codeCompactionTime codeCompactionsOrNil codeCompactionTime2 codeCompactions2 maxParams | + "Pad to protect for a VM that does not answer the expected parameter array" + maxParams := 63. "max position referenced in this method" + params := Array streamContents: [ :strm | + strm nextPutAll: Smalltalk getVMParameters. + [strm position < maxParams] whileTrue: [strm nextPut: nil]]. + oldSpaceEnd := params at: 1. + youngSpaceEnd := params at: 2. + memorySize := params at: 3. + fullGCs := params at: 7. + fullGCTime := params at: 8. + incrGCs := params at: 9. + incrGCTime := params at: 10. + tenureCount := params at: 11. + fullGCCompactionTime := params at: 18. + codeCompactionsOrNil := params at: 62. + codeCompactionTime := params at: 63. + + upTime := (params at: 20) ~= 0 "utcMicrosecondClock at startup in later Spur VMs" + ifTrue: [Time utcMicrosecondClock - (params at: 20) + 500 // 1000] + ifFalse: [Time eventMillisecondClock]. "Fall back on old microsecond clock; Good for 47.5 days" + spur := (params at: 41) + ifNotNil: [ :p | p anyMask: 16] + ifNil: [false]. + timeReporter := [:time| | seconds | + seconds := time / 1000. + seconds >= (60*60*24) + ifTrue: + [str print: seconds / 60 // 60 // 24; nextPut: $d; space; + print: seconds / 60 // 60 \\ 24; nextPut: $h; space] + ifFalse: + [seconds >= (60*60) ifTrue: + [str print: (seconds / 60 // 60); nextPut: $h; space]]. + str + print: (seconds / 60 \\ 60) asInteger; nextPut: $m; space; + print: (seconds \\ 60) asInteger; nextPut: $s]. + str nextPutAll: 'uptime '. + timeReporter value: upTime. + (idleMs := params at: 16) ~= 0 ifTrue: + [str tab; nextPutAll: '(runtime '. + idleMs := idleMs // 1000. + timeReporter value: upTime - idleMs. + str nextPutAll: ', idletime '. + timeReporter value: idleMs. + str nextPut: $)]. + str cr. + + str nextPutAll: 'memory '; + nextPutAll: memorySize asStringWithCommas; nextPutAll: ' bytes'; cr. + str nextPutAll: ' old '; + nextPutAll: oldSpaceEnd asStringWithCommas; nextPutAll: ' bytes ('; + print: oldSpaceEnd / memorySize * 100 maxDecimalPlaces: 1; nextPutAll: '%)'; cr. + + spur ifTrue: + [(youngSize := (params at: 19) * 7 // 5) = 0 ifTrue: [params at: 44]. + youngSize := youngSize roundUpTo: 1024. + str nextPutAll: ' young '; + nextPutAll: youngSize asStringWithCommas; nextPutAll: ' bytes ('; + print: youngSize / memorySize * 100 maxDecimalPlaces: 1; nextPutAll: '%)'; cr. + youngSize := youngSpaceEnd. "used eden" + freeSize := (params at: 54) + (params at: 44) - youngSize. + used := youngSize + oldSpaceEnd - freeSize. + str nextPutAll: ' used '; + nextPutAll: used asStringWithCommas; nextPutAll: ' bytes ('; + print: used / memorySize * 100 maxDecimalPlaces: 1; nextPutAll: '%)'; cr. + str nextPutAll: ' free '; + nextPutAll: freeSize asStringWithCommas; nextPutAll: ' bytes ('; + print: freeSize / memorySize * 100 maxDecimalPlaces: 1; nextPutAll: '%)'; cr] + ifFalse: "Earlier VM and V3 object memory" + [str nextPutAll: ' young '; + nextPutAll: (youngSpaceEnd - oldSpaceEnd) asStringWithCommas; nextPutAll: ' bytes ('; + print: (youngSpaceEnd - oldSpaceEnd / memorySize * 100) maxDecimalPlaces: 1; nextPutAll: '%)'; cr. + str nextPutAll: ' used '; + nextPutAll: youngSpaceEnd asStringWithCommas; nextPutAll: ' bytes ('; + print: (youngSpaceEnd / memorySize * 100) maxDecimalPlaces: 1; nextPutAll: '%)'; cr. + str nextPutAll: ' free '; + nextPutAll: (memorySize - youngSpaceEnd) asStringWithCommas; nextPutAll: ' bytes ('; + print: (memorySize - youngSpaceEnd / memorySize * 100) maxDecimalPlaces: 1; nextPutAll: '%)'; cr]. + + str nextPutAll: 'GCs '; + nextPutAll: (fullGCs + incrGCs) asStringWithCommas. + fullGCs + incrGCs > 0 ifTrue: + [str + nextPutAll: ' ('; + print: upTime / (fullGCs + incrGCs) maxDecimalPlaces: 1; + nextPutAll: ' ms between GCs'. + idleMs > 0 ifTrue: + [str + space; + print: upTime - idleMs / (fullGCs + incrGCs) maxDecimalPlaces: 1; + nextPutAll: ' ms runtime between GCs']. + str nextPut: $)]. + str cr. + str nextPutAll: ' full '; + nextPutAll: fullGCs asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: fullGCTime asStringWithCommas; nextPutAll: ' ms ('; + print: fullGCTime / (upTime - idleMs) * 100 maxDecimalPlaces: 2; + nextPutAll: '% runtime)'; + nextPutAll: ', avg '; print: (fullGCTime / (fullGCs max: 1)) maxDecimalPlaces: 1; nextPutAll: ' ms'. + (spur and: [fullGCCompactionTime ~= 0]) ifTrue: + [str cr; nextPutAll: ' marking '; + nextPutAll: (fullGCTime - fullGCCompactionTime) asStringWithCommas; nextPutAll: ' ms ('; + print: (fullGCTime - fullGCCompactionTime) / fullGCTime * 100 maxDecimalPlaces: 1; + nextPutAll: '%) avg '; print: (fullGCTime - fullGCCompactionTime / (fullGCs max: 1)) maxDecimalPlaces: 1; + nextPutAll: ' ms,'; cr; + nextPutAll: ' compacting '; + nextPutAll: fullGCCompactionTime asStringWithCommas; nextPutAll: ' ms ('; + print: fullGCCompactionTime / fullGCTime * 100 maxDecimalPlaces: 1; + nextPutAll: '%) avg '; print: fullGCCompactionTime / (fullGCs max: 1) maxDecimalPlaces: 1; + nextPutAll: ' ms']. + str cr. + str nextPutAll: (spur ifTrue: [' scavenges '] ifFalse: [' incr ']); + nextPutAll: incrGCs asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: incrGCTime asStringWithCommas; nextPutAll: ' ms ('; + print: incrGCTime / (upTime - idleMs) * 100 maxDecimalPlaces: 2; + nextPutAll: '% runtime), avg '; print: incrGCTime / incrGCs maxDecimalPlaces: 1; nextPutAll: ' ms'; cr. + str nextPutAll: ' tenures '; + nextPutAll: tenureCount asStringWithCommas. + tenureCount = 0 ifFalse: + [spur + ifTrue: [str nextPutAll: ' (avg '; print: tenureCount // (incrGCs max: 1); nextPutAll: ' tenures per scavenge)'] + ifFalse: [str nextPutAll: ' (avg '; print: incrGCs // tenureCount; nextPutAll: ' GCs/tenure)']]. + str cr. + + codeCompactionsOrNil ifNotNil: + [str + nextPutAll: 'Code compactions '; crtab. + codeCompactionsOrNil = 0 + ifTrue: [str + nextPutAll: codeCompactionsOrNil asString; cr] + ifFalse: [str + nextPutAll: codeCompactionsOrNil asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: codeCompactionTime asStringWithCommas; nextPutAll: ' ms ('; + print: codeCompactionTime / (upTime - idleMs) * 100 maxDecimalPlaces: 3; + nextPutAll: '% runtime), avg '; print: codeCompactionTime / codeCompactionsOrNil maxDecimalPlaces: 1; nextPutAll: ' ms'; cr]]. + + LastStats ifNil: [LastStats := Array new: 9] + ifNotNil: [ + LastStats size < 9 ifTrue: + [LastStats := LastStats, (Array new: 9 - LastStats size withAll: 0)]. + upTime2 := upTime - (LastStats at: 1). + fullGCs2 := fullGCs - (LastStats at: 2). + fullGCTime2 := fullGCTime - (LastStats at: 3). + incrGCs2 := incrGCs - (LastStats at: 4). + incrGCTime2 := incrGCTime - (LastStats at: 5). + tenureCount2 := tenureCount - (LastStats at: 6). + idleMs2 := idleMs - (LastStats at: 7). + codeCompactionsOrNil ifNotNil: + [codeCompactions2 := codeCompactionsOrNil - (LastStats at: 8). + codeCompactionTime2 := codeCompactionTime - (LastStats at: 9)]. + + str nextPutAll: self textMarkerForShortReport ; + nextPutAll: (fullGCs2 + incrGCs2) asStringWithCommas. + fullGCs2 + incrGCs2 > 0 ifTrue: + [str + nextPutAll: ' ('; + print: upTime2 // (fullGCs2 + incrGCs2); + nextPutAll: ' ms between GCs'. + idleMs2 > 0 ifTrue: + [str + nextPutAll: ', '; + print: upTime2 - idleMs2 // (fullGCs2 + incrGCs2); + nextPutAll: ' ms runtime between GCs']. + str nextPut: $)]. + str cr. + str nextPutAll: ' uptime '; print: (upTime2 / 1000.0) maxDecimalPlaces: 1; + nextPutAll: ' s, runtime '; print: (upTime2 - idleMs2 / 1000.0) maxDecimalPlaces: 1; + nextPutAll: ' s, idletime '; print: (idleMs2 / 1000.0) maxDecimalPlaces: 1; nextPutAll: ' s'; cr. + str nextPutAll: ' full '; + nextPutAll: fullGCs2 asStringWithCommas. + fullGCs2 + fullGCTime2 > 0 ifTrue: + [str nextPutAll: ' totalling '; nextPutAll: fullGCTime2 asStringWithCommas; nextPutAll: ' ms ('; + print: fullGCTime2 / (upTime2 - idleMs2) * 100 maxDecimalPlaces: 1; + nextPutAll: '% runtime)'. + str nextPutAll: ', avg '; print: fullGCTime2 / (fullGCs2 max: 1) maxDecimalPlaces: 1; nextPutAll: ' ms']. + str cr. + str nextPutAll: (spur ifTrue: [' scavenge '] ifFalse: [' incr ']); + nextPutAll: incrGCs2 asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: incrGCTime2 asStringWithCommas; nextPutAll: ' ms ('; + print: incrGCTime2 / (upTime2 - idleMs2) * 100 maxDecimalPlaces: 1; + nextPutAll: '% runtime), avg '; print: incrGCTime2 / (incrGCs2 max: 1) maxDecimalPlaces: 1; nextPutAll: ' ms'. + str cr. + str nextPutAll: ' tenures '; + nextPutAll: tenureCount2 asStringWithCommas. + tenureCount2 = 0 ifFalse: + [spur + ifTrue: [str nextPutAll: ' (avg '; print: tenureCount2 // (incrGCs2 max: 1); nextPutAll: ' tenures per scavenge)'] + ifFalse: [str nextPutAll: ' (avg '; print: incrGCs2 // tenureCount2; nextPutAll: ' GCs/tenure)']]. + str cr. + codeCompactionsOrNil ifNotNil: + [str nextPutAll: ' code compactions '; + nextPutAll: codeCompactions2 asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: codeCompactionTime2 asStringWithCommas; nextPutAll: ' ms ('; + print: codeCompactionTime2 / (upTime2 - idleMs2) * 100 maxDecimalPlaces: 3; + nextPutAll: '% runtime)'. + codeCompactions2 > 0 ifTrue: + [str nextPutAll: ', avg '; print: codeCompactionTime2 / codeCompactions2 maxDecimalPlaces: 1; nextPutAll: ' ms'; cr.]] + ]. + LastStats := { upTime. fullGCs. fullGCTime. incrGCs. incrGCTime. tenureCount. idleMs. codeCompactionsOrNil. codeCompactionTime } + ! Item was changed: ----- Method: SmalltalkImage>>vmStatisticsReportString (in category 'vm statistics') ----- vmStatisticsReportString "(Workspace new contents: Smalltalk vmStatisticsReportString) openLabel: 'VM Statistics'" "StringHolderView open: (StringHolder new contents: Smalltalk vmStatisticsReportString) label: 'VM Statistics'" + ^String new: 2048 streamContents: [:s| self vmStatisticsReportOn: s]! - | params oldSpaceEnd youngSpaceEnd memorySize fullGCs fullGCTime fullGCCompactionTime incrGCs incrGCTime tenureCount upTime - upTime2 fullGCs2 fullGCTime2 incrGCs2 incrGCTime2 tenureCount2 str freeSize youngSize used spur timeReporter idleMs idleMs2 codeCompactionTime codeCompactionsOrNil codeCompactionTime2 codeCompactions2 maxParams | - "Pad to protect for a VM that does not answer the expected parameter array" - maxParams := 63. "max position referenced in this method" - params := Array streamContents: [ :strm | - strm nextPutAll: Smalltalk getVMParameters. - [strm position < maxParams] whileTrue: [strm nextPut: nil]]. - oldSpaceEnd := params at: 1. - youngSpaceEnd := params at: 2. - memorySize := params at: 3. - fullGCs := params at: 7. - fullGCTime := params at: 8. - incrGCs := params at: 9. - incrGCTime := params at: 10. - tenureCount := params at: 11. - fullGCCompactionTime := params at: 18. - codeCompactionsOrNil := params at: 62. - codeCompactionTime := params at: 63. - - upTime := (params at: 20) ~= 0 "utcMicrosecondClock at startup in later Spur VMs" - ifTrue: [Time utcMicrosecondClock - (params at: 20) + 500 // 1000] - ifFalse: [Time eventMillisecondClock]. "Fall back on old microsecond clock; Good for 47.5 days" - spur := (params at: 41) - ifNotNil: [ :p | p anyMask: 16] - ifNil: [false]. - str := WriteStream on: (String new: 2048). - timeReporter := [:time| | seconds | - seconds := time / 1000. - seconds >= (60*60*24) - ifTrue: - [str print: seconds / 60 // 60 // 24; nextPut: $d; space; - print: seconds / 60 // 60 \\ 24; nextPut: $h; space] - ifFalse: - [seconds >= (60*60) ifTrue: - [str print: (seconds / 60 // 60); nextPut: $h; space]]. - str - print: (seconds / 60 \\ 60) asInteger; nextPut: $m; space; - print: (seconds \\ 60) asInteger; nextPut: $s]. - str nextPutAll: 'uptime '. - timeReporter value: upTime. - (idleMs := params at: 16) ~= 0 ifTrue: - [str tab; nextPutAll: '(runtime '. - idleMs := idleMs // 1000. - timeReporter value: upTime - idleMs. - str nextPutAll: ', idletime '. - timeReporter value: idleMs. - str nextPut: $)]. - str cr. - - str nextPutAll: 'memory '; - nextPutAll: memorySize asStringWithCommas; nextPutAll: ' bytes'; cr. - str nextPutAll: ' old '; - nextPutAll: oldSpaceEnd asStringWithCommas; nextPutAll: ' bytes ('; - print: oldSpaceEnd / memorySize * 100 maxDecimalPlaces: 1; nextPutAll: '%)'; cr. - - spur ifTrue: - [(youngSize := (params at: 19) * 7 // 5) = 0 ifTrue: [params at: 44]. - youngSize := youngSize roundUpTo: 1024. - str nextPutAll: ' young '; - nextPutAll: youngSize asStringWithCommas; nextPutAll: ' bytes ('; - print: youngSize / memorySize * 100 maxDecimalPlaces: 1; nextPutAll: '%)'; cr. - youngSize := youngSpaceEnd. "used eden" - freeSize := (params at: 54) + (params at: 44) - youngSize. - used := youngSize + oldSpaceEnd - freeSize. - str nextPutAll: ' used '; - nextPutAll: used asStringWithCommas; nextPutAll: ' bytes ('; - print: used / memorySize * 100 maxDecimalPlaces: 1; nextPutAll: '%)'; cr. - str nextPutAll: ' free '; - nextPutAll: freeSize asStringWithCommas; nextPutAll: ' bytes ('; - print: freeSize / memorySize * 100 maxDecimalPlaces: 1; nextPutAll: '%)'; cr] - ifFalse: "Earlier VM and V3 object memory" - [str nextPutAll: ' young '; - nextPutAll: (youngSpaceEnd - oldSpaceEnd) asStringWithCommas; nextPutAll: ' bytes ('; - print: (youngSpaceEnd - oldSpaceEnd / memorySize * 100) maxDecimalPlaces: 1; nextPutAll: '%)'; cr. - str nextPutAll: ' used '; - nextPutAll: youngSpaceEnd asStringWithCommas; nextPutAll: ' bytes ('; - print: (youngSpaceEnd / memorySize * 100) maxDecimalPlaces: 1; nextPutAll: '%)'; cr. - str nextPutAll: ' free '; - nextPutAll: (memorySize - youngSpaceEnd) asStringWithCommas; nextPutAll: ' bytes ('; - print: (memorySize - youngSpaceEnd / memorySize * 100) maxDecimalPlaces: 1; nextPutAll: '%)'; cr]. - - str nextPutAll: 'GCs '; - nextPutAll: (fullGCs + incrGCs) asStringWithCommas. - fullGCs + incrGCs > 0 ifTrue: - [str - nextPutAll: ' ('; - print: upTime / (fullGCs + incrGCs) maxDecimalPlaces: 1; - nextPutAll: ' ms between GCs'. - idleMs > 0 ifTrue: - [str - space; - print: upTime - idleMs / (fullGCs + incrGCs) maxDecimalPlaces: 1; - nextPutAll: ' ms runtime between GCs']. - str nextPut: $)]. - str cr. - str nextPutAll: ' full '; - nextPutAll: fullGCs asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: fullGCTime asStringWithCommas; nextPutAll: ' ms ('; - print: fullGCTime / (upTime - idleMs) * 100 maxDecimalPlaces: 2; - nextPutAll: '% runtime)'; - nextPutAll: ', avg '; print: (fullGCTime / (fullGCs max: 1)) maxDecimalPlaces: 1; nextPutAll: ' ms'. - (spur and: [fullGCCompactionTime ~= 0]) ifTrue: - [str cr; nextPutAll: ' marking '; - nextPutAll: (fullGCTime - fullGCCompactionTime) asStringWithCommas; nextPutAll: ' ms ('; - print: (fullGCTime - fullGCCompactionTime) / fullGCTime * 100 maxDecimalPlaces: 1; - nextPutAll: '%) avg '; print: (fullGCTime - fullGCCompactionTime / (fullGCs max: 1)) maxDecimalPlaces: 1; - nextPutAll: ' ms,'; cr; - nextPutAll: ' compacting '; - nextPutAll: fullGCCompactionTime asStringWithCommas; nextPutAll: ' ms ('; - print: fullGCCompactionTime / fullGCTime * 100 maxDecimalPlaces: 1; - nextPutAll: '%) avg '; print: fullGCCompactionTime / (fullGCs max: 1) maxDecimalPlaces: 1; - nextPutAll: ' ms']. - str cr. - str nextPutAll: (spur ifTrue: [' scavenges '] ifFalse: [' incr ']); - nextPutAll: incrGCs asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: incrGCTime asStringWithCommas; nextPutAll: ' ms ('; - print: incrGCTime / (upTime - idleMs) * 100 maxDecimalPlaces: 2; - nextPutAll: '% runtime), avg '; print: incrGCTime / incrGCs maxDecimalPlaces: 1; nextPutAll: ' ms'; cr. - str nextPutAll: ' tenures '; - nextPutAll: tenureCount asStringWithCommas. - tenureCount = 0 ifFalse: - [spur - ifTrue: [str nextPutAll: ' (avg '; print: tenureCount // (incrGCs max: 1); nextPutAll: ' tenures per scavenge)'] - ifFalse: [str nextPutAll: ' (avg '; print: incrGCs // tenureCount; nextPutAll: ' GCs/tenure)']]. - str cr. - - codeCompactionsOrNil ifNotNil: - [str - nextPutAll: 'Code compactions '; crtab. - codeCompactionsOrNil = 0 - ifTrue: [str - nextPutAll: codeCompactionsOrNil asString; cr] - ifFalse: [str - nextPutAll: codeCompactionsOrNil asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: codeCompactionTime asStringWithCommas; nextPutAll: ' ms ('; - print: codeCompactionTime / (upTime - idleMs) * 100 maxDecimalPlaces: 3; - nextPutAll: '% runtime), avg '; print: codeCompactionTime / codeCompactionsOrNil maxDecimalPlaces: 1; nextPutAll: ' ms'; cr]]. - - LastStats ifNil: [LastStats := Array new: 9] - ifNotNil: [ - LastStats size < 9 ifTrue: - [LastStats := LastStats, (Array new: 9 - LastStats size withAll: 0)]. - upTime2 := upTime - (LastStats at: 1). - fullGCs2 := fullGCs - (LastStats at: 2). - fullGCTime2 := fullGCTime - (LastStats at: 3). - incrGCs2 := incrGCs - (LastStats at: 4). - incrGCTime2 := incrGCTime - (LastStats at: 5). - tenureCount2 := tenureCount - (LastStats at: 6). - idleMs2 := idleMs - (LastStats at: 7). - codeCompactionsOrNil ifNotNil: - [codeCompactions2 := codeCompactionsOrNil - (LastStats at: 8). - codeCompactionTime2 := codeCompactionTime - (LastStats at: 9)]. - - str nextPutAll: self textMarkerForShortReport ; - nextPutAll: (fullGCs2 + incrGCs2) asStringWithCommas. - fullGCs2 + incrGCs2 > 0 ifTrue: - [str - nextPutAll: ' ('; - print: upTime2 // (fullGCs2 + incrGCs2); - nextPutAll: ' ms between GCs'. - idleMs2 > 0 ifTrue: - [str - nextPutAll: ', '; - print: upTime2 - idleMs2 // (fullGCs2 + incrGCs2); - nextPutAll: ' ms runtime between GCs']. - str nextPut: $)]. - str cr. - str nextPutAll: ' uptime '; print: (upTime2 / 1000.0) maxDecimalPlaces: 1; - nextPutAll: ' s, runtime '; print: (upTime2 - idleMs2 / 1000.0) maxDecimalPlaces: 1; - nextPutAll: ' s, idletime '; print: (idleMs2 / 1000.0) maxDecimalPlaces: 1; nextPutAll: ' s'; cr. - str nextPutAll: ' full '; - nextPutAll: fullGCs2 asStringWithCommas. - fullGCs2 + fullGCTime2 > 0 ifTrue: - [str nextPutAll: ' totalling '; nextPutAll: fullGCTime2 asStringWithCommas; nextPutAll: ' ms ('; - print: fullGCTime2 / (upTime2 - idleMs2) * 100 maxDecimalPlaces: 1; - nextPutAll: '% runtime)'. - str nextPutAll: ', avg '; print: fullGCTime2 / (fullGCs2 max: 1) maxDecimalPlaces: 1; nextPutAll: ' ms']. - str cr. - str nextPutAll: (spur ifTrue: [' scavenge '] ifFalse: [' incr ']); - nextPutAll: incrGCs2 asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: incrGCTime2 asStringWithCommas; nextPutAll: ' ms ('; - print: incrGCTime2 / (upTime2 - idleMs2) * 100 maxDecimalPlaces: 1; - nextPutAll: '% runtime), avg '; print: incrGCTime2 / (incrGCs2 max: 1) maxDecimalPlaces: 1; nextPutAll: ' ms'. - str cr. - str nextPutAll: ' tenures '; - nextPutAll: tenureCount2 asStringWithCommas. - tenureCount2 = 0 ifFalse: - [spur - ifTrue: [str nextPutAll: ' (avg '; print: tenureCount2 // (incrGCs2 max: 1); nextPutAll: ' tenures per scavenge)'] - ifFalse: [str nextPutAll: ' (avg '; print: incrGCs2 // tenureCount2; nextPutAll: ' GCs/tenure)']]. - str cr. - codeCompactionsOrNil ifNotNil: - [str nextPutAll: ' code compactions '; - nextPutAll: codeCompactions2 asStringWithCommas; nextPutAll: ' totalling '; nextPutAll: codeCompactionTime2 asStringWithCommas; nextPutAll: ' ms ('; - print: codeCompactionTime2 / (upTime2 - idleMs2) * 100 maxDecimalPlaces: 3; - nextPutAll: '% runtime)'. - codeCompactions2 > 0 ifTrue: - [str nextPutAll: ', avg '; print: codeCompactionTime2 / codeCompactions2 maxDecimalPlaces: 1; nextPutAll: ' ms'; cr.]] - ]. - LastStats := { upTime. fullGCs. fullGCTime. incrGCs. incrGCTime. tenureCount. idleMs. codeCompactionsOrNil. codeCompactionTime }. - - ^str contents - !

1 0

Re: [squeak-dev] The Trunk: Collections-pre.822.mcz
by Chris Cunningham 28 Mar '19

28 Mar '19

Hi On Thu, Mar 28, 2019 at 8:15 AM <patrick.rein(a)hpi.uni-potsdam.de> wrote: > Sorry to open this up again. I have progressed well in shuffling things > around. However: While moving the corresponding test cases I noticed that > there is also #isBinary, #isDoIt, #isInfix, #isUnary, #isKeyword, and > #isPvtSelector implemented on Symbol. Given that these all exist, I would > rather keep #asSimpleSetter, #isSimpleSetter, #asSetterSelector in the > Collections package. > > Any other oppinions on that? > isPvtSelector, isUnary, isInfix, isKeyword, isDoIt - all similar to your new isMutator (and all mostly used in MethodFinder, Shout, and occassionally compiler). I'd prefer to see them moved off to tools/system/compiler similarly, although that feeling isn't as strong as some of the other commentators previously. But it is re-enforced by the #isBinary selector. #isBinary is a stinker. First off, it just delegates to #isInfix on Symbol. But it is also on many other classes in Collections, where it deals with wheither or not the stream is a binary stream or not - in other words, completely unrelated to the meaning of #isBinary on Symbol (and shoutParser). I would think pulling this one out for sure from Collections would be good - even better would be to stop using it for this purpose and instead directly use #isInfix. (Although I suspect it is called from packages outside of base Squeak - maybe VMMaker?) If you don't want to move these, I'd be happy too (as long as overall consensus doesn't swing away from this direction). Thanks, cbc > > Bests > Patrick > > >Sounds good to me! > > > >How about the following: I would deprecate #asMutator/#isMutator in favor > of #asSimpleSetter and #isSimpleSetter. At the same time I would move the > #asSimpleSetter up from Symbol to String where #asSetterSelector already > resides. Finally, I would move both pairs of selectors to the Tools (or > System or Compiler?) package (I would rather not keep them scattered across > MorphicExtras and Etoys as common selectors would then also be used by > System). > > > >Bests, > >Patrick > > > >> > >> > >>On Thu, Mar 21, 2019 at 1:03 PM Chris Muller <asqueaker(a)gmail.com> > wrote: > >> > >>My main objection is about growing the "mutator" nomenclature further > >>instead of trimming it back. > >> > >> > >>+1 > >> > >>I'm working on a GraphQL framework. > >>GraphQL has a first-class notion of "mutations". > >> > >>https://graphql.org/learn/queries/ > >> > >>Currently, we have almost zero mention of the word > >>"mutator" in the image. I would appreciate if, instead of germinating > >>the overloading the word, we uproot it and keep the nomenclature for > >>this Smalltalk tooling confined to "getter" and "setter" that we have > >>now. > >> > >> > >>+1 > >> > >>So, instead of #asMutator and #isMutator, how about #asSimpleSetter and > >>#isSimpleSetter? > >> > >> > >>+1 > >> > >> > >>We can end up removing a method instead of adding one. We already > >>have many existing methods which are dealing with this conversion, all > >>of which use the traditional Smalltalk / developer linguisitic of > >>"setter". Browsing through all the "setter" nomenclature we have in a > >>message names browser, including > >> > >>Utilities class>>#getterSelectorFor: > >>Utilities class>>#setterSelectorFor: > >>Utilities class>>#simpleSetterFor: > >> > >>which instruct Etoys users to use existing methods on String, > >>#asSetterSelector or #asSimpleSetter. > >> > >>Of special note is SyntaxMorph>>#isStandardSetterKeyword: which, by > >>its use of a utility-method implementation, acknowledges that this > >>behavior is _application-specific_. > >> > >>I, myself, would just write: > >> > >>someSelector asSimpleSetter = someSelector "same as isMutator / > >>isSimpleSetter" > >> > >>instead of #isSimpleSetter, but can appreciate both styles. They both > >>better avoid the awkwardness of "mutator" as a general, reliable > >>behavior when: > >> > >>#at: isMutator "true" > >> > >>while > >> > >>#at:put: isMutator "false" > >> > >> > >>+1000. Chris is right. isMutator is a mistake. > >> > >> > >>Best, > >>Chris > >> > >> > >> > >>On Thu, Mar 21, 2019 at 1:16 AM <patrick.rein(a)hpi.uni-potsdam.de> wrote: > >>> > >>> Which one are you refering to? I only see Symbol>>#asMutator in > Collections in the method category converting. It is also used in a few > other places beyond generating instance variable accessors. > >>> > >>> Bests, > >>> Patrick > >>> > >>> >#asMutator: is for "generate instVar accessors" code-generation, and > >>> >that's why it's in the Tools package. > >>> > > >>> >IMHO, if #isMutator belongs anywhere, it isn't in Collections. > >>> > > >>> >Regards, > >>> > Chris > >>> > > >>> > > >>> > > >>> >On Wed, Mar 20, 2019 at 3:08 PM Chris Muller <asqueaker(a)gmail.com> > wrote: > >>> >> > >>> >> Assuming a single-keyword is a mutator? Object>>#at: is not a > >>> >> mutator. #indexOf: is not. #first: is not. Obviously many more.. > >>> >> > >>> >> If API balance is the goal of this, perhaps #asMutator should be > >>> >> removed instead. This feels application-specific... > >>> >> > >>> >> On Wed, Mar 20, 2019 at 2:05 PM <commits(a)source.squeak.org> wrote: > >>> >> > > >>> >> > Patrick Rein uploaded a new version of Collections to project The > Trunk: > >>> >> > http://source.squeak.org/trunk/Collections-pre.822.mcz > >>> >> > > >>> >> > ==================== Summary ==================== > >>> >> > > >>> >> > Name: Collections-pre.822 > >>> >> > Author: pre > >>> >> > Time: 20 March 2019, 8:05:20.383677 pm > >>> >> > UUID: 483c4461-cee4-4a4f-82d3-fbc03e7201cc > >>> >> > Ancestors: Collections-dtl.821 > >>> >> > > >>> >> > Adds #isMutator to Symbol which is analogous to asMutator. > >>> >> > > >>> >> > =============== Diff against Collections-dtl.821 =============== > >>> >> > > >>> >> > Item was added: > >>> >> > + ----- Method: Symbol>>isMutator (in category 'testing') ----- > >>> >> > + isMutator > >>> >> > + > >>> >> > + ^ self isKeyword and: [self numArgs = 1]! > >>> >> > > >>> >> > > >>> > > >>> > >> > >> > >> > >>-- > >>_,,,^..^,,,_ > >>best, Eliot --000000000000004a690584a05ffa-- > > > >

1 0

Re: [squeak-dev] The Inbox: TraitsTests-pre.19.mcz
by H. Hirzel 28 Mar '19

28 Mar '19

+1 for improving the usability of traits. --Hannes On 3/28/19, patrick.rein(a)hpi.uni-potsdam.de <patrick.rein(a)hpi.uni-potsdam.de> wrote: > The test documents the (currently not working) workflow for removing a trait > from a class by simply removing the "uses:" line from the class definition. > To make this work, we would have to make the > Class>>#subclass:instanceVariableNames:classVariableNames:poolDictionaries:category: > method aware of traits. The method would have to reset the trait composition > as > Class>>#subclass:uses:instanceVariableNames:classVariableNames:poolDictionaries:category: > currently does. Potentially, the change could also be embedded deeper in the > class creation code to avoid that duplication and make the other class > creation methods more robust. > > I am hesitant, as I am aware that traits have been prevented from being > integrated more deeply so far. At the same time, the described missing > workflow has already led users to struggle with using traits in the first > place. So as they are part of the system I would rather improve their > usability. Any other oppinions? > > Bests > Patrick > >>Patrick Rein uploaded a new version of TraitsTests to project The Inbox: >>http://source.squeak.org/inbox/TraitsTests-pre.19.mcz >> >>==================== Summary ==================== >> >>Name: TraitsTests-pre.19 >>Author: pre >>Time: 28 March 2019, 3:30:48.769796 pm >>UUID: 2ed07595-23e5-5f41-92ef-17c27ad0a017 >>Ancestors: TraitsTests-ul.18 >> >>Adds a test case for removing traits from a class by simply executing a >> class creation method without a trait composition. This does currently not >> yet work. >> >>=============== Diff against TraitsTests-ul.18 =============== >> >>Item was added: >>+ ----- Method: TraitTest>>expectedFailures (in category 'failures') ----- >>+ expectedFailures >>+ >>+ ^ #(testRemoveTraitBySimpleClassDefinition)! >> >>Item was added: >>+ ----- Method: TraitTest>>testRemoveTraitBySimpleClassDefinition (in >> category 'testing') ----- >>+ testRemoveTraitBySimpleClassDefinition >>+ >>+ | classAv1 classAv2 | >>+ classAv1 := self createClassNamed: #TraitTestMethodClassA superclass: >> Object uses: T1. >>+ classAv2 := self createClassNamed: #TraitTestMethodClassA superclass: >> Object. >>+ >>+ self assert: classAv1 == classAv2. >>+ self assert: classAv2 traits isEmpty.! >> >>Item was added: >>+ ----- Method: TraitsTestCase>>createClassNamed:superclass: (in category >> 'utility') ----- >>+ createClassNamed: aSymbol superclass: aClass >>+ | class | >>+ class := aClass >>+ subclass: aSymbol >>+ instanceVariableNames: '' >>+ classVariableNames: '' >>+ poolDictionaries: '' >>+ category: self categoryName. >>+ self createdClassesAndTraits add: class. >>+ ^class! >> >> > >

1 0

The Inbox: Morphic-sjce.1465.mcz
by commits＠source.squeak.org 25 Mar '19

25 Mar '19

A new version of Morphic was added to project The Inbox: http://source.squeak.org/inbox/Morphic-sjce.1465.mcz ==================== Summary ==================== Name: Morphic-sjce.1465 Author: sjce Time: 21 March 2019, 10:43:01.809481 pm UUID: f283ce64-3557-483a-971f-43ad678deef9 Ancestors: Morphic-eem.1464 Trying to open the debugger halo on the resulting window results in a MNU Text>>truncateWithElipsisTo: in HaloMorph>>doDebug:with: Trying to grab the window results in a MNU Text>>truncateTo: in Morph>>nameForUndoWording that needs a similar change =============== Diff against Morphic-eem.1464 =============== Item was changed: ----- Method: HaloMorph>>doDebug:with: (in category 'private') ----- doDebug: evt with: menuHandle "Ask hand to invoke the a debugging menu for my inner target. If shift key is down, immediately put up an inspector on the inner target" | menu | evt shiftPressed ifTrue: [ evt hand removeHalo. ^ innerTarget inspectInMorphic: evt]. menu := innerTarget buildDebugMenu: evt hand. + menu addTitle: (innerTarget externalName asString truncateWithElipsisTo: 40). - menu addTitle: (innerTarget externalName truncateWithElipsisTo: 40). menu popUpEvent: evt in: self world. evt hand removeHalo.! Item was changed: ----- Method: Morph>>nameForUndoWording (in category 'dropping/grabbing') ----- nameForUndoWording "Return wording appropriate to the receiver for use in an undo-related menu item (and perhaps elsewhere)" | aName | aName := self knownName ifNil: [self renderedMorph class name]. + ^ aName asString truncateTo: 24! - ^ aName truncateTo: 24!

7 10

Re: [squeak-dev] The Trunk: Collections-pre.822.mcz
by H. Hirzel 23 Mar '19

23 Mar '19

On 3/22/19, patrick.rein(a)hpi.uni-potsdam.de <patrick.rein(a)hpi.uni-potsdam.de> wrote: > Sounds good to me! > > How about the following: I would deprecate #asMutator/#isMutator in favor of > #asSimpleSetter and #isSimpleSetter. At the same time I would move the > #asSimpleSetter up from Symbol to String where #asSetterSelector already > resides. Finally, I would move both pairs of selectors to the Tools (or > System or Compiler?) package (I would rather not keep them scattered across > MorphicExtras and Etoys as common selectors would then also be used by > System). +1 > Bests, > Patrick > >> >> >>On Thu, Mar 21, 2019 at 1:03 PM Chris Muller <asqueaker(a)gmail.com> wrote: >> >>My main objection is about growing the "mutator" nomenclature further >>instead of trimming it back. >> >> >>+1 >> >>I'm working on a GraphQL framework. >>GraphQL has a first-class notion of "mutations". >> >>https://graphql.org/learn/queries/ >> >>Currently, we have almost zero mention of the word >>"mutator" in the image. I would appreciate if, instead of germinating >>the overloading the word, we uproot it and keep the nomenclature for >>this Smalltalk tooling confined to "getter" and "setter" that we have >>now. >> >> >>+1 >> >>So, instead of #asMutator and #isMutator, how about #asSimpleSetter and >>#isSimpleSetter? >> >> >>+1 >> >> >>We can end up removing a method instead of adding one. We already >>have many existing methods which are dealing with this conversion, all >>of which use the traditional Smalltalk / developer linguisitic of >>"setter". Browsing through all the "setter" nomenclature we have in a >>message names browser, including >> >>Utilities class>>#getterSelectorFor: >>Utilities class>>#setterSelectorFor: >>Utilities class>>#simpleSetterFor: >> >>which instruct Etoys users to use existing methods on String, >>#asSetterSelector or #asSimpleSetter. >> >>Of special note is SyntaxMorph>>#isStandardSetterKeyword: which, by >>its use of a utility-method implementation, acknowledges that this >>behavior is _application-specific_. >> >>I, myself, would just write: >> >>someSelector asSimpleSetter = someSelector "same as isMutator / >>isSimpleSetter" >> >>instead of #isSimpleSetter, but can appreciate both styles. They both >>better avoid the awkwardness of "mutator" as a general, reliable >>behavior when: >> >>#at: isMutator "true" >> >>while >> >>#at:put: isMutator "false" >> >> >>+1000. Chris is right. isMutator is a mistake. >> >> >>Best, >>Chris >> >> >> >>On Thu, Mar 21, 2019 at 1:16 AM <patrick.rein(a)hpi.uni-potsdam.de> wrote: >>> >>> Which one are you refering to? I only see Symbol>>#asMutator in >>> Collections in the method category converting. It is also used in a few >>> other places beyond generating instance variable accessors. >>> >>> Bests, >>> Patrick >>> >>> >#asMutator: is for "generate instVar accessors" code-generation, and >>> >that's why it's in the Tools package. >>> > >>> >IMHO, if #isMutator belongs anywhere, it isn't in Collections. >>> > >>> >Regards, >>> > Chris >>> > >>> > >>> > >>> >On Wed, Mar 20, 2019 at 3:08 PM Chris Muller <asqueaker(a)gmail.com> >>> > wrote: >>> >> >>> >> Assuming a single-keyword is a mutator? Object>>#at: is not a >>> >> mutator. #indexOf: is not. #first: is not. Obviously many more.. >>> >> >>> >> If API balance is the goal of this, perhaps #asMutator should be >>> >> removed instead. This feels application-specific... >>> >> >>> >> On Wed, Mar 20, 2019 at 2:05 PM <commits(a)source.squeak.org> wrote: >>> >> > >>> >> > Patrick Rein uploaded a new version of Collections to project The >>> >> > Trunk: >>> >> > http://source.squeak.org/trunk/Collections-pre.822.mcz >>> >> > >>> >> > ==================== Summary ==================== >>> >> > >>> >> > Name: Collections-pre.822 >>> >> > Author: pre >>> >> > Time: 20 March 2019, 8:05:20.383677 pm >>> >> > UUID: 483c4461-cee4-4a4f-82d3-fbc03e7201cc >>> >> > Ancestors: Collections-dtl.821 >>> >> > >>> >> > Adds #isMutator to Symbol which is analogous to asMutator. >>> >> > >>> >> > =============== Diff against Collections-dtl.821 =============== >>> >> > >>> >> > Item was added: >>> >> > + ----- Method: Symbol>>isMutator (in category 'testing') ----- >>> >> > + isMutator >>> >> > + >>> >> > + ^ self isKeyword and: [self numArgs = 1]! >>> >> > >>> >> > >>> > >>> >> >> >> >>-- >>_,,,^..^,,,_ >>best, Eliot --000000000000004a690584a05ffa-- > >

2 1

[CfP] DLS 2019 - 15th Dynamic Languages Symposium, co-located with SPLASH 2019 Call for Papers
by Tim Felgentreff 23 Mar '19

23 Mar '19

DLS 2019 - 15th Dynamic Languages Symposium Co-located with SPLASH 2019, October 22, Athens, Greece https://conf.researchr.org/home/dls-2019 Follow us @dynlangsym Dynamic Languages play a fundamental role in today’s world of software, from the perspective of research and practice. Languages such as JavaScript, R, and Python are vehicles for cutting edge research as well as building widely used products and computational tools. The 15th Dynamic Languages Symposium (DLS) at SPLASH 2019 is the premier forum for researchers and practitioners to share research and experience on all aspects on dynamic languages. DLS 2019 invites high quality papers reporting original research and experience related to the design, implementation, and applications of dynamic languages. Areas of interest are generally empirical studies, language design, implementation, and runtimes, which includes but is not limited to: - innovative language features - innovative implementation techniques - innovative applications - development environments and tools - experience reports and case studies - domain-oriented programming - late binding, dynamic composition, and run-time adaptation - reflection and meta-programming - software evolution - language symbiosis and multi-paradigm languages - dynamic optimization - interpretation, just-in-time and ahead-of-time compilation - soft/optional/gradual typing - hardware support - educational approaches and perspectives - semantics of dynamic languages - frameworks and languages for the Cloud and the IoT Submission Details Submissions must neither be previously published nor under review at other events. DLS 2019 uses a single-blind, two-phase reviewing process. Papers are assumed to be in one of the following categories: Research Papers: describe work that advances the current state of the art Experience Papers: describe insights gained from substantive practical applications that should be of a broad interest Dynamic Pearls: describe a known idea in an appealing way to remind the community and capture a reader’s interest The program committee will evaluate each paper based on its relevance, significance, clarity, and originality. The paper category needs to be indicated during submission, and papers are judged accordingly. Papers are to be submitted electronically at https://dls19.hotcrp.com/ in PDF format. Submissions must be in the ACM SIGPLAN conference acmart format, 10 point font, and should not exceed 12 pages. Please see full details in the instructions for authors available at: https://conf.researchr.org/home/dls-2019#Instructions-for-Authors DLS 2019 will run a two-phase reviewing process to help authors make their final papers the best that they can be. Accepted papers will be published in the ACM Digital Library and will be freely available for one month, starting two weeks before the event. Important Deadlines Abstract Submission: May 29, 2019 Paper Submission: June 5, 2019 First Phase Notification: July 3, 2019 Final Notifications: August 14, 2019 Camera Ready: August 28, 2019 All deadlines are 23:59 AoE (UTC-12h). AUTHORS TAKE NOTE: The official publication date is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of your conference. The official publication date affects the deadline for any patent filings related to published work. Program CommitteeAlexandre Bergel, University of Chile Carl Friedrich Bolz-Tereick, Heinrich-Heine-Universität Düsseldorf Chris Seaton, Oracle Labs David Chisnall, Microsoft Research Elisa Gonzalez Boix, Vrije Universiteit Brussel Gregor Richards, University of Waterloo Guido Chari, Czech Technical University Hannes Payer, Google James Noble, Victoria University of Wellington Jeremy Singer, University of Glasgow Joe Gibbs Politz, University of California San Diego Juan Fumero, The University of Manchester Julien Ponge, Red Hat Mandana Vaziri, IBM Research Manuel Serrano, Inria Marc Feeley, Université de Montréal Mark Marron, Microsoft Research Na Meng, Virginia Tech Nick Papoulias, Université Grenoble Alpes Richard Roberts, Victoria University of Wellington Sam Tobin-Hochstadt, Indiana University Sarah Mount, Aston University Sébastien Doeraene, École polytechnique fédérale de Lausanne William Cook, University of Texas at Austin Program Chair Stefan Marr, University of Kent, United Kingdom

1 0

← Newer
1
2
3
4
5
6
7
8
9
Older →