From: Ralf Jung <post@ralfj.de>
Date: Tue, 14 Jun 2016 07:24:32 +0000 (+0200)
Subject: ICFP paper has been accepted :D
X-Git-Url: https://git.ralfj.de/web.git/commitdiff_plain/5b058ae029d31997f46e99fdedb2cc1f17a10622?hp=137e993d13a4d057503a859b70f6eaea144ca3c2

ICFP paper has been accepted :D
---

diff --git a/research/publications.html b/research/publications.html
index 7bd3f84..0140db2 100644
--- a/research/publications.html
+++ b/research/publications.html
@@ -8,7 +8,7 @@ slug: Publications
 <ul><li>
   <b>Higher-Order Ghost State</b><br/>
   Ralf Jung, Robbert Krebbers, Lars Birkedal, Derek Dreyer<br>
-  <i>Under Submission</i><br>
+  In <a href="http://conf.researchr.org/home/icfp-2016">ICFP 2015</a>: 21st ACM SIGPLAN International Conference on Functional Programming<br>
   [<a href="http://plv.mpi-sws.org/iris/hogs.pdf">paper</a>]
 </li></ul>
 
@@ -17,14 +17,14 @@ slug: Publications
 <ul><li>
   <b>Unifying Worlds and Resources</b><br/>
   Ralf Jung, Derek Dreyer<br>
-  In HOPE 2015: 4th ACM SIGPLAN Workshop on Higher-Order Programming with Effects<br>
+  In <a href="http://users-cs.au.dk/birke/hope-2015/">HOPE 2015</a>: 4th ACM SIGPLAN Workshop on Higher-Order Programming with Effects<br>
   [<a href="https://www.youtube.com/watch?v=9Dyna88piek&amp;list=PLnqUlCo055hX6SsmMr1AmW6quMjvdMPvK&amp;index=10" target="_blank">talk</a>] [<a href="iris/talk-hope2015.pdf">talk (slides)</a>]
 </li></ul>
 
 <ul><li>
   <b>Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning</b><br/>
   Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, Derek Dreyer<br>
-  In POPL 2015: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages<br>
+  In <a href="http://popl.mpi-sws.org/2015/">POPL 2015</a>: 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages<br>
   [<a href="http://plv.mpi-sws.org/iris/paper.pdf">paper</a>] [<a href="http://plv.mpi-sws.org/iris/">project website (appendix, Coq)</a>] [<a href="iris/talk-popl2015.pdf">talk (slides)</a>]
 </li></ul>