Révision 190 CSL17/DICE2017_TALK/unboundedArithmetic.tex

unboundedArithmetic.tex (revision 190)
211 211
%%%%%%%%%%%%%%%%%%%%%%%%%%%
212 212

  
213 213
\begin{frame}
214
  \frametitle{Ramification}
215
 
216
 \begin{itemize}
217
\item   ramification, a.k.a. tiering, safe recursion
218
\item distinguish two levels of data-types:
219

  
220
${\red{N_1}}$ (\textit{normal}) integers can trigger induction/recursion
221

  
222
${{N_0}}$ (\textit{safe})  integers cannot; they can just be finitely explored
223
\item ramified recursion scheme:
224
$$ f({\red{\succ{i} u, \vec v}}{\textbf ;} \vec x)=F_i ({\red{u,\vec v}}{\textbf ; }f(u, \vec v;\vec x), \vec x)$$
225
\item function algebra for FP: Bellantoni-Cook 92, Leivant 93
226

  
227
          logic for FP: Leivant 95, Cantini 00 
228
\end{itemize}
229
 \end{frame}
230

  
231
%%%%%%%%%%%%%%%%%%%%%%%%%%%
232
\begin{frame}
214 233
  \frametitle{Ingredients for a logical characterization}
215 234
 
216 235
 \begin{itemize}

Formats disponibles : Unified diff