TypeScript | EPFL Graph Search

Êtes-vous un étudiant de l'EPFL à la recherche d'un projet de semestre?

Travaillez avec nous sur des projets en science des données et en visualisation, et déployez votre projet sous forme d'application sur GraphSearch.

Découvrez-en plus sur les applications Graph.

TypeScript est un langage de programmation libre et open source développé par Microsoft qui a pour but d'améliorer et de sécuriser la production de code JavaScript. Il s'agit d'un sur-ensemble syntaxique strict de JavaScript (c'est-à-dire que tout code JavaScript correct peut être utilisé avec TypeScript). Le code TypeScript est transcompilé en JavaScript, et peut ainsi être interprété par n'importe quel navigateur web ou moteur JavaScript. TypeScript a été cocréé par Anders Hejlsberg, principal inventeur de C# . TypeScript permet un typage statique optionnel des variables et des fonctions, la création de classes et d'interfaces, l'import de modules, tout en conservant l'approche non-contraignante de JavaScript. Il supporte la spécification ECMAScript 6. TypeScript prend en charge les fichiers de définition qui peuvent contenir des informations sur le type des bibliothèques JavaScript existantes, tout comme les fichiers d'en-tête C++ peuvent décrire la structure des fichiers objets e

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (3)

Publications associées

Chargement

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés (36)

Concepts associés

Chargement

Cours associés (2)

Cours associés

Chargement

Séances de cours associées (2)

Séances de cours associées

Chargement

Dispatching rule-based scheduling algorithms in a single machine with sequence-dependent setup times and energy requirements

Yong Chan Choi

The research focuses on the problem of scheduling jobs in a single machine with sequence-dependent setup times and energy requirements in which jobs of multiple types arrive dynamically over time. A setup operation is required to change over the job types and it strongly depends on the sequence of the job types. During the setup operations, the machine tool is on idle state which means to consume an idle energy for non-machining on the machine tool. Moreover, frequent set-ups and long setup times negatively impact on the completion of the jobs as well as the idle energy consumption for the machine tool. Each job type has alternative process plans with different electricity machining energy requirements. The machining energy consumption which is incurred on the machine tool is defined from the perspective of the process plan. To cope with the dynamic nature of the scheduling problem, two energy efficient dispatching rule based algorithms are considered on the real time shop information with the objective of minimizing average energy consumption (with machining and non-machining) and mean tardiness of the finished jobs. The benefit coming from the adoption of suggested model has been addressed with reference to a real industrial use case study analyzed on the existing research. (C) 2015 The Authors. Published by Elsevier B.V.

Elsevier Science Bv2016

Chargement

Dispatching rule-based algorithms for a dynamic flexible flow shop scheduling problem with time-dependent process defect rate and quality feedback

Yong Chan Choi, Byung Jun Joo, Paul Xirouchakis

We consider a three-stage dynamic flexible flow shop scheduling problem in which jobs of multiple types arrive dynamically over time, a quality feedback mechanism is present, and the setup timing and the process defect rate are closely related. At each machine in the second stage, a sequence-independent setup operation is necessary to changeover job types. Once a setup is done for a job type at a machine, the defect rate for the job type at the machine is reset to a low and stable phase which will be maintained for a predetermined time periods. However, after the phase, it turns to a relatively high and unstable phase. At the final inspection stage, jobs are inspected and the quality feedback will be given to the previous stage when the accumulative defect rate of each job type exceeds a certain tolerance level. To cope with the dynamic nature of the flexible flow shop scheduling problem, we propose two dispatching rule-based scheduling algorithms which consider the quality feedback as well as the real time shop information for the objectives of maximizing the quality rate and the mean tardiness of the finished jobs. The results of a series of simulation experiments will be given to evaluate the performance of the suggested algorithms. Since there have been few research on the shop floor scheduling problems with quality feedback, we expect that this research will make a contribution to the development of a practical real time scheduling methodology in multi-stage production systems with the consideration of the imperfect process quality.

Elsevier Science Bv2013

Chargement

Semantics-Driven Interoperability between Scala.js and JavaScript

Sébastien Jean R Doeraene, Tobias Schlatter, Nicolas Alexander Stucki

Hundreds of programming languages compile to JavaScript. Yet, most of them fail, at one level or another, to provide satisfactory interoperability with JavaScript APIs. This is limiting, as interoperability is at least required to manipulate web pages through the DOM API, but also to use the ecosystem of existing JavaScript libraries. This paper presents the interoperability features of Scala.js, which solves the shortcomings of previous approaches. Scala. js offers a separate hierarchy of JavaScript types, whose operations have semantics borrowed from ECMAScript 2015. The interoperability features are complete with respect to ECMAScript 2015, save for two exceptions which are still being worked on. This allows Scala. js programs to perform any operation that an ECMAScript program could do, thereby guaranteeing that they can talk to any JavaScript library.

Association for Computing Machinery2016

Chargement

Rust (langage)

Rust est un langage de programmation compilé multi-paradigme conçu et développé par Mozilla Research depuis 2010. Il a été conçu pour être « un langage fiable, concurrent, pratique », supportant les s

JavaScript

JavaScript est un langage de programmation de scripts principalement employé dans les pages web interactives et à ce titre est une partie essentielle des applications web. Avec les langages HTML et CS

Scala (langage)

Scala est un langage de programmation multi-paradigme conçu à l'École polytechnique fédérale de Lausanne (EPFL) pour exprimer les modèles de programmation courants dans une forme concise et élégante.

CS-320: Computer language processing

We teach the fundamental aspects of analyzing and interpreting computer languages, including the techniques to build compilers. You will build a working compiler from an elegant functional language into the new web standard for portable binaries called WebAssembly ( https://webassembly.org/ )

CS-452: Foundations of software

The course introduces the foundations on which programs and programming languages are built. It introduces syntax, types and semantics as building blocks that together define the properties of a program part or a language. Students will learn how to apply these concepts in their reasoning.