# HG changeset patch # User Christian Urban # Date 1679312887 0 # Node ID a831d431425c2db77e6f665757f3c01e1fa3a254 # Parent 5d94313977b10fbb8eb02f3dea1d52c3047467a0 updated diff -r 5d94313977b1 -r a831d431425c Nominal/main.html --- a/Nominal/main.html Fri Dec 23 10:36:24 2022 +0000 +++ b/Nominal/main.html Mon Mar 20 11:48:07 2023 +0000 @@ -83,7 +83,8 @@ the soundness proof and corrected it (we actually gave three solutions to the problem [6]). Urban formalised and also corrected the main result of his PhD, a logical relation argument for establishing strong normalisation of cut-elimination in classical logic. Other -people have used Nominal Isabelle too: +people have used Nominal Isabelle too - see our list of users and projects +here

diff -r 5d94313977b1 -r a831d431425c Nominal/users.html --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/Nominal/users.html Mon Mar 20 11:48:07 2023 +0000 @@ -0,0 +1,283 @@ + + + + + Nominal Methods Group + + + + + +

+ + + +

+ + +

Our Vision

+ +

+ +We are working on a major overhaul of Nominal Isabelle. The +latest bundles of Nominal2 are +here. +

+ + +

+To root out bugs, every programming language should be designed with the help +of a theorem prover, and every compiler should be verified. With our work we +aim to provide all proving technologies necessary for reasoning +conveniently about programming languages (for example the lambda +calculus) and compilers. For us, formal proofs should be as easy to perform as informal +"pencil-and-paper" proofs - at least the overhead of formal proofs should not +prevent any formalisation. Many ideas for our work come from the nominal +logic work by Andrew +Pitts. Our theoretical results about nominal theories enabled us to +implement Nominal Isabelle on top of Isabelle/HOL. +

+ +

+If you want to see a simple example illustrating our results on Nominal Isabelle click +here. For more interesting results, we already +completed formalisations of Church-Rosser and strong-normalisation proofs as +well as the first part of the PoplMark +Challenge. We also formalised some typical proofs from SOS, Karl Crary's chapter on +logical relations from Advanced Topics in Types and Programming Languages, and also +a paper on LF by Harper and +Pfenning. In the latter paper we found a gap in +the soundness proof and corrected it (we actually gave three solutions to the problem [6]). Urban +formalised and also corrected the main result of his PhD, a logical relation argument for +establishing strong normalisation of cut-elimination in classical logic. Other +people have used Nominal Isabelle too: + +

+Jesper Bengtson +and Joachim Parrow +used Nominal Isabelle to verify the theory of the +pi-calculus. They formalised the proof that bisimulation is a congruence (both +for late and early operational semantics) available +here. Moreover they formalised the proof +that all late bisimilar processes are early bisimilar. The corresponding +papers were presented at FOSSACS'07 and SOS'07. They also used Nominal Isabelle +to formalise their work on Psi-calculi, available +here. This was +presented at LICS 2009 and LICS 2010. +Jesper finished his PhD about this in 2010 with a large formalisation in Nominal Isabelle. +He also formalised CCS (here). +All formalisations are part of the AFP. +
+Sam Tobin-Hochstadt, a student +of Matthias Felleisen, used +Nominal Isabelle to formalise their work on Typed Scheme. This was presented at POPL'08. + +
+Lucas Dixon, +Alan Smaill and Alan Bundy used Nominal Isabelle to formalise +proof terms of ILL and studied proof planning with this formalisation +(EDI-INF-RR-0786). + +
+Temesghen Kahsai +and Marino Miculan formalised +the spi-calculus using our work - see +here. + +
+Ayesha Yasmeen, a student of +Elsa Gunter, +formalised an extension of the ambient calculus using Nominal Isabelle. This +was presented in the Emerging Trends section of TPHOLs'08. + +
+Christian Doczkal, +a student of Gert Smolka, +finished in 2009 his +master thesis +at Saarbrücken University using +Nominal Isabelle. He formalised the TT-lifting technique in order to prove +strong normalisation of Moggi's computational metalanguage. This is part of +the AFP repository. + +
+Armin Heller finished his master thesis at the TU Munich in 2010 with a simple compiler verification +using Nominal Isabelle. + +
+James Cheney +formalised a number of properties of the meta-theory of mini-XQuery in Nominal Isabelle. +The plan is to extend this work to full XQuery. The preliminary results appeared at CPP'11. + +
+Cezary Kaliszyk +with input from Henk Barendregt formalised the second fixed point theorem +of the lambda calculus using Nominal Isabelle 2. This work appeared at CPP'11. + +
+Joachim Breitner +used Nominal2 for formalising Launchbury's natural semantics for lazy evaluation. This is part +of the AFP. + +
+Larry Paulson +formalised Gödel's Incompletness Theorems using Nominal2. This work +appeared in the Journal of Automated Reasoning in 2015. + +
+Joachim Breitner +proved the correctness of a GHC compiler transformation using Nominal2. +This work appeared at the +Haskell Symposium 2015. +

