--- a/Nominal/activities.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,180 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>The Nominal Datatype Package</title>
- <script type="text/javascript" src="striper.js"></script>
- <link rel="stylesheet" href="nominal.css">
-</head>
-<body onload="striper('ul','striped','li','first,second')">
-<h1>Our Old Activities</h1>
-
-<h2>Past</h2>
-
-<h2>2013</h2>
-<ul class="striped">
- <li> Larry Paulson visits the SMAL group (16 July, hosts: Prof. Maribel Fernandez and Christian Urban)
- <li> Christian is at ITP (Rennes, 23 - 26 July)
- <li> Visit by Xingyuan Zhang from the PLA University in Nanjing (27 July - 5 August)
- <li> Christian is at the Dagstuhl Workshop on Nominal Computation Theory (13 - 16 October)
-</ul>
-
-<h2>2013</h2>
-<ul class="striped">
- <li> Christian is at POPL (Rome, 23 - 25 January)
- <li> Christian is at NASA Langley (10 - 21 June, hosts: Dr Cesar Munoz and Dr Mahyar Malekpour)
- <li> Visit by Michael Norrish from NICTA (19 - 22 July)
-</ul>
-
-<h3>2012</h3>
-<ul class="striped">
- <li> Chunhan Wu joins the Nominal Group at King's (25 June)
- <li> Christian gives a talk at the Nominal Sets Meet Automata Theory Workshop (Warsaw, 9 - 10 February)
-</ul>
-
-<h3>2011</h3>
-<ul class="striped">
- <li> Christian gives a talk at Nominal Workshop in Leicester (23 November, host: Dr Roy Crole)
- <li> Christian will give a talk at ITP 2011 (22 - 25 August)
- <li> Alwen Tiu from the Australian National University visits the Nominal Group (19 August)
- <li> Christian gives a talk at ITU (15 August, host: Prof. Lars Birkedal)
- <li> Christian gives a talk at ESOP 2011 (26 - 30 March)
- <li> Cezary gives a talk at ACM SAC 2011 (21 - 24 March, Taipei)
- <li> Christian gives a talk at Uppsala University (3 March, host: Prof. Joachim Parrow)
- <li> Palle Raabjerg from Uppsala University visits the Nominal Group (2 February - 2 March)
- <li> There will be a one-day <A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/activities/nominal-popl11/">tutorial</A> about Nominal Isabelle at POPL 2011
-</ul>
-
-<h3>2010</h3>
-<ul class="striped">
- <li> Isabelle/Isar tutorial at University Paris Sud (22 - 23 November, host: Dr Markus Wenzel)
- <li> Christian gives a talk at the University of Sussex (3 November, host: Dr Martin Berger)
- <li> Christian gives an invited talk at WMM'10 (Baltimore, 25 September)
- <li> Christian gives a talk at the Jiao Tong University (20 September, host: Prof. Kenny Zhu)
- <li> Christian gives a course on Isabelle programming at the University of Nanjing
- (host: Prof. Xingyuan Zhang, 1st - 31st August)
- <li> Christian gives an invited talk at UNIF'10 (Edinburgh, 14 July)
- <li> Talk at ITP (Edinburgh, 11 - 14 July)
- <li> Larry Paulson and Christian organise the <A href="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/activities/idw10/idw.html">Isabelle Developers Workshop</A> (Cambridge, 17 - 18 June)
- <li> Christian gives a talk in the Automated Reasoning Group in Cambridge (8 June)
- <li> Cezary will leave us to take up a research fellowship in Japan. Congratulations! (31 May)
- <li> Christian gives a talk in the Isabelle group (28 May)
- <li> Christian is on the thesis committee of Clement Houtmann (Nancy, 12 March)
- <li> Christian gives a talk in the Automated Reasoning Group in Cambridge (16 February)
- <li> POPL (20th - 22nd January)
-</ul>
-
-<h3>2009</h3>
-<ul class="striped">
- <li> Schloss Dagstuhl Seminar (4th - 9th October)
- <li> Christian is PC-chair of the <A HREF="http://www.seas.upenn.edu/~sweirich/wmm/wmm09.html" target="_top">Workshop on Mechanizing Metatheory</A>
- <li> Jeremy Dawson from the Australian National University visits the Nominal Group (13 - 26 August)
- <li> Yongjian Li from the Chinese Academy of Sciences in Beijing visits the Nominal Group (13 - 25 August)
- <li> Randy Pollack from the University of Edinburgh visits the Nominal Group (17 - 21 August)
- <li> Christian is PC co-chair of TPHOLs (17 - 20 August)
- <li> Christian organises the <A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/activities/tphols09/idw.html">
- Isabelle Developers Workshop</A> co-located with TPHOLs (13 - 15 August)
- <li> Cezary Kaliszyk joins the Nominal Group
- <li> Christian visist Prof. T.H. Tse at Hong Kong University (24 - 30 June)
- <li> Christian gives an Isabelle <A HREF="activities/cas09">course</A> at the Chinese
- Academy of Sciences in Beijing (May/June, hosts: Prof. Huimin Lin and Prof. Yongjian Li)
- <li> Christian gives a talk at Tsinghua University (22 May, host: Prof. Jean-Pierre Jouannaud)
- <li> Christian gives a talk in Darmstadt (21 April, host: Prof. Helmut Veith)
- <li> Stefan visits Jesper Bengtson (20 April - 1 May)
- <li> Christian was at the TAASN'09 workshop as member of the PC (22nd March)
- <li> Jesper Bengtson visits Stefan (23rd February - 5th March)
- <li> Christian is at POPL (18th - 24th January)
-</ul>
-
-<h3>2008</h3>
-<ul class="striped">
- <li> Version 0.15 of Nominal Isabelle (22nd December)
- <li> Christian is a visiting research fellow at Princeton (15th September - 13th December)
- <LI> Christian gives a
- <A HREF="http://www.csail.mit.edu/events/eventcalendar/calendar.php?show=event&id=2053">talk</A>
- at MIT (21th November, hosts Prof. Martin Rinard and Dr Cameron Freer)
- <LI> Christian gives a talk at NYU (10th November, host Prof. Benjamin Goldberg)
- <li> Christian gives a talk at the kick-off meeting of the
- <A HREF="http://puma.in.tum.de/wiki/Doctorate_Program:_PUMA" target="_top">PUMA Doctoral Programme</A>
- (28 September - 3 October, Spitzingsee)
- <li> Christian gives an invited talk at LSFA (26th August, Brazil)
- <li> Stefan gives a talk at at TPHOLs (18 - 21 August, Montreal, Canada)
- <li> Stefan and Christian give a Nominal Isabelle tutorial at
- <A HREF="activities/nominal-ijcar08" target="_top">IJCAR'08</A>
- (11 August, Sydney)
- <li> Christian gives a course on nominal reasoning techniques at the
- <A HREF="http://www.cs.uoregon.edu/research/summerschool/summer08/">Oregon Programming
- Languages summer school</A> (22 - 30 July, Eugene, [<A HREF="activities/oregon.html">slides</A>])
- <li> Christian gives a talk at RTA (15 - 17 July, Hagenberg, Austria)
- <li> Christian gives a talk at LICS (24 - 27 June, Pittsburgh)
- <li> Andreas Abel and Christian organise the LFMTP'08 workshop
- <li> Christian gives a talk in Swansea (1 April)
- <li> Christian presents a poster at TTVSI (25 - 26 March, London)
- <li> Stefan gives a talk at TYPES conference (26 - 29 March, Torino, Italy)
- <li> Christian gives a talk at the CANS meeting (10 March, King's College London)
- <li> Christian gives a talk at Imperial College, London (6. March)
- <li> Matthew Lakin (Ph.D. student of Andy Pitts, Cambridge, 18. - 22. February)
- visits the nominal group,
- slides [<A HREF="activities/slides-lakin.pdf" target="_top">pdf</A>]
- <li> Peter Chapman (Ph.D. student of Roy Dyckhoff, St Andrews)
- visits the nominal group (11. - 15. February,
- slides [<A HREF="activities/slides-chapman.pdf" target="_top">pdf</A>])
- <li> Christian gives a talk at Yale University, New Haven (24. January)
- <li> Christian gives a talk at Northeastern University, Boston (22. January)
- <li> Christian gives two talks at Indiana University, Bloomington (16. and 18. January)
- <li> Christian has a look what the competition is up to at the POPL workshop on Coq (8. January)
- <li> Version 0.14 of Nominal Isabelle (7. January)
-</ul>
-
-
-<h3>2007</h3>
-<ul class="striped">
- <li> Christian gives two talks in Saarbrücken (13. and 14. December)
- <li> Jesper Bengtson (Ph.D. student of Joachim Parrow, Uppsala) visits the nominal group
- (1. - 9. December, slides [<A HREF="activities/slides-bengtson.pdf" target="_top">pdf</A>])
- <li> James Cheney from LFCS Edinburgh visits the nominal group (29. October - 15. November)
- <li> Version 0.13 of Nominal Isabelle (12. Oktober)
- <li> Talk by Christian at WMM'07 (4. October)
- <li> Randy Pollack from LFCS Edinburgh visits the nominal group (25. - 29. September, slides:
- [<A HREF="activities/slides-pollack.pdf" target="_top">pdf</A>])
- <li> Jeremy Dawson from NICTA Australia visits the nominal group (15. - 25. September)
- <li> Version 0.12 of Nominal Isabelle (18. September)
- <li> Michael Norrish form NICTA Australia visits the nominal group (5. - 9. September, slides:
- [<A HREF="activities/slides-norrish.pdf" target="_top">pdf</A>])
- <li> Julien received a lectureship at the University of Strasbourg - the members of the
- nominal group say congratulation and thanks for the excellent work he has done in
- the past year (1. September)
- <li> Temesghen Kahsai from the University of Swansea visits us
- and tells us about his work on formalising the spi-calculus done
- under the supervision of Marino Miculan (13. - 16. August)
- <li> Talk by Christian at LFMTP and CADE; talk by Stefan at the Isabelle
- Workshop (Bremen, 15. - 20. July)
- <li> Course by Christian at the
- <A HREF="http://isr2007.loria.fr/index.php"> International School on Rewriting</A>
- (Nancy, 2. - 6. July)
- <li> Version 0.11 of Nominal Isabelle (25. June)
- <li> Talk by Christian at LFCS (Edinburgh, 29. May)
- <li> Talks by Stefan and Christian at the Nominal Workshop at ICMS (Edinburgh, 26. - 28. May)
- <li> Christian was invited researcher at NICTA Canberra and gave a talk
- (host: Michael Norrish, 5. - 23. May)
- <li> Talk by Stefan at the TYPES Meeting in Udine (2. - 5. May)
- <li> Mathilde Arnaud from the ENS Cachan visits the nominal methods group
- to do an internship (April - August)
- <li> Version 0.10 of Nominal Isabelle (12. April)
- <li> Version 0.09 of Nominal Isabelle (22. March)
- <li> Talk by Julien at the LogiCal/Proval's seminar, Palaiseau, France (20. March)
- <li> Talk by Christian in St Andrews, UK (13. February)
- <li> Talk by Julien in the group of
- <A HREF="http://pauillac.inria.fr/~xleroy/" target="_top">Xavier Leroy</A>
- (Paris, 9. February)
- <li> <A HREF="http://homepages.inf.ed.ac.uk/jcheney/" target="_top">James Cheney</A> visits the
- nominal methods group (5. - 10. February, slides:
- [<A HREF="activities/slides-cheney.pdf" target="_top">pdf</A>])
- <li> Version 0.08 of Nominal Isabelle (18. January)
-</ul>
-
-</body>
-</html>
-
-
-
--- a/Nominal/activities.html~ Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,181 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>The Nominal Datatype Package</title>
- <script type="text/javascript" src="striper.js"></script>
- <link rel="stylesheet" href="nominal.css">
-</head>
-<body onload="striper('ul','striped','li','first,second')">
-<h1>Our Old Activities</h1>
-
-
-<h2>2013</h2>
-<ul class="striped">
- <li> Larry Paulson visits the SMAL group (16 July, hosts: Prof. Maribel Fernandez and Christian Urban)
- <li> Christian is at ITP (Rennes, 23 - 26 July)
- <li> Visit by Xingyuan Zhang from the PLA University in Nanjing (27 July - 5 August)
- <li> Christian is at the Dagstuhl Workshop on Nominal Computation Theory (13 - 16 October)
-</ul>
-
-<h2>Past</h2>
-
-<h2>2013</h2>
-<ul class="striped">
- <li> Christian is at POPL (Rome, 23 - 25 January)
- <li> Christian is at NASA Langley (10 - 21 June, hosts: Dr Cesar Munoz and Dr Mahyar Malekpour)
- <li> Visit by Michael Norrish from NICTA (19 - 22 July)
-</ul>
-
-<h3>2012</h3>
-<ul class="striped">
- <li> Chunhan Wu joins the Nominal Group at King's (25 June)
- <li> Christian gives a talk at the Nominal Sets Meet Automata Theory Workshop (Warsaw, 9 - 10 February)
-</ul>
-
-<h3>2011</h3>
-<ul class="striped">
- <li> Christian gives a talk at Nominal Workshop in Leicester (23 November, host: Dr Roy Crole)
- <li> Christian will give a talk at ITP 2011 (22 - 25 August)
- <li> Alwen Tiu from the Australian National University visits the Nominal Group (19 August)
- <li> Christian gives a talk at ITU (15 August, host: Prof. Lars Birkedal)
- <li> Christian gives a talk at ESOP 2011 (26 - 30 March)
- <li> Cezary gives a talk at ACM SAC 2011 (21 - 24 March, Taipei)
- <li> Christian gives a talk at Uppsala University (3 March, host: Prof. Joachim Parrow)
- <li> Palle Raabjerg from Uppsala University visits the Nominal Group (2 February - 2 March)
- <li> There will be a one-day <A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/activities/nominal-popl11/">tutorial</A> about Nominal Isabelle at POPL 2011
-</ul>
-
-<h3>2010</h3>
-<ul class="striped">
- <li> Isabelle/Isar tutorial at University Paris Sud (22 - 23 November, host: Dr Markus Wenzel)
- <li> Christian gives a talk at the University of Sussex (3 November, host: Dr Martin Berger)
- <li> Christian gives an invited talk at WMM'10 (Baltimore, 25 September)
- <li> Christian gives a talk at the Jiao Tong University (20 September, host: Prof. Kenny Zhu)
- <li> Christian gives a course on Isabelle programming at the University of Nanjing
- (host: Prof. Xingyuan Zhang, 1st - 31st August)
- <li> Christian gives an invited talk at UNIF'10 (Edinburgh, 14 July)
- <li> Talk at ITP (Edinburgh, 11 - 14 July)
- <li> Larry Paulson and Christian organise the <A href="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/activities/idw10/idw.html">Isabelle Developers Workshop</A> (Cambridge, 17 - 18 June)
- <li> Christian gives a talk in the Automated Reasoning Group in Cambridge (8 June)
- <li> Cezary will leave us to take up a research fellowship in Japan. Congratulations! (31 May)
- <li> Christian gives a talk in the Isabelle group (28 May)
- <li> Christian is on the thesis committee of Clement Houtmann (Nancy, 12 March)
- <li> Christian gives a talk in the Automated Reasoning Group in Cambridge (16 February)
- <li> POPL (20th - 22nd January)
-</ul>
-
-<h3>2009</h3>
-<ul class="striped">
- <li> Schloss Dagstuhl Seminar (4th - 9th October)
- <li> Christian is PC-chair of the <A HREF="http://www.seas.upenn.edu/~sweirich/wmm/wmm09.html" target="_top">Workshop on Mechanizing Metatheory</A>
- <li> Jeremy Dawson from the Australian National University visits the Nominal Group (13 - 26 August)
- <li> Yongjian Li from the Chinese Academy of Sciences in Beijing visits the Nominal Group (13 - 25 August)
- <li> Randy Pollack from the University of Edinburgh visits the Nominal Group (17 - 21 August)
- <li> Christian is PC co-chair of TPHOLs (17 - 20 August)
- <li> Christian organises the <A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/activities/tphols09/idw.html">
- Isabelle Developers Workshop</A> co-located with TPHOLs (13 - 15 August)
- <li> Cezary Kaliszyk joins the Nominal Group
- <li> Christian visist Prof. T.H. Tse at Hong Kong University (24 - 30 June)
- <li> Christian gives an Isabelle <A HREF="activities/cas09">course</A> at the Chinese
- Academy of Sciences in Beijing (May/June, hosts: Prof. Huimin Lin and Prof. Yongjian Li)
- <li> Christian gives a talk at Tsinghua University (22 May, host: Prof. Jean-Pierre Jouannaud)
- <li> Christian gives a talk in Darmstadt (21 April, host: Prof. Helmut Veith)
- <li> Stefan visits Jesper Bengtson (20 April - 1 May)
- <li> Christian was at the TAASN'09 workshop as member of the PC (22nd March)
- <li> Jesper Bengtson visits Stefan (23rd February - 5th March)
- <li> Christian is at POPL (18th - 24th January)
-</ul>
-
-<h3>2008</h3>
-<ul class="striped">
- <li> Version 0.15 of Nominal Isabelle (22nd December)
- <li> Christian is a visiting research fellow at Princeton (15th September - 13th December)
- <LI> Christian gives a
- <A HREF="http://www.csail.mit.edu/events/eventcalendar/calendar.php?show=event&id=2053">talk</A>
- at MIT (21th November, hosts Prof. Martin Rinard and Dr Cameron Freer)
- <LI> Christian gives a talk at NYU (10th November, host Prof. Benjamin Goldberg)
- <li> Christian gives a talk at the kick-off meeting of the
- <A HREF="http://puma.in.tum.de/wiki/Doctorate_Program:_PUMA" target="_top">PUMA Doctoral Programme</A>
- (28 September - 3 October, Spitzingsee)
- <li> Christian gives an invited talk at LSFA (26th August, Brazil)
- <li> Stefan gives a talk at at TPHOLs (18 - 21 August, Montreal, Canada)
- <li> Stefan and Christian give a Nominal Isabelle tutorial at
- <A HREF="activities/nominal-ijcar08" target="_top">IJCAR'08</A>
- (11 August, Sydney)
- <li> Christian gives a course on nominal reasoning techniques at the
- <A HREF="http://www.cs.uoregon.edu/research/summerschool/summer08/">Oregon Programming
- Languages summer school</A> (22 - 30 July, Eugene, [<A HREF="activities/oregon.html">slides</A>])
- <li> Christian gives a talk at RTA (15 - 17 July, Hagenberg, Austria)
- <li> Christian gives a talk at LICS (24 - 27 June, Pittsburgh)
- <li> Andreas Abel and Christian organise the LFMTP'08 workshop
- <li> Christian gives a talk in Swansea (1 April)
- <li> Christian presents a poster at TTVSI (25 - 26 March, London)
- <li> Stefan gives a talk at TYPES conference (26 - 29 March, Torino, Italy)
- <li> Christian gives a talk at the CANS meeting (10 March, King's College London)
- <li> Christian gives a talk at Imperial College, London (6. March)
- <li> Matthew Lakin (Ph.D. student of Andy Pitts, Cambridge, 18. - 22. February)
- visits the nominal group,
- slides [<A HREF="activities/slides-lakin.pdf" target="_top">pdf</A>]
- <li> Peter Chapman (Ph.D. student of Roy Dyckhoff, St Andrews)
- visits the nominal group (11. - 15. February,
- slides [<A HREF="activities/slides-chapman.pdf" target="_top">pdf</A>])
- <li> Christian gives a talk at Yale University, New Haven (24. January)
- <li> Christian gives a talk at Northeastern University, Boston (22. January)
- <li> Christian gives two talks at Indiana University, Bloomington (16. and 18. January)
- <li> Christian has a look what the competition is up to at the POPL workshop on Coq (8. January)
- <li> Version 0.14 of Nominal Isabelle (7. January)
-</ul>
-
-
-<h3>2007</h3>
-<ul class="striped">
- <li> Christian gives two talks in Saarbrücken (13. and 14. December)
- <li> Jesper Bengtson (Ph.D. student of Joachim Parrow, Uppsala) visits the nominal group
- (1. - 9. December, slides [<A HREF="activities/slides-bengtson.pdf" target="_top">pdf</A>])
- <li> James Cheney from LFCS Edinburgh visits the nominal group (29. October - 15. November)
- <li> Version 0.13 of Nominal Isabelle (12. Oktober)
- <li> Talk by Christian at WMM'07 (4. October)
- <li> Randy Pollack from LFCS Edinburgh visits the nominal group (25. - 29. September, slides:
- [<A HREF="activities/slides-pollack.pdf" target="_top">pdf</A>])
- <li> Jeremy Dawson from NICTA Australia visits the nominal group (15. - 25. September)
- <li> Version 0.12 of Nominal Isabelle (18. September)
- <li> Michael Norrish form NICTA Australia visits the nominal group (5. - 9. September, slides:
- [<A HREF="activities/slides-norrish.pdf" target="_top">pdf</A>])
- <li> Julien received a lectureship at the University of Strasbourg - the members of the
- nominal group say congratulation and thanks for the excellent work he has done in
- the past year (1. September)
- <li> Temesghen Kahsai from the University of Swansea visits us
- and tells us about his work on formalising the spi-calculus done
- under the supervision of Marino Miculan (13. - 16. August)
- <li> Talk by Christian at LFMTP and CADE; talk by Stefan at the Isabelle
- Workshop (Bremen, 15. - 20. July)
- <li> Course by Christian at the
- <A HREF="http://isr2007.loria.fr/index.php"> International School on Rewriting</A>
- (Nancy, 2. - 6. July)
- <li> Version 0.11 of Nominal Isabelle (25. June)
- <li> Talk by Christian at LFCS (Edinburgh, 29. May)
- <li> Talks by Stefan and Christian at the Nominal Workshop at ICMS (Edinburgh, 26. - 28. May)
- <li> Christian was invited researcher at NICTA Canberra and gave a talk
- (host: Michael Norrish, 5. - 23. May)
- <li> Talk by Stefan at the TYPES Meeting in Udine (2. - 5. May)
- <li> Mathilde Arnaud from the ENS Cachan visits the nominal methods group
- to do an internship (April - August)
- <li> Version 0.10 of Nominal Isabelle (12. April)
- <li> Version 0.09 of Nominal Isabelle (22. March)
- <li> Talk by Julien at the LogiCal/Proval's seminar, Palaiseau, France (20. March)
- <li> Talk by Christian in St Andrews, UK (13. February)
- <li> Talk by Julien in the group of
- <A HREF="http://pauillac.inria.fr/~xleroy/" target="_top">Xavier Leroy</A>
- (Paris, 9. February)
- <li> <A HREF="http://homepages.inf.ed.ac.uk/jcheney/" target="_top">James Cheney</A> visits the
- nominal methods group (5. - 10. February, slides:
- [<A HREF="activities/slides-cheney.pdf" target="_top">pdf</A>])
- <li> Version 0.08 of Nominal Isabelle (18. January)
-</ul>
-
-</body>
-</html>
-
-
-
--- a/Nominal/cookie.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,1 +0,0 @@
-<body onLoad="javascript:pageTracker._setVar('no_report');">
--- a/Nominal/documentation.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,34 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-
-<html>
-<head>
- <title>The Nominal Datatype Package</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-<body>
-
-<h1>Documentation</h1>
-
-Some rudimentary notes are available in
-<a href="manual/nominal_datatype_manual.ps">postscript</a> and
-in <a href="manual/nominal_datatype_manual.pdf">pdf</a>. We are
-working on better documentation - hassle us to speed up this
-process.<br><br>
-
-A somewhat highlevel description of the formalisation in the example file SOS.thy.
-[<a href="manual/SOS.pdf">pdf</a>]<br>
-
-<h1>Nominal Bibliography</h1>
-
-<A HREF="http://www.citeulike.org/group/11951" target="_top">CiteULike</A>
-collection about nominal techniques compiled by Dominic Mulligan (supersedes
-the collection below).
-<BR><BR>
-
-
-<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/NomBib/nominal.html" target="_top">Here</A>
-is a bibliography of publications related to the nominal logic work.
-
-</body>
-</html>
--- a/Nominal/download-old.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,44 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>The Nominal Datatype Package</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
-<body>
-<h1>Download</h1>
-
-Download the Nominal Isabelle snapshot provided below and
-follow the instructions in INSTALL.
-<br><br>
-
-<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/Isabelle_07-Jan-2008.tar.gz">Isabelle Snapshot from 7. January 2008 (includes version 0.14 of the nominal datatype package)</A>
-<br><br>
-
-
-
-<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/manual/INSTALL">INSTALL</A>
-<br><br>
-
-<img src="graphics/attention.png" alt="The Nominal Datatype" align="left">
-Beginning from version 0.13, the nominal package can be started by using
-just the command "Isabelle" and enabling the option "HOL-Nominal" in the
-ProofGeneral menu "Isabelle -> Logics". If you want that HOL-Nominal is
-your default logic, then you can add
-
-<p>
-<CENTER>
-ISABELLE_LOGIC="HOL-Nominal"
-</CENTER>
-<p>
-
-to the file $HOME/isabelle/etc/settings.
-<br><br>
-
-
-</body>
-</html>
-
-
-
--- a/Nominal/download.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,55 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>The Nominal Datatype Package</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
-<body>
-
-<h3><IMG SRC="new.gif" ALT="" style="" align="left">Nominal2 and Isabelle 2016</h3>
-
-At the moment, Nominal2 is still <B>alpha-ware</B> and not part of the standard
-Isabelle distribution. But assuming you have a working Isabelle 2016 distribution,
-it can be easily installed. The necessary theory files for Nominal2 can be downloaded
-from:
-
-<ul>
-<li>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Nominal2-2016.tgz">Nominal2-2016.tgz</A> (19 March 2016)
-</li>
-</ul>
-
-Unpack the tgz-file. This will create a directory Nominal and also
-Nominal/Ex. If you change into the latter directory and load, for example,
-Lambda.thy, then you are already up and running. You can proceed
-with this theory as if it was a "normal" theory based on Main.
-
-
-<p>
-You can also be on the bleeding edge by downloading the
-sources from this Mercurial
-<A HREF="http://www21.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/">Repository</A>.
-
-
-<h3>Nominal1 and Isabelle 2016</h3>
-
-Nominal1 is part of the current distribution and can be installed
-as explained <A HREF="http://isabelle.in.tum.de/download.html">here</A>.
-
-
-<h3>(Obsolete) Nominal2 and older Isabelle</h3>
-
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Nominal2-2011-1.tgz">Nominal2-2011-1.tgz</A> (17 Feb. 2012)<BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Nominal2-2012.tgz">Nominal2-2012.tgz</A> (15 May 2012)<BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Nominal2-2013.tgz">Nominal2-2013.tgz</A> (19 February 2013)<BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Nominal2-2013-1.tgz">Nominal2-2013-1.tgz</A> (18 October 2013)<BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Nominal2-2013-2.tgz">Nominal2-2013-2.tgz</A> (15 December 2013)<BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Nominal2-2014.tgz">Nominal2-2014.tgz</A> (9 September 2014)<BR>
-<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/Nominal2-2015.tgz">Nominal2-2015.tgz</A> (9 July 2015)<BR>
-</body>
-</html>
-
-
-
--- a/Nominal/example.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,384 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>Nominal Methods Group</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
-<body>
-
-<div align="right" style="position:relative; left:15%; width:80%">
-<P>
-<small>
-<SCRIPT LANGUAGE="JAVASCRIPT" type="text/javascript">
-<!--
-var r_text = new Array ();
-r_text[0] = "<em>\"Proving theorems about substitutions (and related operations such as alpha-conversion) required far more time and HOL code than any other variety of theorem.\"<br><\/em>M. VanInwegen using a concrete representation for binders in her PhD-thesis, 1996";
-
-r_text[1] = "<em>\"When doing the formalization, I discovered that the core part of the proof... is fairly straightforward and only requires a good understanding of the paper version. However, in completing the proof I observed that in certain places I had to invest much more work than expected, e.g. proving lemmas about substitution and weakening.\"<\/em><br>T. Altenkirch using de Bruijn indices in Proc. of TLCA, 1993";
-
-r_text[2] = "<em>\"Technical work, however, still represents the biggest part of our implementation, mainly due to the managing of de Bruijn indexes...Of our 800 proved lemmas, about 600 are concerned with operators on free names.\"<\/em><br>D. Hirschkoff in Proc. of TPHOLs, 1997";
-
-r_text[3] = "<em>\"It took the author many long months to complete the work on this formalization...The part concerning substitution is by far the largest part of the whole development.\"<\/em><br>A. Koprowski using de Bruijn indices in a draft paper, 2006";
-
-r_text[4] = "<em>\"We thank T. Thacher Robinson for showing us on August 19, 1962 by a counterexample the existence of an error in our handling of bound variables.\"<\/em><br>S. Kleene in J. of Symbolic Logic 21(1):11-18, 1962";
-
-r_text[5] = "<em>\"The main drawback in HOAS is the difficulty of dealing with metatheoretic issues concerning names in processes...As a consequence, some metatheoretic properties involving substitution and freshness of names inside proofs and processes cannot be proved inside the framework and instead have to be postulated.\"<\/em><br>F. Honsell, M. Miculan and I. Scagnetto in Theoretical Computer Science, 253(2):239-285, 2001";
-
-r_text[6] = "<em>\"Because Twelf metatheorems are proved using totality assertions about LF type families, the class of metatheorems that can be mechanized is restricted to All/Exists-statements over LF types. On the one hand, as the successful Twelf formalizations cited in Section 5 demonstrate, these All/Exists-statements have proved to be sufficient for formalizing a wide variety of metatheorems about programming languages and logics. On the other hand, we have no way to quantify when metatheorems of this form will be sufficient, and there are some well-known examples of proofs that cannot be formalized directly using Twelf as metatheorem language. For example, proofs by logical relations often require more quantifier complexity than All/Exists-statements afford.\"<\/em><br>Robert Harper and Daniel Licata in a paper on Twelf, 2007";
-
-r_text[7] = "<em>\"So we cannot, hand-on-heart, recommend the vanilla LN style for anything but small, kernel language developments. \"<\/em><br>in F-ing Modules by Rossberg, Russo and Dreyer, TLDI 2010";
-
-r_text[8] = "<em>\"Higher-order abstract syntax is a convenient way to approach languages with binding, but it is possible to imagine a problem where manipulating a fully concrete object without binding is simpler. In these cases, it is possible to establish a bijection between your HOAS terms and de Bruijn versions of the same terms. \"<\/em><br>Interesting responses from the <A HREF=\"http://twelf.plparty.org/wiki/Ask_Twelf_Elf\">Twelf wiki.</A> (To be honest, the same comment applies to Nominal. --cu)";
-
-
-var i = Math.floor(r_text.length*Math.random());
-document.write(r_text[i]);
-//-->
-</SCRIPT>
-</small>
-</P>
-</div>
-
-
-<H1>Barendregt's Substitution Lemma</H1>
-
-<P>
-Let us explain one of our results with a simple proof about the lambda calculus.
-An informal "pencil-and-paper" proof there looks typically as follows (this one is taken from <A
-HREF="http://www.cs.ru.nl/~henk/" target="_top">Barendregt's</A> classic book
-on the lambda calculus):
-</P>
-
-<!-- Barendregt's proof -->
-<CENTER>
-<TABLE style="text-align: left; width: 90%;" BORDER=0 CELLSPACING=0 CELLPADDING=5>
-<TR>
- <TD style="background-color: rgb(180, 180, 180);">
- <B>2.1.16. Substitution Lemma:</B> If <I>x≠y</I> and <I>x</I> not free in <I>L</I>,
- then
- </TD>
-</TR>
-<TR>
- <TD style="background-color: rgb(180, 180, 180);">
- <CENTER><I>M[x:=N][y:=L] = M[y:=L][x:=N[y:=L]]</I>.</CENTER>
- </TD>
-</TR>
-<TR>
-<TD style="background-color: rgb(210, 210, 210);">
-<B>Proof:</B> By induction on the structure of <I>M</I>.
-<DL>
-<DT>Case 1. <I>M</I> is a variable.<DD>
-<DL>
-<DT>Case 1.1. <I>M=x</I>. Then both sides equal <I>N[y:=L]</I> since <I>x≠y</I>.
-<DT>Case 1.2. <I>M=y</I>. Then both sides equal <I>L</I>, for <I>x</I> not free in <I>L</I>
- implies <I>L[x:=...]=L</I>.
-<DT>Case 1.3. <I>M=z≠x,y</I>. Then both sides equal <I>z</I>.
-</DL></DD>
-<DT>Case 2. <I>M=λz.M<SUB>1</SUB></I>. <DD>By the variable convention we may assume that
-<I>z≠x,y</I> and <I>z</I> is not free in <I>N</I>, <I>L</I>. Then by the induction hypothesis<BR>
-<CENTER>
-<TABLE>
-<TR><TD ALIGN=RIGHT><I>(λz.M<SUB>1</SUB>)[x:=N][y:=L]</I></TD>
- <TD ALIGN=CENTER><I>=</I></TD>
- <TD ALIGN=Left><I>λz.M<SUB>1</SUB>[x:=N][y:=L]</I></TD>
-</TR>
-<TR><TD ALIGN=RIGHT> </TD>
- <TD ALIGN=CENTER><I>=</I></TD>
- <TD ALIGN=Left><I>λz.M<SUB>1</SUB>[y:=L][x:=N[y:=L]]</I></TD>
-</TR>
-<TR><TD ALIGN=RIGHT> </TD>
- <TD ALIGN=CENTER><I>=</I></TD>
- <TD ALIGN=Left><I>(λz.M<SUB>1</SUB>)[y:=L][x:=N[y:=L]]</I>.</TD>
-</TR>
-</TABLE>
-</CENTER>
-<DT>Case 3. <I>M=M<SUB>1</SUB> M<SUB>2</SUB></I>.<DD>Then the statement follows
-again from the induction hypothesis.
-</DL>
-</TD>
-</TR>
-</TABLE>
-</CENTER>
-
-<P>
- We want to make it as easy as possible to formalise such informal proofs (and
-more complicated ones). Inspired by the <A
-HREF="http://fling-l.seas.upenn.edu/~plclub/cgi-bin/poplmark/"
-target="_top">PoplMark Challenge</A>, we want that masses use theorem
-assistants to do their formal proofs.
-</P>
-
-<P>
-Since the kind of informal reasoning illustrated by Barendregt's proof is very
-common in the literature on programming languages, it might be surprising that
-implementing his proof
-in a theorem assistant is not a trivial task. This is because he relies
-implicitly on some assumptions and conventions. For example he states in his
-book:
-</P>
-
-<CENTER>
-<TABLE style="text-align: left; width: 90%;" BORDER=0 CELLSPACING=0 CELLPADDING=5>
-<TR>
-<TD style="background-color: rgb(180, 180, 180);">
-<B>2.1.12. Convention.</B> Terms that are α-congruent are identified. So now we
-write <I>λx.x=λy.y</I>, etcetera.
-</TD>
-</TR>
-</TABLE>
-</CENTER>
-
-<CENTER>
-<TABLE style="text-align: left; width: 90%;" BORDER=0 CELLSPACING=0 CELLPADDING=5>
-<TR>
-<TD style="background-color: rgb(180, 180, 180);">
-<B>2.1.13. Variable Convention.</B> If <I>M<SUB>1</SUB>,...,M<SUB>n</SUB></I> occur
-in a certain mathematical context (e.g. definition, proof), then in these terms all
-bound variables are chosen to be different from the free variables.
-</TD>
-</TR>
-</TABLE>
-</CENTER>
-
-<P>
-The first convention is crucial for the proof above as it allows one to deal
-with the variable case by using equational reasoning - one can just calculate
-what the results of the substitutions are. If one uses un-equated, or raw, lambda-terms,
-the same kind of reasoning cannot be performed (the reasoning then has to be
-modulo α-equivalence, which causes a lot of headaches in
-the lambda-case.) But if the data-structure over which the proof is
-formulated is α-equivalence classes of lambda-terms, then what is the
-principle "by induction over the structure of <I>M</I>"? There is an
-induction principle "over the structure" for (un-equated) lambda-terms. But
-quotening lambda-terms by α-equivalence does not automatically lead to
-such a principle for α-equivalence classes. This seems to be a point
-that is nearly always ignored in the literature. In fact it takes, as we have
-shown in [1] and [2], some serious work to provide such an induction principle
-for α-equivalence classes.
-</P>
-
-<P>
-The second problem for an implementation of Barendregt's proof is his use of
-the variable convention: there is just no proof-principle "by convention" in a
-theorem assistant. Taking a closer look at Barendregt's reasoning, it turns
-out that for a proof obligation of the form "for all α-equated
-lambda-terms <I>λz.M<SUB>1</SUB></I>...", he does not establish this
-proof obligation for all <I>λz.M<SUB>1</SUB></I>, but only for some
-carefully chosen α-equated lambda-terms, namely the ones for which
-<I>z</I> is not free in <I>x,y,N</I> and <I>L</I>. This style of reasoning
-clearly needs some justification and in fact depends on some assumptions of
-the "context" of the induction. By "context" of the induction we mean the
-variables <I>x,y,N</I> and <I>L</I>. When employing the variable convention in
-a formal proof, one always implicitly assumes that one can choose a fresh name
-for this context. This might, however, not always be possible, for example
-when the context already mentions all names. Also we found out recently that the
-use of the variable convention in proofs by rule-induction can lead to
-faulty reasoning [5]. So our work introduces safeguards that ensure that the
-use of the variable convention is always safe.
-</P>
-
-<P>
-One might conclude from our comments about Barendregt's proof that it is no
-proof at all. This is, however, not the case! With Nominal Isabelle
-and its infrastructure one can easily formalise his reasoning. One first
-has to declare the structure of <U>α-equated</U>
-lambda-terms as a nominal datatype:
-</P>
-
-
-<div class="codedisplay"> atom_decl name
- nominal_datatype term = Var "name"
- | App "term" "term"
- | Lam "«name»term"
-</div>
-
-<P>
-Note though, that nominal datatypes are not datatypes in the traditional
-sense, but stand for α-equivalence classes. Indeed we have for terms of
-type <code>term</code> the equation(!)
-</P>
-
-<div class="codedisplay"> lemma alpha: "Lam [a].(Var a) = Lam [b].(Var b)"
-</div>
-
-
-<P>
-which does not hold for traditional datatypes (note that we write
-lambda-abstractions as <code>Lam [a].t</code>). The proof of the substitution
-lemma can then be formalised as follows:
-</P>
-
-<div class="codedisplay"> lemma substitution_lemma:
- assumes asm: "x≠y" "x#L"
- shows "M[x:=N][y:=L] = M[y:=L][x:=N[y:=L]]"
- using asm
- by (nominal_induct M avoiding: x y N L rule: term.induct)
- (auto simp add: forget fresh_fact)
-</div>
-
-
-<P>
-where the assumption "<I>x</I> is fresh for <I>L</I>", written <code>x#L</code>,
-encodes the usual relation of "<I>x</I> not free in <I>L</I>". The method
-<code>nominal_induct</code> takes as arguments the variable over which the
-induction is
-performed (here <I>M</I>), and the context of the induction, which consists of
-the variables mentioned in the variable convention (that is the part in
-Barendregt's proof where he writes "...we may assume that <I>z≠x,y</I> and
-<I>z</I> is not free in <I>N,L</I>"). The last argument of <code>nominal_induct</code>
-specifies which induction rule should be applied - in this case induction over
-α-equated lambda-terms, an induction-principle Nominal Isabelle provides
-automatically when the nominal datatype <code>term</code> is defined. The
-implemented proof of the substitution lemma proceeds then completely
-automatically, except for the need of having to mention the facts <code>forget</code> and
-<code>fresh_fact</code>, which are proved separately (also by induction over
-α-equated lambda-terms).</P>
-
-
-<P>
-The lemma <code>forget</code> shows that if <I>x</I> is not
-free in <I>L</I>, then <I>L[x:=...]=L</I> (Barendregt's Case 1.2). Its formalised proof
-is as follows:
-</P>
-
-<div class="codedisplay"> lemma forget:
- assumes asm: "x#L"
- shows "L[x:=P] = L"
- using asm
- by (nominal_induct L avoiding: x P rule: term.induct)
- (auto simp add: abs_fresh fresh_atm)
-</div>
-
-
-<P>
-In this proof <code>abs_fresh</code> is an automatically generated lemma that
-establishes when <I>x</I> is fresh for a lambda-abstraction, namely <I>x#Lam
-[z].P'</I> if and only if <I>x=z</I> or (<I>x≠z</I> and <I>x#P'</I>);
-<code>fresh_atm</code> states that <I>x#y</I> if and only if <I>x≠y</I>. The lemma
-<code>fresh_fact</code> proves the property that if <I>z</I> does not occur
-freely in <I>N</I> and <I>L</I> then it also does not occur freely in
-<I>N[y:=L]</I>. This fact can be formalised as follows:</P>
-
-<div class="codedisplay"> lemma fresh_fact:
- assumes asm: "z#N" "z#L"
- shows "z#N[y:=L]"
- using asm
- by (nominal_induct N avoiding: z y L rule: term.induct)
- (auto simp add: abs_fresh fresh_atm)
-</div>
-
-<P>
-Although the latter lemma does not appear explicitly in Barendregt's reasoning, it is required
-in the last step of the lambda-case (Case 2) where he pulls the substitution from under
-the binder <I>z</I> (the interesting step is marked with a •):</P>
-<CENTER>
-<TABLE>
-<TR><TD> </TD><TD><I>λz.(M<SUB>1</SUB>[y:=L][x:=N[y:=L]])</I></TD><TD> </TD></TR>
-<TR><TD>=</TD><TD><I>(λz.M<SUB>1</SUB>[y:=L])[x:=N[y:=L]]</I></TD><TD> •</TD></TR>
-<TR><TD>=</TD><TD><I>(λz.M<SUB>1</SUB>)[y:=L][x:=N[y:=L]]</I></TD><TD> </TD></TR>
-</TABLE>
-</CENTER>
-
-<P>
-After these 22 lines one has a completely formalised proof of the substitution
-lemma. This proof does not rely on any axioms, apart from the ones on which
-HOL is built.
-</P><BR>
-
-<B>References</B><BR><BR>
-<CENTER>
-<TABLE>
-<TR><TD WIDTH="7%" VALIGN=Top>[1]</TD>
- <TD ALIGN=Left>
- <B>Nominal Reasoning Techniques in Isabelle/HOL.</B> In
- Journal of Automatic Reasoning, 2008, Vol. 40(4), 327-356.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps" target="_top">ps</A>].
- </TD>
-</TR>
-<TR><TD VALIGN=Top>[2]</TD>
- <TD ALIGN=Left>
- <B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions</B>
- (Christian Urban and Michael Norrish)
- Proceedings of the ACM Workshop on Mechanized Reasoning about Languages with Variable
- Binding and Names (MERLIN 2005). Tallinn, Estonia. September 2005. Pages 25-32. © ACM, Inc.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.ps" target="_top">ps</A>]
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.pdf" target="_top">pdf</A>]
- </TD>
-</TR>
-<TR><TD VALIGN=Top>[3]</TD>
- <TD ALIGN=Left>
- <B>A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL</B>
- (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. Seattle, USA. August 2006. Pages 498-512.
- © <A HREF="http://link.springer.de/link/service/series/0558/" target="_top">Springer Verlag</A>
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[4]</TD>
- <TD ALIGN=Left>
- <B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B>
- (Stefan Berghofer and Christian Urban)
- Proceedings of the International Workshop on Logical Frameworks and
- Meta-Languages: Theory and Practice (LFMTP 2006). Seattle, USA. ENTCS. Pages 53-67.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-06.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[5]</TD>
- <TD ALIGN=Left>
- <B>Barendregt's Variable Convention in Rule Inductions.</B> (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. Bremen, Germany. July 2007. Pages 35-50.
- © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm"
- target="_top">Springer Verlag</A>
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[6]</TD>
- <TD ALIGN=Left>
- <B>Mechanising the Metatheory of LF.</B>
- (Christian Urban, James Cheney and Stefan Berghofer)
- In Proc. of the 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE Computer Society,
- June 2008. Pages 45-56.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lics-08.pdf">pdf</A>] More
- information <A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/LF/index.html">elsewhere</A>.
- </TD>
-</TR>
-<TR><TD VALIGN=Top>[7]</TD>
- <TD ALIGN=Left>
- <B>Proof Pearl: A New Foundation for Nominal Isabelle.</B>
- (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.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>]
- </TD>
-</TR>
-</TR>
-<TR><TD VALIGN=Top>[8]</TD>
- <TD ALIGN=Left>
- <B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B>
- (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.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/esop-11.pdf">pdf</A>]
- </TD>
-</TR>
-
-</TABLE>
-</CENTER>
-
-<P><!-- Created: Tue Mar 4 00:23:25 GMT 1997 -->
-<!-- hhmts start -->
-Last modified: Mon May 9 05:35:17 BST 2011
-<!-- hhmts end -->
-<a href="http://validator.w3.org/check/referer" target="_top">[Validate this page.]</a>
-
-</body>
-</html>
--- a/Nominal/ijcar-08.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,18 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Frameset//EN"
- "http://www.w3.org/TR/html4/frameset.dtd">
-<html>
-<head>
- <meta content="text/html; charset=ISO-8859-1" http-equiv="content-type">
- <title>Nominal Methods Group</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
-
-<body>
-
-<META
- HTTP-EQUIV="Refresh"
- CONTENT="2; URL=http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/activities/nominal-ijcar08/">
-
-</body>
-</html>
--- a/Nominal/index.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,24 +0,0 @@
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Frameset//EN"
- "http://www.w3.org/TR/html4/frameset.dtd">
-<html>
-<head>
- <meta content="text/html; charset=ISO-8859-1" http-equiv="content-type">
- <title>Nominal Methods Group</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
- <frameset ROWS="130,*">
- <frame scrolling="no" frameborder="0" noresize="noresize" SRC="title.html" NAME="title">
-
- <frameset COLS="200,*">
-
- <frame scrolling="no" frameborder="0" noresize="noresize" SRC="menu.html"
- NAME="menu">
-
- <frame noresize="noresize" frameborder="0" SRC="main.html"
- NAME="content">
-
- </frameset>
- </frameset>
-
-</html>
--- a/Nominal/main.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,283 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>Nominal Methods Group</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
-<body>
-
-<div align="right" style="position:relative; left:15%; width:80%">
-<P>
-<small>
-<SCRIPT LANGUAGE="JAVASCRIPT" type="text/javascript">
-<!--
-var r_text = new Array ();
-r_text[0] = "<em>\"Proving theorems about substitutions (and related operations such as alpha-conversion) required far more time and HOL code than any other variety of theorem.\"<br><\/em>M. VanInwegen using a concrete representation for binders in her PhD-thesis, 1996";
-
-r_text[1] = "<em>\"When doing the formalization, I discovered that the core part of the proof... is fairly straightforward and only requires a good understanding of the paper version. However, in completing the proof I observed that in certain places I had to invest much more work than expected, e.g. proving lemmas about substitution and weakening.\"<\/em><br>T. Altenkirch using de Bruijn indices in Proc. of TLCA, 1993";
-
-r_text[2] = "<em>\"Technical work, however, still represents the biggest part of our implementation, mainly due to the managing of de Bruijn indexes...Of our 800 proved lemmas, about 600 are concerned with operators on free names.\"<\/em><br>D. Hirschkoff in Proc. of TPHOLs, 1997";
-
-r_text[3] = "<em>\"It took the author many long months to complete the work on this formalization...The part concerning substitution is by far the largest part of the whole development.\"<\/em><br>A. Koprowski using de Bruijn indices in a draft paper, 2006";
-
-r_text[4] = "<em>\"We thank T. Thacher Robinson for showing us on August 19, 1962 by a counterexample the existence of an error in our handling of bound variables.\"<\/em><br>S. Kleene in J. of Symbolic Logic 27(1):11-18, 1962";
-
-r_text[5] = "<em>\"The main drawback in HOAS is the difficulty of dealing with metatheoretic issues concerning names in processes...As a consequence, some metatheoretic properties involving substitution and freshness of names inside proofs and processes cannot be proved inside the framework and instead have to be postulated.\"<\/em><br>F. Honsell, M. Miculan and I. Scagnetto in Theoretical Computer Science, 253(2):239-285, 2001";
-
-r_text[6] = "<em>\"Because Twelf metatheorems are proved using totality assertions about LF type families, the class of metatheorems that can be mechanized is restricted to All/Exists-statements over LF types. On the one hand, as the successful Twelf formalizations cited in Section 5 demonstrate, these All/Exists-statements have proved to be sufficient for formalizing a wide variety of metatheorems about programming languages and logics. On the other hand, we have no way to quantify when metatheorems of this form will be sufficient, and there are some well-known examples of proofs that cannot be formalized directly using Twelf as metatheorem language. For example, proofs by logical relations often require more quantifier complexity than All/Exists-statements afford.\"<\/em><br>Robert Harper and Daniel Licata in a paper on Twelf, 2007";
-
-r_text[7] = "<em>\"So we cannot, hand-on-heart, recommend the vanilla LN style for anything but small, kernel language developments. \"<\/em><br>in F-ing Modules by Rossberg, Russo and Dreyer, TLDI 2010";
-
-r_text[8] = "<em>\"Higher-order abstract syntax is a convenient way to approach languages with binding, but it is possible to imagine a problem where manipulating a fully concrete object without binding is simpler. In these cases, it is possible to establish a bijection between your HOAS terms and de Bruijn versions of the same terms. \"<\/em><br>Interesting responses from the <A HREF=\"http://twelf.plparty.org/wiki/Ask_Twelf_Elf\">Twelf wiki.</A> (To be honest, the same comment applies to Nominal. --cu)";
-
-r_text[9] = "<em>\"I wonder if de Bruijn was any good at remembering names. \"<\/em><br>Darius Jahandarie according to Haskell Digest, Vol 97, Issue 1";
-
-var i = Math.floor(r_text.length * Math.random());
-document.write(r_text[i]);
-//-->
-</SCRIPT>
-</small>
-</P>
-</div>
-
-
-<H1>Our Vision</H1>
-
-<P>
-<IMG SRC="new.gif" ALT="" style="" align="left">
-<I>We are working on a major overhaul of Nominal Isabelle. The
-latest bundles of Nominal2 are
-<A HREF="http://inf.kcl.ac.uk/staff/urbanc/Nominal/download.html">here</A>.
-</I></P>
-
-
-<P>
-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
-<B>conveniently</B> about programming languages (for example the <A
-HREF="http://en.wikipedia.org/wiki/Lambda_calculus" target="_top">lambda
-calculus</A>) 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 <A HREF="http://www.cl.cam.ac.uk/~amp12/" target="_top">Andrew
-Pitts</A>. Our theoretical results about nominal theories enabled us to
-implement Nominal Isabelle on top of Isabelle/HOL.
-</P>
-
-<P>
-If you want to see a simple example illustrating our results on Nominal Isabelle click
-<A HREF="example.html">here</A>. For more interesting results, we already
-completed formalisations of Church-Rosser and strong-normalisation proofs as
-well as the first part of the <A
-HREF="https://www.seas.upenn.edu/~plclub/poplmark/" target="_top">PoplMark
-Challenge</A>. We also formalised some typical proofs from SOS, <A
-HREF="http://www.cs.cmu.edu/~crary/" target="_top">Karl Crary</A>'s chapter on
-logical relations from <A
-HREF="http://www.cis.upenn.edu/~bcpierce/attapl/index.html"
-target="_top">Advanced Topics in Types and Programming Languages</A>, and also
-a paper on LF by <A HREF="http://www.cs.cmu.edu/~rwh/" target="_top">Harper</A> and
-<A HREF="http://www.cs.cmu.edu/~fp/" target="_top">Pfenning</A>. 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:
-
-<ul>
-<li>
-<A HREF="http://www.it.uu.se/katalog/jesperb/" target="_top">Jesper Bengtson</A>
-and <A HREF="http://user.it.uu.se/~joachim/" target="_top">Joachim Parrow</A>
-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
-<a href="http://afp.sourceforge.net/entries/Pi_Calculus.shtml">here</a>. 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
-<a href="http://afp.sourceforge.net/entries/Psi_Calculi.shtml">here</a>. 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 (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>).
-All formalisations are part of the <A HREF="http://afp.sourceforge.net/">AFP</A>.
-<li>
-<A HREF="http://www.ccs.neu.edu/home/samth/" target="_top">Sam Tobin-Hochstadt</A>, a student
-of <A HREF="http://www.ccs.neu.edu/home/matthias/" target="_top">Matthias Felleisen</A>, used
-Nominal Isabelle to formalise their work on Typed Scheme. This was presented at POPL'08.
-
-<li>
-<A HREF="http://homepages.inf.ed.ac.uk/ldixon/" target="_top">Lucas Dixon</A>,
-Alan Smaill and <A HREF="http://homepages.inf.ed.ac.uk/bundy/"
-target="_top">Alan Bundy</A> used Nominal Isabelle to formalise
-proof terms of ILL and studied proof planning with this formalisation
-(EDI-INF-RR-0786).
-
-<li>
-<A HREF="http://www.cs.swan.ac.uk/~csteme/" target="_top">Temesghen Kahsai</A>
-and <A HREF="http://users.dimi.uniud.it/~marino.miculan/" target="_top">Marino Miculan</A> formalised
-the spi-calculus using our work - see
-<A HREF="http://www.cs.swan.ac.uk/~csteme/SpiInIsabelle/SpiInIsabelle.html" target="_top">here</A>.
-
-<li>
-Ayesha Yasmeen, a student of
-<A HREF="http://www-faculty.cs.uiuc.edu/~egunter/" target="_top">Elsa Gunter</A>,
-formalised an extension of the ambient calculus using Nominal Isabelle. This
-was presented in the Emerging Trends section of TPHOLs'08.
-
-<li>
-<A HREF="http://www.ps.uni-saarland.de/~doczkal/" target="_top">Christian Doczkal</A>,
-a student of <A HREF="http://www.ps.uni-saarland.de/~smolka/">Gert Smolka</A>,
-finished in 2009 his
-<A HREF="http://www.ps.uni-saarland.de/~doczkal/master/master.php" target="_top">master thesis</A>
-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 <A HREF="http://afp.sourceforge.net/entries/Lam-ml-Normalization.shtml">AFP repository</A>.
-
-<li>
-Armin Heller finished his master thesis at the TU Munich in 2010 with a simple compiler verification
-using Nominal Isabelle.
-
-<li>
-<A HREF="http://homepages.inf.ed.ac.uk/jcheney/" target="_top">James Cheney</A>
-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.
-
-<li>
-<A HREF="http://cl-informatik.uibk.ac.at/users/cek/" target="_top">Cezary Kaliszyk</A>
-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.
-
-<li>
-<A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A>
-used Nominal2 for formalising Launchbury's natural semantics for lazy evaluation. This is part
-of the <A HREF="http://afp.sourceforge.net/entries/Launchbury.shtml">AFP</A>.
-
-<li>
-<A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A>
-formalised Gödel's Incompletness Theorems using Nominal2. This work
-appeared in the Journal of Automated Reasoning in 2015.
-
-<li>
-<A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A>
-proved the correctness of a GHC compiler transformation using Nominal2.
-This work appeared at the
-<A HREF="https://www.haskell.org/haskell-symposium/2015/">Haskell Symposium 2015</A>.
-</ul>
-</P>
-
-<P>
-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)
-<a href="https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/nominal-isabelle" target="_top">
-mailing list</a> to hear about our progress and to give
-us feedback.</P>
-
-<P>
-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].
-</P><BR>
-
-<B>References</B><BR><BR>
-<CENTER>
-<TABLE>
-<TR><TD WIDTH="7%" VALIGN=Top>[1]</TD>
- <TD ALIGN=Left>
- <B>Nominal Reasoning Techniques in Isabelle/HOL.</B> In
- Journal of Automatic Reasoning, Vol. 40(4), 327-356, 2008.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps" target="_top">ps</A>].
- The predecessor paper, which appeaerd at CADE in 2005, received the
- <A HREF="http://www.cadeinc.org/SkolemAward.html">Thoralf Skolem Award</A>.
- </TD>
-</TR>
-<TR><TD VALIGN=Top>[2]</TD>
- <TD ALIGN=Left>
- <B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions</B>
- (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.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.ps" target="_top">ps</A>]
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.pdf" target="_top">pdf</A>]
- </TD>
-</TR>
-<TR><TD VALIGN=Top>[3]</TD>
- <TD ALIGN=Left>
- <B>A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL</B>
- (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.
- © <A HREF="http://link.springer.de/link/service/series/0558/" target="_top">Springer Verlag</A>
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[4]</TD>
- <TD ALIGN=Left>
- <B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B>
- (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.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-06.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[5]</TD>
- <TD ALIGN=Left>
- <B>Barendregt's Variable Convention in Rule Inductions.</B> (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.
- © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm"
- target="_top">Springer Verlag</A>
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[6]</TD>
- <TD ALIGN=Left>
- <B>Mechanising the Metatheory of LF.</B>
- (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.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lics-08.pdf">pdf</A>] More
- information <A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/LF/index.html">elsewhere</A>.
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[7]</TD>
- <TD ALIGN=Left>
- <B>Proof Pearl: A New Foundation for Nominal Isabelle.</B>
- (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.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[8]</TD>
- <TD ALIGN=Left>
- <B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B>
- (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.
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/esop-11.pdf">pdf</A>] (and a
- longer version appeared in the Journal of Logical Methods in Computer
- Science, Volume 8 (2:14), 2012
- [<A HREF="http://http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>])
- </TD>
-
-</TR>
-
-
-
-</TABLE>
-</CENTER>
-
-<P>
-<a href="http://validator.w3.org/check/referer" target="_top">[Validate this page.]</a>
-
-</body>
-</html>
--- a/Nominal/main.html~ Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,283 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>Nominal Methods Group</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
-<body>
-
-<div align="right" style="position:relative; left:15%; width:80%">
-<P>
-<small>
-<SCRIPT LANGUAGE="JAVASCRIPT" type="text/javascript">
-<!--
-var r_text = new Array ();
-r_text[0] = "<em>\"Proving theorems about substitutions (and related operations such as alpha-conversion) required far more time and HOL code than any other variety of theorem.\"<br><\/em>M. VanInwegen using a concrete representation for binders in her PhD-thesis, 1996";
-
-r_text[1] = "<em>\"When doing the formalization, I discovered that the core part of the proof... is fairly straightforward and only requires a good understanding of the paper version. However, in completing the proof I observed that in certain places I had to invest much more work than expected, e.g. proving lemmas about substitution and weakening.\"<\/em><br>T. Altenkirch using de Bruijn indices in Proc. of TLCA, 1993";
-
-r_text[2] = "<em>\"Technical work, however, still represents the biggest part of our implementation, mainly due to the managing of de Bruijn indexes...Of our 800 proved lemmas, about 600 are concerned with operators on free names.\"<\/em><br>D. Hirschkoff in Proc. of TPHOLs, 1997";
-
-r_text[3] = "<em>\"It took the author many long months to complete the work on this formalization...The part concerning substitution is by far the largest part of the whole development.\"<\/em><br>A. Koprowski using de Bruijn indices in a draft paper, 2006";
-
-r_text[4] = "<em>\"We thank T. Thacher Robinson for showing us on August 19, 1962 by a counterexample the existence of an error in our handling of bound variables.\"<\/em><br>S. Kleene in J. of Symbolic Logic 27(1):11-18, 1962";
-
-r_text[5] = "<em>\"The main drawback in HOAS is the difficulty of dealing with metatheoretic issues concerning names in processes...As a consequence, some metatheoretic properties involving substitution and freshness of names inside proofs and processes cannot be proved inside the framework and instead have to be postulated.\"<\/em><br>F. Honsell, M. Miculan and I. Scagnetto in Theoretical Computer Science, 253(2):239-285, 2001";
-
-r_text[6] = "<em>\"Because Twelf metatheorems are proved using totality assertions about LF type families, the class of metatheorems that can be mechanized is restricted to All/Exists-statements over LF types. On the one hand, as the successful Twelf formalizations cited in Section 5 demonstrate, these All/Exists-statements have proved to be sufficient for formalizing a wide variety of metatheorems about programming languages and logics. On the other hand, we have no way to quantify when metatheorems of this form will be sufficient, and there are some well-known examples of proofs that cannot be formalized directly using Twelf as metatheorem language. For example, proofs by logical relations often require more quantifier complexity than All/Exists-statements afford.\"<\/em><br>Robert Harper and Daniel Licata in a paper on Twelf, 2007";
-
-r_text[7] = "<em>\"So we cannot, hand-on-heart, recommend the vanilla LN style for anything but small, kernel language developments. \"<\/em><br>in F-ing Modules by Rossberg, Russo and Dreyer, TLDI 2010";
-
-r_text[8] = "<em>\"Higher-order abstract syntax is a convenient way to approach languages with binding, but it is possible to imagine a problem where manipulating a fully concrete object without binding is simpler. In these cases, it is possible to establish a bijection between your HOAS terms and de Bruijn versions of the same terms. \"<\/em><br>Interesting responses from the <A HREF=\"http://twelf.plparty.org/wiki/Ask_Twelf_Elf\">Twelf wiki.</A> (To be honest, the same comment applies to Nominal. --cu)";
-
-r_text[9] = "<em>\"I wonder if de Bruijn was any good at remembering names. \"<\/em><br>Darius Jahandarie according to Haskell Digest, Vol 97, Issue 1";
-
-var i = Math.floor(r_text.length * Math.random());
-document.write(r_text[i]);
-//-->
-</SCRIPT>
-</small>
-</P>
-</div>
-
-
-<H1>Our Vision</H1>
-
-<P>
-<IMG SRC="new.gif" ALT="" style="" align="left">
-<I>We are working on a major overhaul of Nominal Isabelle. The
-latest bundles of Nominal2 are
-<A HREF="http://inf.kcl.ac.uk/staff/urbanc/Nominal/download.html">here</A>.
-</I></P>
-
-
-<P>
-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
-<B>conveniently</B> about programming languages (for example the <A
-HREF="http://en.wikipedia.org/wiki/Lambda_calculus" target="_top">lambda
-calculus</A>) 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 <A HREF="http://www.cl.cam.ac.uk/~amp12/" target="_top">Andrew
-Pitts</A>. Our theoretical results about nominal theories enabled us to
-implement Nominal Isabelle on top of Isabelle/HOL.
-</P>
-
-<P>
-If you want to see a simple example illustrating our results on Nominal Isabelle click
-<A HREF="example.html">here</A>. For more interesting results, we already
-completed formalisations of Church-Rosser and strong-normalisation proofs as
-well as the first part of the <A
-HREF="https://www.seas.upenn.edu/~plclub/poplmark/" target="_top">PoplMark
-Challenge</A>. We also formalised some typical proofs from SOS, <A
-HREF="http://www.cs.cmu.edu/~crary/" target="_top">Karl Crary</A>'s chapter on
-logical relations from <A
-HREF="http://www.cis.upenn.edu/~bcpierce/attapl/index.html"
-target="_top">Advanced Topics in Types and Programming Languages</A>, and also
-a paper on LF by <A HREF="http://www.cs.cmu.edu/~rwh/" target="_top">Harper</A> and
-<A HREF="http://www.cs.cmu.edu/~fp/" target="_top">Pfenning</A>. 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:
-
-<ul>
-<li>
-<A HREF="http://www.it.uu.se/katalog/jesperb/" target="_top">Jesper Bengtson</A>
-and <A HREF="http://user.it.uu.se/~joachim/" target="_top">Joachim Parrow</A>
-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
-<a href="http://afp.sourceforge.net/entries/Pi_Calculus.shtml">here</a>. 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
-<a href="http://afp.sourceforge.net/entries/Psi_Calculi.shtml">here</a>. 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 (<a href="http://afp.sourceforge.net/entries/CCS.shtml">here</a>).
-All formalisations are part of the <A HREF="http://afp.sourceforge.net/">AFP</A>.
-<li>
-<A HREF="http://www.ccs.neu.edu/home/samth/" target="_top">Sam Tobin-Hochstadt</A>, a student
-of <A HREF="http://www.ccs.neu.edu/home/matthias/" target="_top">Matthias Felleisen</A>, used
-Nominal Isabelle to formalise their work on Typed Scheme. This was presented at POPL'08.
-
-<li>
-<A HREF="http://homepages.inf.ed.ac.uk/ldixon/" target="_top">Lucas Dixon</A>,
-Alan Smaill and <A HREF="http://homepages.inf.ed.ac.uk/bundy/"
-target="_top">Alan Bundy</A> used Nominal Isabelle to formalise
-proof terms of ILL and studied proof planning with this formalisation
-(EDI-INF-RR-0786).
-
-<li>
-<A HREF="http://www.cs.swan.ac.uk/~csteme/" target="_top">Temesghen Kahsai</A>
-and <A HREF="http://users.dimi.uniud.it/~marino.miculan/" target="_top">Marino Miculan</A> formalised
-the spi-calculus using our work - see
-<A HREF="http://www.cs.swan.ac.uk/~csteme/SpiInIsabelle/SpiInIsabelle.html" target="_top">here</A>.
-
-<li>
-Ayesha Yasmeen, a student of
-<A HREF="http://www-faculty.cs.uiuc.edu/~egunter/" target="_top">Elsa Gunter</A>,
-formalised an extension of the ambient calculus using Nominal Isabelle. This
-was presented in the Emerging Trends section of TPHOLs'08.
-
-<li>
-<A HREF="http://www.ps.uni-saarland.de/~doczkal/" target="_top">Christian Doczkal</A>,
-a student of <A HREF="http://www.ps.uni-saarland.de/~smolka/">Gert Smolka</A>,
-finished in 2009 his
-<A HREF="http://www.ps.uni-saarland.de/~doczkal/master/master.php" target="_top">master thesis</A>
-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 <A HREF="http://afp.sourceforge.net/entries/Lam-ml-Normalization.shtml">AFP repository</A>.
-
-<li>
-Armin Heller finished his master thesis at the TU Munich in 2010 with a simple compiler verification
-using Nominal Isabelle.
-
-<li>
-<A HREF="http://homepages.inf.ed.ac.uk/jcheney/" target="_top">James Cheney</A>
-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.
-
-<li>
-<A HREF="http://cl-informatik.uibk.ac.at/users/cek/" target="_top">Cezary Kaliszyk</A>
-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.
-
-<li>
-<A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A>
-used Nominal2 for formalising Launchbury's natural semantics for lazy evaluation. This is part
-of the <A HREF="http://afp.sourceforge.net/entries/Launchbury.shtml">AFP</A>.
-
-<li>
-<A HREF="http://www.cl.cam.ac.uk/~lp15/" target="_top">Larry Paulson</A>
-formalised Gödel's Incompletness Theorems using Nominal2. This work
-appeared in the Journal of Automated Reasoning in 2015.
-
-<li>
-<A HREF="http://www.joachim-breitner.de/blog/" target="_top">Joachim Breitner</A>
-proved the correctness of a GHC compiler transformation using Nominal2.
-This work appeared at the
-<A HREF="https://www.haskell.org/haskell-symposium/2015/">Haskell Symposium 2015</A>.
-</ul>
-</P>
-
-<P>
-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)
-<a href="https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/nominal-isabelle" target="_top">
-mailing list</a> to hear about our progress and to give
-us feedback.</P>
-
-<P>
-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].
-</P><BR>
-
-<B>References</B><BR><BR>
-<CENTER>
-<TABLE>
-<TR><TD WIDTH="7%" VALIGN=Top>[1]</TD>
- <TD ALIGN=Left>
- <B>Nominal Reasoning Techniques in Isabelle/HOL.</B> In
- Journal of Automatic Reasoning, Vol. 40(4), 327-356, 2008.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nom-tech.ps" target="_top">ps</A>].
- The predecessor paper, which appeaerd at CADE in 2005, received the
- <A HREF="http://www.cadeinc.org/SkolemAward.html">Thoralf Skolem Award</A>.
- </TD>
-</TR>
-<TR><TD VALIGN=Top>[2]</TD>
- <TD ALIGN=Left>
- <B>A Formal Treatment of the Barendregt Variable Convention in Rule Inductions</B>
- (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.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.ps" target="_top">ps</A>]
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/merlin-05.pdf" target="_top">pdf</A>]
- </TD>
-</TR>
-<TR><TD VALIGN=Top>[3]</TD>
- <TD ALIGN=Left>
- <B>A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL</B>
- (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.
- © <A HREF="http://link.springer.de/link/service/series/0558/" target="_top">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/ijcar-06.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[4]</TD>
- <TD ALIGN=Left>
- <B>A Head-to-Head Comparison of de Bruijn Indices and Names.</B>
- (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.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lfmtp-06.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[5]</TD>
- <TD ALIGN=Left>
- <B>Barendregt's Variable Convention in Rule Inductions.</B> (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.
- © <A HREF="http://link.springer.de/link/service/series/0558/tocs/t4603.htm"
- target="_top">Springer Verlag</A>
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/cade07.ps" target="_top">ps</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[6]</TD>
- <TD ALIGN=Left>
- <B>Mechanising the Metatheory of LF.</B>
- (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.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lics-08.pdf">pdf</A>] More
- information <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/LF/index.html">elsewhere</A>.
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[7]</TD>
- <TD ALIGN=Left>
- <B>Proof Pearl: A New Foundation for Nominal Isabelle.</B>
- (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.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/nominal-atoms.pdf">pdf</A>]
- </TD>
-</TR>
-
-<TR><TD VALIGN=Top>[8]</TD>
- <TD ALIGN=Left>
- <B>General Bindings and Alpha-Equivalence in Nominal Isabelle.</B>
- (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.
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/esop-11.pdf">pdf</A>] (and a
- longer version appeared in the Journal of Logical Methods in Computer
- Science, Volume 8 (2:14), 2012
- [<A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/lmcs.pdf">pdf</A>])
- </TD>
-
-</TR>
-
-
-
-</TABLE>
-</CENTER>
-
-<P>
-<a href="http://validator.w3.org/check/referer" target="_top">[Validate this page.]</a>
-
-</body>
-</html>
--- a/Nominal/menu.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>Menu</title>
- <style type="text/css">
- a:link{text-decoration:none;}
- a:visited{text-decoration:none;}
- a:hover{text-decoration:underline;}
- </style>
-</head>
-
-
-<body style="color: rgb(0,0,0);" alink="#000099" link="#000099" vlink="#990099">
-
-<span style="font-weight: bold; color: rgb(255, 255, 255);"></span>
-<table style="text-align: left; width: 100%;" border="0" cellpadding="2" cellspacing="0">
-
-
-<tbody>
-
-<tr>
-<td style="background-color: rgb(117, 117, 218);"><span style="font-weight: bold; color: rgb(255, 255, 255);">
-Navigation</span></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"> <a href="main.html" target="content">
-Overview</a> </td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a target="content" href="documentation.html">
-Documentation</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="download.html" target="content">
-Download</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/nominal-isabelle" target="_top">
-Mailing List</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="activities.html" target="content">
-Activities</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(117, 117, 218);"><span style="font-weight: bold; color: rgb(255, 255, 255);">
-Members and Local Friends</span></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.inf.kcl.ac.uk/staff/urbanc/" target="_top">
-Christian Urban</a> (chair)</td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://cl-informatik.uibk.ac.at/users/cek/" target="_top">
-Cezary Kaliszyk</a> </td>
-</tr>
-
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);">Chunhan Wu</td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(117, 117, 218);"><span style="font-weight: bold; color: rgb(255, 255, 255);">
-International Friends</span></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.cl.cam.ac.uk/~amp12/" target="_top">
-Andrew Pitts</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www4.in.tum.de/~berghofe/" target="_top">
-Stefan Berghofer</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www4.in.tum.de/~wenzelm/" target="_top">
-Markus Wenzel</a></td>
-</tr>
-
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.cis.upenn.edu/~bcpierce/" target="_top">
-Benjamin Pierce</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.cis.upenn.edu/~stevez/" target="_top">
-Steve Zdancewic</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://ssrg.nicta.com.au/people/?cn=Michael+Norrish" target="_top">
-Michael Norrish</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://homepages.inf.ed.ac.uk/jcheney/" target="_top">
-James Cheney</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.itu.dk/people/jebe/" target="_top">
-Jesper Bengtson</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://dpt-info.u-strasbg.fr/~narboux/" target="_top">
-Julien Narboux</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://homepages.inf.ed.ac.uk/rap/" target="_top">
-Randy Pollack</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://user.it.uu.se/~tjawe125/" target="_top">
-Tjark Weber</a></td>
-</tr>
-
-</tbody>
-</table>
-
-</script -->
-</body>
-</html>
--- a/Nominal/menu.html~ Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,138 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>Menu</title>
- <style type="text/css">
- a:link{text-decoration:none;}
- a:visited{text-decoration:none;}
- a:hover{text-decoration:underline;}
- </style>
-</head>
-
-
-<body style="color: rgb(0,0,0);" alink="#000099" link="#000099" vlink="#990099">
-
-<span style="font-weight: bold; color: rgb(255, 255, 255);"></span>
-<table style="text-align: left; width: 100%;" border="0" cellpadding="2" cellspacing="0">
-
-
-<tbody>
-
-<tr>
-<td style="background-color: rgb(117, 117, 218);"><span style="font-weight: bold; color: rgb(255, 255, 255);">
-Navigation</span></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"> <a href="main.html" target="content">
-Overview</a> </td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a target="content" href="documentation.html">
-Documentation</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="download.html" target="content">
-Download</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="https://mailmanbroy.informatik.tu-muenchen.de/mailman/listinfo/nominal-isabelle" target="_top">
-Mailing List</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="activities.html" target="content">
-Activities</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(117, 117, 218);"><span style="font-weight: bold; color: rgb(255, 255, 255);">
-Members and Local Friends</span></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.inf.kcl.ac.uk/staff/urbanc/" target="_top">
-Christian Urban</a> (chair)</td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://cl-informatik.uibk.ac.at/users/cek/" target="_top">
-Cezary Kaliszyk</a> </td>
-</tr>
-
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);">Chunhan Wu</td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(117, 117, 218);"><span style="font-weight: bold; color: rgb(255, 255, 255);">
-International Friends</span></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.cl.cam.ac.uk/~amp12/" target="_top">
-Andrew Pitts</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www4.in.tum.de/~berghofe/" target="_top">
-Stefan Berghofer</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www4.in.tum.de/~wenzelm/" target="_top">
-Markus Wenzel</a></td>
-</tr>
-
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.cis.upenn.edu/~bcpierce/" target="_top">
-Benjamin Pierce</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.cis.upenn.edu/~stevez/" target="_top">
-Steve Zdancewic</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://users.rsise.anu.edu.au/~michaeln/" target="_top">
-Michael Norrish</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://homepages.inf.ed.ac.uk/jcheney/" target="_top">
-James Cheney</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://www.it.uu.se/katalog/jesperb/" target="_top">
-Jesper Bengtson</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://dpt-info.u-strasbg.fr/~narboux/" target="_top">
-Julien Narboux</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://homepages.inf.ed.ac.uk/rap/" target="_top">
-Randy Pollack</a></td>
-</tr>
-
-<tr>
-<td style="background-color: rgb(224, 224, 240);"><a href="http://user.it.uu.se/~tjawe125/" target="_top">
-Tjark Weber</a></td>
-</tr>
-
-</tbody>
-</table>
-
-</script -->
-</body>
-</html>
--- a/Nominal/oregon.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,21 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>The Nominal Datatype Package</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
-<body>
-
-<META
- HTTP-EQUIV="Refresh"
- CONTENT="2; URL=http://http://www.inf.kcl.ac.uk/staff/urbanc/Nominal/activities/oregon.html">
-
-
-
-</body>
-</html>
-
-
-
--- a/Nominal/title.html-- Wed Mar 30 17:27:34 2016 +0100
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,19 +0,0 @@
-<?xml version="1.0" encoding="utf-8"?>
-<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
-<html>
-<head>
- <title>The Nominal Datatype Package</title>
- <link rel="stylesheet" href="nominal.css">
-</head>
-
-<body style="background-image: url(graphics/header-back.jpg);">
-<img src="graphics/nominal_logo.gif" alt="The Nominal Datatype Package" style="border-width: 0px;" align="left">
-<h1>Nominal Methods Group</h1>
-<P ALIGN=right>
-<I>funded by the German Research Foundation (<A HREF="http://www.dfg.de/en" target="_top">DFG</A>) within the
-<A HREF="http://en.wikipedia.org/wiki/Emmy_Noether" target="_top">Emmy-Noether</A>
-<A HREF="http://www.dfg.de/en/research_funding/promoting_young_researchers/emmy_noether/index.html" target="_top">Programme</A></I>
-</P>
-
-</body>
-</html>
--- a/cgi-bin/repos.cgi Wed Mar 30 17:27:34 2016 +0100
+++ b/cgi-bin/repos.cgi Wed Mar 30 20:11:37 2016 +0100
@@ -7,7 +7,7 @@
sys.path.append("/usr/local/lib/python2.7/site-packages/")
# enable importing on demand to reduce startup time
-from mercurial import demandimport; demandimport.enable()
+#from mercurial import demandimport; demandimport.enable()
# Uncomment to send python tracebacks to the browser if an error occurs:
import cgitb