Différences
Ci-dessous, les différences entre deux révisions de la page.
| Les deux révisions précédentes Révision précédente | Prochaine révision Les deux révisions suivantes | ||
|
fr:research:fi-while [2018/02/16 01:25] 127.0.0.1 modification externe |
fr:research:fi-while [2018/03/29 15:44] apeiron |
||
|---|---|---|---|
| Ligne 1: | Ligne 1: | ||
| - | FIXME **Cette page n'est pas encore traduite entièrement.** | + | **Algorithmic Completeness of Imperative Programming Languages** (Yoann Marquer) est un article directement issu de [[fr:research:thesis-defense|mes travaux de thèse]], et qui a été accepté par Fundamenta Informaticae en 2016. |
| - | + | ||
| - | ====== Title ====== | + | |
| - | + | ||
| - | Algorithmic Completeness of Imperative Programming Languages | + | |
| ====== Abstract ====== | ====== Abstract ====== | ||
| Ligne 15: | Ligne 11: | ||
| **Keywords**: Algorithm, ASM, Completeness, Computability, Imperative, Simulation. | **Keywords**: Algorithm, ASM, Completeness, Computability, Imperative, Simulation. | ||
| - | ====== Links ====== | + | ====== Versions ====== |
| The {{:fr:research:fi-while-short.pdf|short version}} of the paper had been submitted to [[http://fi.mimuw.edu.pl/index.php/FI|Fundamenta Informaticae]]. | The {{:fr:research:fi-while-short.pdf|short version}} of the paper had been submitted to [[http://fi.mimuw.edu.pl/index.php/FI|Fundamenta Informaticae]]. | ||
| The {{:fr:recherche:fi-while-long.pdf|long version}} is an older version, with very poor english and presentation, but contains proofs omitted in the short version. | The {{:fr:recherche:fi-while-long.pdf|long version}} is an older version, with very poor english and presentation, but contains proofs omitted in the short version. | ||