<?xml version="1.0" encoding="utf-8"?>
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<title>One-day Workshop at POPL 2011</title>
</head>
<body>
<h1 align="center">One-Day Tutorial at <A HREF="http://www.cse.psu.edu/popl/11/" target="_top">POPL 2011</A></h1>
<p align="center"><a href="http://isabelle.in.tum.de/nominal">
<img src="http://isabelle.in.tum.de/nominal/graphics/nominal_logo.gif"
alt="isabelle logo" style="border-width: 0px"></a></p>
<h2 align="center">Introduction to Nominal Isabelle</h2>
<p></p>
<div align="center">
<table width="80%">
<tbody>
<tr>
<td align="left">
<p> <b>Time and Location:</b>
23rd January at <A HREF="http://www.cse.psu.edu/popl/11/" target="_top">POPL 2011</A> in
Austin, USA.
</p>
<IMG SRC="http://isabelle.in.tum.de/nominal/new.gif" ALT="" style="" align="left"><BR><BR>
<a href="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/raw-file/tip/Tutorial/Lambda.thy">Lambda.thy</a><BR>
<a href="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/raw-file/tip/Tutorial/Tutorial1.thy">Tutorial1.thy</a><BR>
<a href="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/raw-file/tip/Tutorial/Tutorial2.thy">Tutorial2.thy</a><BR>
<a href="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/raw-file/tip/Tutorial/Tutorial3.thy">Tutorial3.thy</a><BR>
<a href="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/raw-file/tip/Tutorial/Tutorial4.thy">Tutorial4.thy</a><BR>
<a href="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/raw-file/tip/Tutorial/Tutorial5.thy">Tutorial5.thy</a><BR>
<a href="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/raw-file/tip/Tutorial/Tutorial6.thy">Tutorial6.thy</a><BR>
<BR>
<p><b>Overview:</b><br>
Dealing with binders, renaming of bound variables, capture-avoiding
substitution, etc., is very often a major problem in formal proofs
from the lambda-calculus and programming language theory.
<A HREF="http://isabelle.in.tum.de/nominal/">Nominal
Isabelle</A> provides an infrastructure for reasoning conveniently about
bound variables and alpha-equivalence classes in the proof assistant
<A HREF="http://isabelle.in.tum.de/">Isabelle</A>.
The aim of this tutorial is to give participants a reading
knowledge of nominal techniques and allow them to start using
Nominal Isabelle in their own work.
</p>
<b>Programme:</b><br>
The tutorial will be organised around four sessions:
<ul>
<li><b>08:00 - 09:00</b> Help with the installation. If at all possible, already have
Nominal Isabelle installed! See below for instructions.<br>
<li><b>09:00 - 10:30 Session I</b>
</li>
<li><b>11:00 - 12:30 Session II</b>
</li>
<li><b>12:30 - 14:00 Lunch</b> (in hotel)
</li>
<li><b>14:00 - 15:30 Session III</b>
<li><b>16:00 - 17:30 Session IV</b>
</ul>
<b>Download and Installation:</b><br>
For the tutorial, you need to install one of the following bundles:
<ul>
<li>Linux:
<A HREF="http://www4.in.tum.de/~urbanc/nominal_isabelle_20-Jan-2011-linux.tgz">nominal_isabelle_20-Jan-2011-linux.tgz</A> (243.7 MB)</li>
<li>MacOSX:
<A HREF="http://www4.in.tum.de/~urbanc/nominal_isabelle_20-Jan-2011.dmg">nominal_isabelle_20-Jan-2011.dmg</A> (221.2 MB)</li>
<li>Windows:
<A HREF="http://www4.in.tum.de/~urbanc/nominal_isabelle_20-Jan-2011-cygwin.tgz">nominal_isabelle_20-Jan-2011-cygwin.tgz</A> (243.4 MB)</li>
</ul>
For Linux and MacOSX, just unpack them and start Isabelle by typing on the command line:
<ul>
<li>Linux:<BR>
<tt>nominal_isabelle_20-Jan-2011/bin/isabelle jedit -l HOL-Nominal2 Minimal.thy</tt></li>
<li>MacOSX:<BR>
<tt>nominal_isabelle_20-Jan-2011.app/Isabelle/bin/isabelle jedit -l HOL-Nominal2 Minimal.thy</tt></li>
</ul>
Windows needs a bit more work explained <A HREF="http://www4.in.tum.de/~wenzelm/test/Isabelle_14-Jan-2011/download.html">here</A>. Once done, start Isabelle with
<ul>
<li>Windows:<BR>
<tt>nominal_isabelle_20-Jan-2011/bin/isabelle jedit -l HOL-Nominal2 Minimal.thy</tt></li>
</ul>
A testfile is <A HREF="http://www4.in.tum.de/~urbanc/cgi-bin/repos.cgi/nominal2/raw-file/tip/Tutorial/Minimal.thy">Minimal.thy</A>.
Further installation instructions and minimal requirements are <A HREF="http://www4.in.tum.de/~wenzelm/test/Isabelle_14-Jan-2011/download.html">here</A>. You are done, if you see a window like
<p align="center">
<img src="http://www4.in.tum.de/~urbanc/screen.png"
alt="screen" style="border-width: 0px"></p>
<p><b>Target audience:</b><br>
Researchers and doctoral students who want to use Nominal Isabelle to
formalise proofs from the lambda-calculus, from programming language theory or
from proof theory,
such as type soundness, Church Rosser, strong normalisation and so on. The tutorial is
designed for people who have <b>not</b> necessarily used Isabelle or Nominal Isabelle
before, nor have used any other proof assistant.
</p><BR><BR><BR>
</table>
</div>
<hr>
<!-- Created: Wed Jan 2 17:57:20 CET 2008 -->
<!-- hhmts start -->
Last modified: Sun Jan 23 14:09:03 CET 2011
<!-- hhmts end -->
<a href="http://validator.w3.org/check/referer">[Validate this page.]</a>
</body>
</html>