83 the soundness proof and corrected it (we actually gave three solutions to the problem [6]). Urban |
83 the soundness proof and corrected it (we actually gave three solutions to the problem [6]). Urban |
84 formalised and also corrected the main result of his PhD, a logical relation argument for |
84 formalised and also corrected the main result of his PhD, a logical relation argument for |
85 establishing strong normalisation of cut-elimination in classical logic. Other |
85 establishing strong normalisation of cut-elimination in classical logic. Other |
86 people have used Nominal Isabelle too - see our list of users and projects |
86 people have used Nominal Isabelle too - see our list of users and projects |
87 <A HREF="users.html">here</A> |
87 <A HREF="users.html">here</A> |
88 |
|
89 <ul> |
|
90 <li> |
|
91 <A HREF="http://www.it.uu.se/katalog/jesperb/" target="_top">Jesper Bengtson</A> |
|
92 and <A HREF="http://user.it.uu.se/~joachim/" target="_top">Joachim Parrow</A> |
|
93 used Nominal Isabelle to verify the theory of the |
|
94 pi-calculus. They formalised the proof that bisimulation is a congruence (both |
|
95 for late and early operational semantics) available |
|
96 <a href="http://afp.sourceforge.net/entries/Pi_Calculus.shtml">here</a>. Moreover they formalised the proof |
|
97 that all late bisimilar processes are early bisimilar. The corresponding |
|
98 papers were presented at FOSSACS'07 and SOS'07. They also used Nominal Isabelle |
|
99 to formalise their work on Psi-calculi, available |
|
100 <a href="http://afp.sourceforge.net/entries/Psi_Calculi.shtml">here</a>. This was |
|
101 presented at LICS 2009 and LICS 2010. |
|
102 Jesper finished his PhD about this in 2010 with a large formalisation in Nominal Isabelle. |
|
103 He also formalised CCS (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>). |
|
104 All formalisations are part of the <A HREF="http://afp.sourceforge.net/">AFP</A>. |
|
105 <li> |
|
106 <A HREF="http://www.ccs.neu.edu/home/samth/" target="_top">Sam Tobin-Hochstadt</A>, a student |
|
107 of <A HREF="http://www.ccs.neu.edu/home/matthias/" target="_top">Matthias Felleisen</A>, used |
|
108 Nominal Isabelle to formalise their work on Typed Scheme. This was presented at POPL'08. |
|
109 |
|
110 <li> |
|
111 <A HREF="http://homepages.inf.ed.ac.uk/ldixon/" target="_top">Lucas Dixon</A>, |
|
112 Alan Smaill and <A HREF="http://homepages.inf.ed.ac.uk/bundy/" |
|
113 target="_top">Alan Bundy</A> used Nominal Isabelle to formalise |
|
114 proof terms of ILL and studied proof planning with this formalisation |
|
115 (EDI-INF-RR-0786). |
|
116 |
|
117 <li> |
|
118 <A HREF="http://www.cs.swan.ac.uk/~csteme/" target="_top">Temesghen Kahsai</A> |
|
119 and <A HREF="http://users.dimi.uniud.it/~marino.miculan/" target="_top">Marino Miculan</A> formalised |
|
120 the spi-calculus using our work - see |
|
121 <A HREF="http://www.cs.swan.ac.uk/~csteme/SpiInIsabelle/SpiInIsabelle.html" target="_top">here</A>. |
|
122 |
|
123 <li> |
|
124 Ayesha Yasmeen, a student of |
|
125 <A HREF="http://www-faculty.cs.uiuc.edu/~egunter/" target="_top">Elsa Gunter</A>, |
|
126 formalised an extension of the ambient calculus using Nominal Isabelle. This |
|
127 was presented in the Emerging Trends section of TPHOLs'08. |
|
128 |
|
129 <li> |
|
130 <A HREF="http://www.ps.uni-saarland.de/~doczkal/" target="_top">Christian Doczkal</A>, |
|
131 a student of <A HREF="http://www.ps.uni-saarland.de/~smolka/">Gert Smolka</A>, |
|
132 finished in 2009 his |
|
133 <A HREF="http://www.ps.uni-saarland.de/~doczkal/master/master.php" target="_top">master thesis</A> |
|
134 at Saarbrücken University using |
|
135 Nominal Isabelle. He formalised the TT-lifting technique in order to prove |
|
136 strong normalisation of Moggi's computational metalanguage. This is part of |
|
137 the <A HREF="http://afp.sourceforge.net/entries/Lam-ml-Normalization.shtml">AFP repository</A>. |
|
138 |
|
139 <li> |
|
140 Armin Heller finished his master thesis at the TU Munich in 2010 with a simple compiler verification |
|
141 using Nominal Isabelle. |
|
142 |
|
143 <li> |
|
144 <A HREF="http://homepages.inf.ed.ac.uk/jcheney/" target="_top">James Cheney</A> |
|
145 formalised a number of properties of the meta-theory of mini-XQuery in Nominal Isabelle. |
|
146 The plan is to extend this work to full XQuery. The preliminary results appeared at CPP'11. |
|
147 |
|
148 <li> |
|
149 <A HREF="http://cl-informatik.uibk.ac.at/users/cek/" target="_top">Cezary Kaliszyk</A> |
|
150 with input from Henk Barendregt formalised the second fixed point theorem |
|
151 of the lambda calculus using Nominal Isabelle 2. This work appeared at CPP'11. |
|
152 |
|
153 <li> |
|
154 <A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A> |
|
155 used Nominal2 for formalising Launchbury's natural semantics for lazy evaluation. This is part |
|
156 of the <A HREF="http://afp.sourceforge.net/entries/Launchbury.shtml">AFP</A>. |
|
157 |
|
158 <li> |
|
159 <A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A> |
|
160 formalised Gödel's Incompletness Theorems using Nominal2. This work |
|
161 appeared in the Journal of Automated Reasoning in 2015. |
|
162 |
|
163 <li> |
|
164 <A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A> |
|
165 proved the correctness of a GHC compiler transformation using Nominal2. |
|
166 This work appeared at the |
|
167 <A HREF="https://www.haskell.org/haskell-symposium/2015/">Haskell Symposium 2015</A>. |
|
168 </ul> |
|
169 </P> |
88 </P> |
170 |
89 |
171 <P> |
90 <P> |
172 Note, however, that Nominal Isabelle is still an ongoing research |
91 Note, however, that Nominal Isabelle is still an ongoing research |
173 project, which needs both theoretical and implementation work. You are |
92 project, which needs both theoretical and implementation work. You are |