\documentclass[12pt]{article}

%%\usepackage{dina4}

\usepackage{amsmath}

\usepackage{amssymb}

\usepackage[latin1]{inputenc}

\usepackage{epsfig}

\usepackage{times}

\usepackage{pstricks,pst-grad}

\usepackage{wallpaper}

\usepackage{color}

\usepackage{a0size}

%%\usepackage{lmodern}

\addtolength{\textheight}{2cm}

\newpsobject{showgrid}{psgrid}{subgriddiv=2,griddots=10,gridlabels=6pt}

\renewcommand{\huge}{\fontsize{51.6}{64}\selectfont}

\renewcommand{\Huge}{\fontsize{61.92}{77}\selectfont}

\newcommand{\veryHuge}{\fontsize{74.3}{93}\selectfont}

\newcommand{\VeryHuge}{\fontsize{89.16}{112}\selectfont}

\newcommand{\VERYHuge}{\fontsize{107}{134}\selectfont}

\pagestyle{empty}

\begin{document}

%%\CenterWallPaper{1}{australia}

\color{black}

\mbox{}\\[-15mm]

\begin{center}

\begin{tabular}{@{}c@{}}

  {\bf\LARGE Hands-On Introduction to Nominal Isabelle}\medskip\\

  {\bf\Large One-Day Tutorial at IJCAR'08 in Sydney}\bigskip\\

  \includegraphics[width=4cm,angle=0]{logo.eps}\bigskip\\

  {\bf \large Time: 11th August (just before IJCAR)}

\end{tabular}

\end{center}

\noindent

{\bf Overview:}

Dealing with binders, renaming of bound variables, capture-avoid\-ing

substitution, etc., is very often a major problem in formal proofs about the

lambda-calculus and programming language theory. Nominal Isabelle provides an

infrastructure for reasoning conveniently about bound variables and

alpha-equivalence classes in the proof assistant Isabelle. The aim of the

tutorial is to give participants a reading knowledge of nominal

techniques and allow them to start using Nominal Isabelle in their

own work.  The tutorial will be hands-on and therefore participants are 

encouraged to bring their own laptop.

\bigskip

\noindent

{\bf Programme:}

\begin{center}

\begin{tabular}{rp{10cm}}

Session I: &

 basics, alpha-equivalence classes, 

 substitution lemma,\\

 & Isar proof language\\ 

Session II: &

 strong induction principles, contexts with holes,\\ 

 & beta-reduction\\ 

Session III: &

 variable convention, evaluation relation, CK-machines\\

Session IV: &

 functions, type-preservation, progress lemma\\ 

\end{tabular}

\end{center}\bigskip

\noindent

{\bf Target audience:} 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 not necessarily used Isabelle before, nor have used any other proof 

assistant.\bigskip

\noindent

{\bf More Information:} See\hspace{2mm} {\tt http://isabelle.in.tum.de/nominal/}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

\begin{center}

\begin{pspicture}(0.7,0)(13,3.0)

%\showgrid%

\rput(6.8,1){\includegraphics[width=3cm,angle=0]{australia.ps}}%

\pscircle[fillstyle=solid,fillcolor=red](7.95,0.3){0.15}%

\rput[b](2,0){\huge\boldmath\textcolor{gray}{$\forall$}}

\rput[b](4,0){\veryHuge\textcolor{gray}{$\lambda$}}

\rput[b](10.1,0){\Huge\boldmath\textcolor{gray}{$\#$}}

\rput[b](12.5,0){\huge\boldmath\textcolor{gray}{$\vdash$}}

\end{pspicture}

\end{center}

% If you have missed the recent Coq-workshop,

%this is your second chance. If you have have been there, the tutorial will

%demonstrate an alternative approach to writing POPL papers (see elsewhere).

\end{document}

% Using Proof Assistants for Programming Language Research or,

% How to write your next POPL paper in Coq

% San Francisco, CA

% January 8th, 2008

% A tutorial on the use of the Coq proof assistant in formalizing programming

% language metatheory.  This tutorial will be tailored to people who are

% familiar with syntactic proofs of programming language metatheory, such as

% type soundness, but have never used a proof assistant to create a nd check

% such proofs. At the end of the session, participants will have a reading

% knowledge of Coq and a running start on using Coq in their own work.  This

% tutorial will be hands-on; participants are strongly encouraged to bring a

% laptop running Coq 8.1 (or a later release) and either Proof General or

% CoqIDE. The POPLmark wiki has instruc tions for installing Coq and Proof

% General.

% Registration for the tutorial is online, through the POPL 2008 website.

% Topics

% Defining language semantics in Coq 

% Abstract syntax

% Inductively-defined relations

% Derivations

% Proving simple results 

% Fundamental tactics

% Automation

% Forward and backward reasoning

% Scaling up to POPLmark 

% Semantic functions and conversion

% Sets and environments

% Representing binding 

% Locally nameless representation

% Freshness through cofinite quantification

% Syntactic type soundness

% Materials

% The Coq code and documentation for this tutorial is available online. If you

% are attending the tutorial, we encourage you to download these materials and

% compile them beforehand. If you are not attending, these materials are self

% contained; you are welcome and encouraged to step through them on your own.