+ +

+Note, however, that Nominal Isabelle is still an ongoing research +project, which needs both theoretical and implementation work. You are +encouraged to subscribe to the (moderated) + +mailing list to hear about our progress and to give +us feedback.

+ +

+We have recently re-implemented the underlying nominal theory [7] and also have +a good proposal for how to deal with general binding structures in Nominal Isabelle [8]. +

+ +References

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

[1]	+ Nominal Reasoning Techniques in Isabelle/HOL. In + Journal of Automatic Reasoning, Vol. 40(4), 327-356, 2008. + [pdf]. + The predecessor paper, which appeaerd at CADE in 2005, received the + Thoralf Skolem Award. +
[2]	+ A Formal Treatment of the Barendregt Variable Convention in Rule Inductions + (Christian Urban and Michael Norrish) + Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable + Binding and Names (MERLIN 2005), Pages 25-32, 2005. © ACM, Inc. + [ps] + [pdf] +
[3]	+ A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL + (Christian Urban and Stefan Berghofer) + Proceedings of the 3rd + International Joint Conference on Automated Deduction (IJCAR 2006). In volume 4130 of + Lecture Notes in Artificial Intelligence, Pages 498-512, 2006. + © Springer Verlag + [ps] +
[4]	+ A Head-to-Head Comparison of de Bruijn Indices and Names. + (Stefan Berghofer and Christian Urban) + Proceedings of the International Workshop on Logical Frameworks and + Meta-Languages: Theory and Practice (LFMTP 2006), ENTCS, Pages 53-67, 2006. + [ps] +
[5]	+ Barendregt's Variable Convention in Rule Inductions. (Christian + Urban, Stefan Berghofer and Michael Norrish) Proceedings of the 21th + Conference on Automated Deduction (CADE 2007). In volume 4603 of Lecture + Notes in Artificial Intelligence, Pages 35-50, 2007. + © Springer Verlag + [ps] +
[6]	+ Mechanising the Metatheory of LF. + (Christian Urban, James Cheney and Stefan Berghofer) + In Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society, + Pages 45-56, 2008. + [pdf] More + information elsewhere. +
[7]	+ Proof Pearl: A New Foundation for Nominal Isabelle. + (Brian Huffman and Christian Urban) + In Proc. of the 1st Conference on Interactive Theorem Proving (ITP 2010). In volume 6172 in + Lecture Notes in Computer Science, Pages 35-50, 2010. + [pdf] +
[8]	+ General Bindings and Alpha-Equivalence in Nominal Isabelle. + (Christian Urban and Cezary Kaliszyk) + In Proc. of the 20th European Symposium on Programming (ESOP 2011). + In Volume 6602 of Lecture Notes in Computer Science, Pages 480-500, 2011. + [pdf] (and a + longer version appeared in the Journal of Logical Methods in Computer + Science, Volume 8 (2:14), 2012 + [pdf]) +

+ + +

+[Validate this page.] + + +