MST 2007
 |  |
Wall of Fame | Most Viewed MST-2007 Paper
MST
2007
13 years 4 months ago
2007
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website.
Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 168 | ||
| 2 | | 167 | ||
| 3 | | 154 | ||
| 4 | | 138 | ||
| 5 | | 132 | ||
| 6 | | 122 | ||
| 7 | | 121 | ||
| 8 | | 104 | ||
| 9 | | 97 | ||
| 10 | | 93 | ||
| 11 | | 91 | ||
| 12 | | 90 | ||
| 13 | | 89 | ||
| 14 | | 80 | ||
| 15 | | 79 |