rewritten entry biblio

main.bib

@@ -264,7 +264,10 @@ url={http://www.cduce.org/papers/frisch_phd.pdf}
 	AUTHOR = {Giuseppe Castagna and Victor Lanvin and Tommaso Petrucciani and Jeremy G.~Siek},
 	TITLE = {Gradual Typing: a New Perspective},
         JOURNAL = {Proc.\ ACM Program.\ Lang.},
-        VOLUME = {3, Article 16},
+        VOLUME = {3},
+        month = jan,
+        articleno = {16},
+        numpages = {32},
         NUMBER = {POPL\,'19  46th ACM Symposium on Principles of Programming Languages},
           doi = {10.1145/3290329},
 	YEAR = {2019},

scp-reviews-2108.tex

@@ -304,7 +304,7 @@ system to past work, but it would be nice to characterize the technical
 connections as well. For example, the proof system for the
 \(\vdash^{Path}\) judgment is very similar to the proof system used in
 {[}23{]} (Figures 4 \& 7 there).
-\begin{answer} Kim Compare
+\begin{answer}
 Done (see: p29l??-??)
 \end{answer}
 The approach of generalizing the type environment to
@@ -756,7 +756,7 @@ the new contributions.
     of intersection types for functions (and probably the same for
     languages that allow such kind of explicit annotations), that
     corresponds to one pass on the function for each arrow in the
-    intersection.(shall we add such a sentence somewhere?)
+    intersection.
 
     Likewise ... TO BE CONTINUED BY KIM (fixpoint, memoization ...).
   \end{answer}