Gotowa bibliografia na temat „Rust (langage de programmation)”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Rust (langage de programmation)”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Rust (langage de programmation)"
Mélès, Baptiste. "Les langages de Turing". Intellectica. Revue de l'Association pour la Recherche Cognitive 72, nr 1 (2020): 81–110. http://dx.doi.org/10.3406/intel.2020.1947.
Pełny tekst źródłaMandel, Louis, i Marc Pouzet. "ReactiveML, un langage fonctionnel pour la programmation réactive". Techniques et sciences informatiques 27, nr 8 (30.10.2008): 1097–128. http://dx.doi.org/10.3166/tsi.27.1097-1128.
Pełny tekst źródłaLaurent Bloch. "Un langage pour enseigner la programmation, Scheme ou Python ?" Bulletin 1024, nr 20 (listopad 2022): 85–95. http://dx.doi.org/10.48556/sif.1024.20.85.
Pełny tekst źródłaDenis Merigoux i Liane Huttner. "Catala : formaliser la loi grâce à un langage de programmation dédié". Bulletin 1024, nr 20 (listopad 2022): 77–84. http://dx.doi.org/10.48556/sif.1024.20.77.
Pełny tekst źródłaPhilippot, Alexandre, Stéphane Lecasse, Bernard Riera i François Gellot. "Développement d’un connecteur logiciel pour l’apprentissage de l’automatisme". J3eA 21 (2022): 2056. http://dx.doi.org/10.1051/j3ea/20222056.
Pełny tekst źródłaFrick, V., i B. Boyer. "Conception de système embarqué sur cible FPGA : une approche par compétences". J3eA 21 (2022): 1022. http://dx.doi.org/10.1051/j3ea/20221022.
Pełny tekst źródłaDelaval, Gwenaël, Eric Rutten i Hervé Marchand. "Intégration de la synthèse de contrôleurs discrets dans un langage de programmation". Journal Européen des Systèmes Automatisés 45, nr 1-3 (30.04.2011): 125–40. http://dx.doi.org/10.3166/jesa.45.125-140.
Pełny tekst źródłaForest, Françoise, i Maryse Siksou. "Développement de concepts et programmation du sens. Pensée et langage chez Vygotski". Intellectica. Revue de l'Association pour la Recherche Cognitive 18, nr 1 (1994): 213–36. http://dx.doi.org/10.3406/intel.1994.1456.
Pełny tekst źródłaKouki, Rahim, i Soumaya Derragi. "Interdisciplinarité et difficulté d’apprentissage des méthodes numériques en programmation". TANGRAM - Revista de Educação Matemática 6, nr 3 (30.09.2023): 2–22. http://dx.doi.org/10.30612/tangram.v6i3.16950.
Pełny tekst źródłaCaldarone, Alessandro. "Une méthodologie automatisée de la logique juridique". Les Cahiers de droit 31, nr 1 (12.04.2005): 227–60. http://dx.doi.org/10.7202/043006ar.
Pełny tekst źródłaRozprawy doktorskie na temat "Rust (langage de programmation)"
Denis, Xavier. "Deductive verification of Rust programs". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG101.
Pełny tekst źródłaRust is a programming language introduced in 2015, which provides the programmer with safety features regarding the use of memory. The goal of this thesis is the development of a deductive verification tool for the Rust language, by leveraging the specificities of its type system, in order to simplify memory aliasing management, among other things. Such a verification approach ensures the absence of errors during the execution of the considered programs, as well as their compliance with a formal specification of the expected functional behavior. The theoretical foundation of the approach proposed in this thesis is to use a notion of prophecy that interprets the mutable borrows in the Rust language as a current value and a future value of this borrow. The Coq proof assistant was used to formalize this prophetic encoding and prove the correctness of the associated proof obligation generation. Furthermore, the approach has been implemented in a verification software for Rust that automates the generation of proof obligations and relies on external solvers to validate these obligations. In order to support Rust iterators, an extension has been developed to manipulate closures, as well as a verification technique for iterators and combinators. The implementation has been experimentally evaluated on relevant algorithm and data structure examples. It has also been validated through a significant case study: the verification of a satisfiability modulo theories (SMT) solver
Rammal, Darine. "Memory safety for synchronous reactive programming". Electronic Thesis or Diss., Orléans, 2024. http://www.theses.fr/2024ORLE1002.
Pełny tekst źródłaSynchronous Reactive Languages are an excellent choice for IoT programming due to their clear system-environment interaction semantics. However, when it comes to safety- critial or resource-constrained systems, recent proposals like Fairthreads or ReactiveML face a well-known issue. Fairthreads' manual memory management can lead to errors, while ReactiveML's garbage collection ensures memory safety but introduces execution overhead. This thesis aims to address the memory safety issue by developing a reactive programming language specifically designed for real-time systems, incorporating cooperative threads and synchronous execution. Drawing from the robust type system of the Rust programming language, we propose a Rust-like type system for a kernel reactive programming language named MSSL. MSSL features a cooperative threading model and facilitates mutable data sharing between threads while preserving type and borrowing safety. To achieve this, we introduce a novel abstraction called Trc (Thread Reference Counting), which combines the ownership safety of Rust references with the reference counting mechanism of Rust smart pointers. Then, we present the semantics and type system of MSSL to demonstrate its capabilities in maintaining type safety, borrowing safety, and concurrency safety. Furthermore, we extend MSSL by introducing reactive extensions, incorporating the concept of signals that offer powerful, flexible, and reliable means of communication. Finally, we provide a Java implementation of the complete MSSL set, based on the semantic and typing rules of its type system
Алексахіна, Тетяна Олексіївна, Татьяна Алексеевна Алексахина, Tetiana Oleksiivna Aleksakhina i A. Krivodub. "La langage de programmation". Thesis, Вид-во СумДУ, 2009. http://essuir.sumdu.edu.ua/handle/123456789/16780.
Pełny tekst źródłaCisneros, Gascon Maria del Pilar Jorrand Philippe. "Programmation parallèle et programmation fonctionnelle propositions pour un langage /". S.l. : Université Grenoble 1, 2008. http://tel.archives-ouvertes.fr/tel-00311709.
Pełny tekst źródłaMoal, Frédéric. "Langage de biais en apprentissage symbolique". Orléans, 2000. http://www.theses.fr/2000ORLE2051.
Pełny tekst źródłaFaucher, Colette. "Elaboration d'un langage extensible fondé sur les schémas : le langage Objlog+". Aix-Marseille 3, 1991. http://www.theses.fr/1991AIX30039.
Pełny tekst źródłaChauveau, Dominique. "Étude d'une extension du langage synchrone SIGNAL aux modèles probabilistes : le langage SIGNalea". Rennes 1, 1996. http://www.theses.fr/1996REN10110.
Pełny tekst źródłaDekoker, Sylvain. "Alma : un langage de programmation d'agents cognitifs". Paris 6, 2012. http://www.theses.fr/2012PA066076.
Pełny tekst źródłaThis thesis is about cognitive agents programming. We think this paradigm is an answer to the issues raised in designing, implementing and maintaining complex software systems. Concepts used in multi-agents systems are close to our natural way of thinking. This leads us to some new kind of solutions which are more declarative, adaptable and robust. We believe this paradigm will reach its true value only with the help of dedicated programming languages. This is the underlying goal of this thesis. Cognitive agents need to have a reasoning based on incomplete information. They also need to be able to manage contradictions, and to anticipate the possible actions from this situation. We have designed a solution based on hypothetical reasoning. We will show the consequences of this choice on the components of the agent architecture. The first consequence is the integration of an assumption based belief revision process. Then, we will show how plans are programmed, managed and how a consistent behavior is restored when beliefs have changed. And lastly we will show how we integrate an automated planning mechanism relying on a dynamic belief base. The contribution of this thesis is this agent programming language ALMA that has all those features
Jaber, Ghaleb. "Le langage pascal/relationnel : un langage de programmation de bases de donnees". Toulouse 3, 1987. http://www.theses.fr/1987TOU30222.
Pełny tekst źródłaJaber, Ghaleb. "Le Langage PASCAL/relationnel un langage de programmation de bases de données /". Grenoble 2 : ANRT, 1987. http://catalogue.bnf.fr/ark:/12148/cb37606132q.
Pełny tekst źródłaKsiążki na temat "Rust (langage de programmation)"
Myx, André. LOGO: Votre langage de programmation. Paris: Cedic, 1985.
Znajdź pełny tekst źródłaWeis, Pierre. Le Langage Caml. Wyd. 3. Paris: InterEditions, 1993.
Znajdź pełny tekst źródłaDax, Philippe. Langage C. Wyd. 6. Paris: Eyrolles, 1990.
Znajdź pełny tekst źródłaCédric, Nicolas, red. Programmation JAVA. Paris: Eyrolles, 1996.
Znajdź pełny tekst źródłaKernighan, Brian W. Le langage C. Wyd. 2. Paris: Masson, 1990.
Znajdź pełny tekst źródłaFieux, Loïc. Le langage C. Paris: CampusPress, 2001.
Znajdź pełny tekst źródłaLortie, Claude. Langage d'assemblage. Montréal, Qué: Guérin, 1989.
Znajdź pełny tekst źródłaNiedermair, Elke. Java 2: Programmation. Paris: Micro Application, 2000.
Znajdź pełny tekst źródłaLe langage C ++. Paris: Micro application, 1997.
Znajdź pełny tekst źródłaco-auteur, Rannou Robert, red. Langage Ada et algorithmique. Paris: Hermès, 1990.
Znajdź pełny tekst źródła