|
1485
|
1 |
\documentclass{acmconf}
|
|
1493
|
2 |
\usepackage{isabelle}
|
|
|
3 |
\usepackage{isabellesym}
|
|
|
4 |
\usepackage{amsmath}
|
|
|
5 |
\usepackage{amssymb}
|
|
1506
|
6 |
\usepackage{tikz}
|
|
|
7 |
\usepackage{pgf}
|
|
|
8 |
\usepackage{pdfsetup}
|
|
754
|
9 |
|
|
|
10 |
\urlstyle{rm}
|
|
|
11 |
\isabellestyle{it}
|
|
|
12 |
|
|
1493
|
13 |
\renewcommand{\isacharunderscore}{\mbox{$\_\!\_$}}
|
|
|
14 |
\renewcommand{\isasymbullet}{{\raisebox{-0.4mm}{\Large$\boldsymbol{\cdot}$}}}
|
|
|
15 |
\def\dn{\,\stackrel{\mbox{\scriptsize def}}{=}\,}
|
|
|
16 |
\renewcommand{\isasymequiv}{$\dn$}
|
|
|
17 |
\renewcommand{\isasymiota}{}
|
|
|
18 |
\renewcommand{\isasymemptyset}{$\varnothing$}
|
|
|
19 |
|
|
|
20 |
|
|
754
|
21 |
|
|
1328
|
22 |
%----------------- theorem definitions ----------
|
1517
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
23 |
\newtheorem{property}{Property}[section]
|
|
1328
|
24 |
\newtheorem{Theorem}{Theorem}[section]
|
|
|
25 |
\newtheorem{Definition}[Theorem]{Definition}
|
|
|
26 |
\newtheorem{Example}{\it Example}[section]
|
|
|
27 |
|
|
|
28 |
%-------------------- environment definitions -----------------
|
|
|
29 |
\newenvironment{example}[0]{\begin{Example} \it}{\end{Example}}
|
|
|
30 |
\newenvironment{proof-of}[1]{{\em Proof of #1:}}{}
|
|
754
|
31 |
|
|
1485
|
32 |
|
|
754
|
33 |
\begin{document}
|
|
|
34 |
|
|
1493
|
35 |
\title{\LARGE\bf General Binding Structures in Nominal Isabelle,\\ or How to
|
|
1328
|
36 |
Formalise Core-Haskell}
|
|
754
|
37 |
\maketitle
|
|
|
38 |
|
|
1328
|
39 |
\maketitle
|
|
|
40 |
\begin{abstract}
|
1517
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
41 |
Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem
|
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
42 |
prover. It provides a proving infrastructure for convenient reasoning about
|
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
43 |
programming language calculi. In this paper we present an extension of Nominal
|
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
44 |
Isabelle for dealing with general binding structures. Such binding structures are
|
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
45 |
ubiquitous in programming language research and only very poorly handled by
|
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
46 |
single binding from the lambda-calculus. We give in this
|
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
47 |
paper novel definitions for alpha-equivalence and establish automatically the
|
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
48 |
reasoning structure for alpha-equated terms. For example we provide a strong
|
62d6f7acc110
corrected the strong induction principle in the lambda-calculus case; gave a second (oartial) version that is more elegant
Christian Urban <urbanc@in.tum.de>
diff
changeset
|
49 |
induction principle that has the variable convention already built in.
|
|
1328
|
50 |
\end{abstract}
|
|
754
|
51 |
|
|
1493
|
52 |
|
|
754
|
53 |
\input{session}
|
|
|
54 |
|
|
1493
|
55 |
\bibliographystyle{plain}
|
|
|
56 |
\bibliography{root}
|
|
754
|
57 |
|
|
|
58 |
\end{document}
|
|
|
59 |
|
|
|
60 |
%%% Local Variables:
|
|
|
61 |
%%% mode: latex
|
|
|
62 |
%%% TeX-master: t
|
|
|
63 |
%%% End:
|