summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/doc/latex/nwejm/examples/article-in-french.tex
diff options
context:
space:
mode:
Diffstat (limited to 'Master/texmf-dist/doc/latex/nwejm/examples/article-in-french.tex')
-rw-r--r--Master/texmf-dist/doc/latex/nwejm/examples/article-in-french.tex129
1 files changed, 129 insertions, 0 deletions
diff --git a/Master/texmf-dist/doc/latex/nwejm/examples/article-in-french.tex b/Master/texmf-dist/doc/latex/nwejm/examples/article-in-french.tex
new file mode 100644
index 00000000000..c19d89a0feb
--- /dev/null
+++ b/Master/texmf-dist/doc/latex/nwejm/examples/article-in-french.tex
@@ -0,0 +1,129 @@
+\documentclass[french]{nwejmart}
+\usepackage{lipsum} % Devrait ne pas être utilisé dans un vrai article!
+\addbibresource{sample.bib} % Exemple de fichier bibliographique simple
+\addbibresource{biblatex-examples.bib} % Exemple de fichier bibliographique sophistiqué
+%
+\newacronym{nwejm-french}{nwejm}{North-Western European Journal of Mathematics}
+%
+\begin{document}
+\nocite{*} % Should not be used in a real article!
+%
+\title{Titre de l'article (french)}
+\author[affiliation={Affiliation 1}]{Last1, First1}
+\author[affiliation=[aff2]{Affiliation 2}]{Last2, First2}
+\author[affiliation={Affiliation 3},affiliation={Affiliation 3 bis}]{Last3, First3}
+\author[affiliation={Affiliation 4},affiliationtagged={aff2}]{Last4, First4}
+%
+\begin{abstract}
+ \lipsum[1]
+\end{abstract}
+%
+\keywords{foo,bar,baz}
+%
+\msc{11B13,11B30,11P70}
+%
+\acknowledgments{Thanks to mum, daddy and all my buddies.}
+%
+\maketitle
+%
+\section*{Recommendations for \LaTeX}
+Don't use:
+\begin{itemize}
+\item \verb+$$...$$+ but \verb+\[...\]+ or \verb+\begin{equation}...\end{equation}+
+\item \verb+$a \over b$+ but \verb+$\frac{a}{b}$+
+\item \verb+{\cal ...}+ but \verb+\mathcal{...}+
+\item \verb+{\bf ...}+ but \verb+\textbf{...}+
+\item \verb+{\it ...}+ but \verb+\emph{...}+
+\item \verb+\'e+ for instance to get an accent but type it directly (\verb+é+)
+ using the UTF8 encoding.
+\end{itemize}
+More generally, it is worth having a look at documents that highlight obsolete
+commands and
+packages\autocite{ensenbach2016,ensenbach2011,trettin2007,ensenbach2011a,trettin2007a}.
+%
+\section*{Introduction}
+%
+\subsection{Citations tests}
+\begin{enumerate}
+ \item It\footnote{Foo bar.} is well known\autocite{baez/article}
+ that... Moreover, it is well known\autocite{companion} that...
+ \item \textcite{baez/article} have proved... Moreover, \textcite{companion}
+ have proved...
+\end{enumerate}
+%
+\subsection{Cross-references tests}
+Cf. \vref{thm-bolzano-weierstrass-\languagename,rmk-euler-\languagename} \&
+\vref{eq-euler-\languagename} \& \vref{sec-first-numbered-\languagename}.
+%
+\subsection{Miscellaneaous}
+\begin{itemize}
+\item It has been proved in the \century{19} \aside{more than 100 years ago}
+ that...
+\item This has been conceptualized in the \century{-3} \aside*{more than 2000
+ years ago}.
+\item \acrshort{nwejm-\languagename} \ie{} \acrlong*{nwejm-\languagename}.
+\item \acrshort{nwejm-\languagename} \ie*{} \acrlong*{nwejm-\languagename}.
+\end{itemize}
+%
+\subsection{Acronyms tests}
+\begin{enumerate}
+\item The present article is published in the \gls{nwejm-\languagename}.
+\item Moreover, the present article is published in the \gls{nwejm-\languagename}.
+\end{enumerate}
+%
+\subsection{Theorems tests}
+\begin{theorem}[Bolzano–Weierstrass]\label{thm-bolzano-weierstrass-\languagename}
+ A subset of $\bbR^n$ ($n\in\bbN^*$) is sequentially compact if and only if it is
+ closed and bounded.
+\end{theorem}
+\begin{proof}[not that easy!]
+ ...
+\end{proof}
+\begin{definition}
+ In Cartesian space $\bbR^n$ with the $p$-norm $L_p$, an open ball is the set
+ \[
+ B(r)=\set{x\in \bbR^n}[\sum _{i=1}^n\left|x_i\right|^p<r^p]
+ \]
+\end{definition}
+\begin{remark}[Euler's identity]\label{rmk-euler-\languagename}
+ One of the most beautiful mathematical equation:
+ \begin{equation}
+ \E[\I\pi]+1=0
+ \end{equation}
+\end{remark}
+\begin{lemma*}[Zorn]
+ Suppose a partially ordered set $P$ has the property that every chain has an
+ upper bound in $P$. Then the set $P$ contains at least one maximal element.
+\end{lemma*}
+\begin{axiom}\label{my-axiom-\languagename}
+ The following assertions are considered as true.
+ \begin{assertions}
+ \item\label{rare-expensive-\languagename} Anything that is scarce also is
+ expensive.
+ \item\label{cheap-horse-\languagename} A cheap horse is scarce.
+ \end{assertions}
+\end{axiom}
+According to \vref{rare-expensive-\languagename,cheap-horse-\languagename}
+from \vref{my-axiom-\languagename}, a cheap horse is expensive.
+%
+\subsection{Dummy text and nice equation}
+%
+\lipsum[2-6]
+%
+\begin{equation}\label{eq-euler-\languagename}
+ \E[\I\pi]+1=0
+\end{equation}
+%
+\lipsum[8-15]
+%
+\section{First (numbered) section}\label{sec-first-numbered-\languagename}
+\lipsum[2]
+\subsection{First subsection}
+\lipsum[3-8]
+\subsection{Second subsection}
+\lipsum[9-15]
+\section{Second (numbered) section}
+\lipsum[16-38]
+\printbibliography
+%
+\end{document}