To give an idea of the types of papers and topics that will be discussed at ECOOP’22, we present s collection of previous research and presentations:
- Dahl-Nygaard Senior Prize Keynote by Kim B. Bruce: https://www.youtube.com/watch?v=Khv9nxlHhtY
- Idris 2: Quantitative Type Theory in Practice by Edwin Brady: https://www.youtube.com/watch?v=msTsTKRT9xs
- Compositional Programming by Weixin Zhang: https://www.youtube.com/watch?v=fBlHIXWIPhw
- Gradual Program Analysis for Null Pointers by Sam Estep: https://www.youtube.com/watch?v=iYsM1hjrahY
- Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis by Philipp Schubert: https://www.youtube.com/watch?v=yLe8NhBX2nI
- Multiparty Languages: The Choreographic and Multitier Cases by Fabrizio Montesi: https://www.youtube.com/watch?v=zx07I-f7ZME
We reached out to ECOOP’21 authors asking about any additional information they would like to share on their research or if there were any updates. Here is an extract of their inspirational answers:
Maj, Petr ; Siek, Konrad ; Kovalenko, Alexander ; Vitek, Jan
we have already submitted a followup paper […]. And have plans for more. In fact too many plans, too little time:)
So this was a reasonably long effort as we planned to use it for the years to come since the beginning so we checked and double checked everything.
He, Dongjie ; Lu, Jingbo ; Gao, Yaoqing ; Xue, Jingling
The work published in ECOOP’21 aims to improve the performance of pointer analysis while preserving most of its precision. TURNER, the prototype implementation in the paper, is now open source at http://www.cse.unsw.edu.au/~corg/turner/.
Recently, I have found that TURNER’s modularity property could be exploited to further improve its performance. So, I plan to extend TURNER to a Journal version. After the submission of ECOOP’21, I have spent a few more months improving our in-house pointer analysis framework and have now made it as precise as DOOP and plan to contribute it to the community. I wish my engineering efforts not only benefit myself but also other researchers who are interested in this topic.
Servetto, Marco ; Zucca, Elena
"The research work culminating in “λ-Based Object-Oriented Programming” started as a silly and fun programming challenge: In Java, can we code in a true OO way while never ever using the keywords ‘new’, ‘class’ and ‘static’?
This challenge made us discover many interesting ways to use Lambdas to instantiate rich objects, and with our surprise, a meaningful and elegant programming style emerged from this core language, that just so happens to be at the same time an elegant OO core and a minimal extension of lambda calculus with a class/interface/behaviour table. The most surprising thing of all, is that the resulting core language and style is actually usable in practice; that is, we discovered an elegant functional pure OO language hidden inside the Java behemoth.
Right now, we are finding ways to statically verify code written in this simple core. This allows us to focus on verifying pure OO features like dynamic dispatch in an open world setting without being distracted by any of the imperative features Java inherits from C.
I’m also working on L42, a new programming language. A good link to it is http://l42.is/tutorial.xhtml
- Collection of videos: https://www.youtube.com/playlist?list=PLyrlk8Xaylp6P3MKkGw-rOO3fQMz4kbJs
- Collection of videos: https://www.youtube.com/playlist?list=PL8n7DQk-CfiLpT2DEeY-uXikPcoRsShnj