Commit c562c3e3 authored by wenzelm's avatar wenzelm
Browse files

more antiquotations;

parent d41788337158
......@@ -26,7 +26,7 @@ test-cases, which we adress in the future).
In order to enter Isabelle/\Circus specifications, an own parser has
been developed (the the interested reader is referred to:
\url{}). In the
@{url ""}). In the
following, we will present our example both in high-level syntax
implementing common textbook notation on \Circus\ as well as the
semantic code resulting from these expressions in the context of
......@@ -21,7 +21,7 @@ begin
Isabelle/HOLs code generator to generate ML-code.
The implementation uses the Isabelle Collection Framework (ICF)
(Available at \url{}),
(Available at @{url ""}),
to provide efficient set implementations. We choose a hashset
(backed by a Red Black Tree) for the visited set, and lists for
all other sets. Moreover, we fix the node type to natural numbers.
......@@ -404,7 +404,7 @@ text_raw {*\label{}*}
For a more detailed discussion of the data refinement issue, we refer to
the monadic refinement framework, that is available in the AFP
(@{url ""})
subsection {* Operation Records *}
......@@ -144,7 +144,7 @@ section {* GHC Version of Mergesort *}
text {*
In the following we show that the mergesort implementation
used in GHC (see \url{})
used in GHC (see @{url ""})
is a correct and stable sorting algorithm. Furthermore, experimental
data suggests that generated code for this implementation is much more
efficient than for the implementation provided by @{theory Multiset}.
......@@ -36,7 +36,7 @@ text {*
The submission of the example you are reading is at
@{url ""}.
section "Proof styles"
......@@ -27,13 +27,13 @@ section {* Introduction *}
Isabelle is described in the textbook by Nipkow,
Paulson, and Wenzel \cite{Isabelle} and in tutorials available
at: \url{}.
at: @{url ""}.
\subsection{Related Work}
The formalization presented here is related to the THF \cite{J22} and
Coq \cite{Coq} formalizations at
@{url ""}.
An older ontological argument by Anselm was formalized in PVS by John Rushby \cite{rushby}.
......@@ -6,7 +6,7 @@ begin
section {*Generalised Addition --- Also for Ordinals *}
text{*Source: Laurence Kirby, Addition and multiplication of sets
Math. Log. Quart. 53, No. 1, 52 – 65 (2007) / DOI 10.1002/malq.200610026*}
@{url ""}*}
hadd :: "hf \<Rightarrow> hf \<Rightarrow> hf" (infixl "@+" 65) where
......@@ -131,9 +131,9 @@ text {*
because the interrupt flag is not stored inside the thread object.
Starting a clone of a started thread with Sun JVM 1.6.0\_07 raises an illegal thread state exception,
we just start another thread.
The thread at \texttt{} discusses
The thread at @{url ""} discusses
the general problem of thread cloning and argues against that.
The bug report \texttt{\\_id=6968584}
The bug report @{url ""}
changes the Thread class implementation
such that \texttt{Object.clone()} can no longer be accessed for Thread and subclasses in Java 7.
......@@ -6,7 +6,7 @@ begin
text {*
This is a slightly modified version of Task~5 of our submission to
the VSTTE 2011 verification competition
(\url{}). The task was to
(@{url ""}). The task was to
formalize a breadth-first-search algorithm.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment