Beyond mere logic a vision of modeling languages for the 21st century
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Traditional computer languages are all ultimately based on mathematical logic, which, after all, is the foundation of practically all of modern mathematics. This is a natural outcome of the initial algorithmically-oriented applications of electronic computing machines and is even revealed in how we've chosen to name these devices (i.e., computers). One obvious aspect of this is reflected in the fact that values in programs are typically represented by data types, such as integers, reals, or strings, which are quite intentionally shorn of any connotations. Consequently, in cases where such data is intended to represent relevant quantities, such as length or communication bandwidth, the association with the corresponding dimensions is typically informal, through convention. This has led to some catastrophic and expensive failures, such as the case of the unfortunate Mars Lander spacecraft, which was attributed to an undetected mismatch between metric and imperial systems measures. The informal nature of the association between values expressed in programs and their corresponding dimensions can also greatly complicate proper verification of such software. Whereas a great deal of effort has been expended in evolving various type theories for computer languages in order to avoid mismatches between pure data types, very little has been done to help us with problems with physical data types. In the past, this was perceived as a concern primarily for the relatively specialized field of real-time computing. However, as more and more software involves interactions with the world, this deficiency is becoming more obvious, more pervasisve, and more critical. Thus, with the growth of the Internet, many modern software systems are physically distributed and, consequently, highly sensitive to phenomena, such as communication delays, equipment failures, out-of-sequence events, and the like. In other words, more and more software is becoming real-time. In this talk, we focus on the issues involved in the somewhat contradictory relationship between the orderly logical world of traditional software and the complex and sometimes unpredictable world with which it interacts. Specifically, we look at how computer languages should be constructed to deal more effectively with this complex combination.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,001 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle