--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/Nominal/activities/announcement.tex	Wed Mar 30 17:27:34 2016 +0100
@@ -0,0 +1,115 @@
+\documentclass[12pt]{article}
+\usepackage{amsmath}
+\usepackage{amssymb}
+\usepackage[latin1]{inputenc}
+\usepackage{times}
+\usepackage{color}
+\usepackage{a0size}
+\usepackage{graphicx}
+\usepackage{xcolor} 
+
+\addtolength{\textheight}{2cm}
+\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}
+\color{black}
+\mbox{}\\[-15mm]
+
+\begin{center}
+\begin{tabular}{@{}c@{}}
+  {\bf\LARGE Hands-On Introduction to Nominal Isabelle}\medskip\\
+  {\bf\Large One-Day Tutorial at POPL}\bigskip\\
+  \includegraphics[scale=0.4]{logo.png}\bigskip\\
+  {\bf \large Date: 23rd January 2011}
+\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, 
+ substitution lemma,\\
+ & Isar proof-language\\ 
+
+Session II: &
+ strong induction principles, contexts with holes,\\ 
+ & beta-reduction\\ 
+
+Session III: &
+ variable convention, evaluation relations, 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}
+{\huge\boldmath\textcolor{gray}{$\forall$}}
+{\veryHuge\textcolor{gray}{$\lambda$}}
+\raisebox{-1mm}{\includegraphics[scale=0.5]{popl1.png}}
+\raisebox{4mm}{\Huge\boldmath\textcolor{gray}{$\#$}}
+{\huge\boldmath\textcolor{gray}{$\vdash$}}
+\end{center}
+
+\newpage
+\mbox{}
+\end{document}
+
+
+%%% Local Variables:  
+%%% mode: latex
+%%% TeX-master: t
+%%% TeX-command-default: "PdfLaTeX"
+%%% TeX-view-style: (("." "kpdf %s.pdf"))
+%%% End: 
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+