62 the soundness proof and corrected it (we actually gave three solutions to the problem [6]). Urban |
62 the soundness proof and corrected it (we actually gave three solutions to the problem [6]). Urban |
63 formalised and also corrected the main result of his PhD, a logical relation argument for |
63 formalised and also corrected the main result of his PhD, a logical relation argument for |
64 establishing strong normalisation of cut-elimination in classical logic. Other |
64 establishing strong normalisation of cut-elimination in classical logic. Other |
65 people have used Nominal Isabelle too: |
65 people have used Nominal Isabelle too: |
66 |
66 |
|
67 <H3>PhD Theses using Nominal Isabelle</H3> |
|
68 |
67 <ul> |
69 <ul> |
68 <li> |
70 <li> |
69 <A HREF="http://www.it.uu.se/katalog/jesperb/" target="_top">Jesper Bengtson</A> |
71 <A HREF="http://www.itu.dk/people/jebe/">Jesper Bengtson</A> (now a professor at ITU in Copenhagen) |
|
72 finished his PhD about this in 2010 with a large formalisation in Nominal Isabelle. |
|
73 He also formalised CCS (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>). |
|
74 </li> |
|
75 </ul> |
|
76 |
|
77 |
|
78 <H3>Journal and Conference Papers using Nominal Isabelle</H3> |
|
79 |
|
80 <ul> |
|
81 <li> |
|
82 <A HREF="http://www.itu.dk/people/jebe/">Jesper Bengtson</A> |
70 and <A HREF="http://user.it.uu.se/~joachim/" target="_top">Joachim Parrow</A> |
83 and <A HREF="http://user.it.uu.se/~joachim/" target="_top">Joachim Parrow</A> |
71 used Nominal Isabelle to verify the theory of the |
84 used Nominal Isabelle to verify the theory of the |
72 pi-calculus. They formalised the proof that bisimulation is a congruence (both |
85 pi-calculus. They formalised the proof that bisimulation is a congruence (both |
73 for late and early operational semantics) available |
86 for late and early operational semantics) available |
74 <a href="http://afp.sourceforge.net/entries/Pi_Calculus.shtml">here</a>. Moreover they formalised the proof |
87 <a href="http://afp.sourceforge.net/entries/Pi_Calculus.shtml">here</a>. Moreover they formalised the proof |
75 that all late bisimilar processes are early bisimilar. The corresponding |
88 that all late bisimilar processes are early bisimilar. The corresponding |
76 papers were presented at FOSSACS'07 and SOS'07. They also used Nominal Isabelle |
89 papers were presented at FOSSACS'07 and SOS'07. They also used Nominal Isabelle |
77 to formalise their work on Psi-calculi, available |
90 to formalise their work on Psi-calculi, available |
78 <a href="http://afp.sourceforge.net/entries/Psi_Calculi.shtml">here</a>. This was |
91 <a href="http://afp.sourceforge.net/entries/Psi_Calculi.shtml">here</a>. This was |
79 presented at LICS 2009 and LICS 2010. |
92 presented at LICS 2009 and LICS 2010. |
80 Jesper finished his PhD about this in 2010 with a large formalisation in Nominal Isabelle. |
93 |
81 He also formalised CCS (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>). |
|
82 All formalisations are part of the <A HREF="http://afp.sourceforge.net/">AFP</A>. |
94 All formalisations are part of the <A HREF="http://afp.sourceforge.net/">AFP</A>. |
83 <li> |
95 <li> |
|
96 |
84 <A HREF="http://www.ccs.neu.edu/home/samth/" target="_top">Sam Tobin-Hochstadt</A>, a student |
97 <A HREF="http://www.ccs.neu.edu/home/samth/" target="_top">Sam Tobin-Hochstadt</A>, a student |
85 of <A HREF="http://www.ccs.neu.edu/home/matthias/" target="_top">Matthias Felleisen</A>, used |
98 of <A HREF="http://www.ccs.neu.edu/home/matthias/" target="_top">Matthias Felleisen</A>, used |
86 Nominal Isabelle to formalise their work on Typed Scheme. This was presented at POPL'08. |
99 Nominal Isabelle to formalise their work on Typed Scheme. This was presented at POPL'08. |
87 |
100 |
88 <li> |
101 <li> |
129 of the lambda calculus using Nominal Isabelle 2. This work appeared at CPP'11. |
142 of the lambda calculus using Nominal Isabelle 2. This work appeared at CPP'11. |
130 |
143 |
131 <li> |
144 <li> |
132 <A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A> |
145 <A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A> |
133 used Nominal2 for formalising Launchbury's natural semantics for lazy evaluation. This is part |
146 used Nominal2 for formalising Launchbury's natural semantics for lazy evaluation. This is part |
134 of the <A HREF="http://afp.sourceforge.net/entries/Launchbury.shtml">AFP</A>. (Archive of Formal Proofs) |
147 of the <A HREF="http://afp.sourceforge.net/entries/Launchbury.shtml">AFP</A>. |
135 |
148 |
136 <li> |
149 <li> |
137 <A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A> |
150 <A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A> |
138 formalised Gödel's Incompletness Theorems using Nominal2. This work |
151 formalised Gödel's Incompletness Theorems using Nominal2. This work |
139 appeared in the Journal of Automated Reasoning in 2015. |
152 appeared in the Journal of Automated Reasoning in 2015 and is part of the |
|
153 <A HREF="https://www.isa-afp.org/browser_info/current/AFP/Incompleteness/SyntaxN.html">AFP</A>. |
|
154 |
|
155 <li> |
|
156 <A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A> |
|
157 formalised a second Part of Gödel's Incompletness Theorems using Nominal2. This is part of the |
|
158 <A HREF="https://www.isa-afp.org/browser_info/current/AFP/Goedel_HFSet_Semanticless/SyntaxN.html">AFP</A>. |
|
159 |
140 |
160 |
141 <li> |
161 <li> |
142 <A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A> |
162 <A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A> |
143 proved the correctness of a GHC compiler transformation using Nominal2. |
163 proved the correctness of a GHC compiler transformation using Nominal2. |
144 This work appeared at the |
164 This work appeared at the |