Concept

Réécriture (informatique)

En informatique théorique, la réécriture (ou récriture) est un modèle de calcul dans lequel il s’agit de transformer des objets syntaxiques (mots, termes, lambda-termes, programmes, preuves, graphes, etc.) en appliquant des règles bien précises. La réécriture est utilisée en informatique, en algèbre, en logique mathématique et en linguistique. La réécriture est utilisée en pratique pour la gestion des courriers électroniques (dans le logiciel sendmail, les entêtes de courrier sont manipulées par des systèmes de réécriture) ou la génération et l'optimisation de code dans les compilateurs. Voici quelques exemples classiques d’utilisation de la réécriture : simplifier une expression algébrique (calcul formel) ; x+1+x+1 → x+x+1+1 → 2x+ 1+1→ 2x+ 2 une grammaire formelle d’un langage de programmation ou d’une langue naturelle est un système de réécriture ; PHRASE → SUJET VERBE → DETERMINANT NOM VERBE → Le NOM VERBE → Le chat VERBE → Le chat dort exprimer la sémantique d’un langage de programmation (sémantique opérationnelle) ; étudier la structure d’un groupe ou d’un monoïde (combinatoire algébrique) ; en théorie des automates, l'exécution d'un automate (automate fini, automate à pile, machine de Turing) sur un mot d'entrée peut être vue comme une réécriture. Par exemple, Alexander Meduna présente les automates comme des systèmes de réécriture ; expliciter le contenu calculatoire d’une démonstration mathématique par le mécanisme d’élimination des coupures (théorie de la démonstration) ; en théorie des nœuds, les mouvements de Reidemeister sont des règles de réécriture pour dénouer un nœud. en logique propositionnelle classique, une formule est une tautologie si elle peut se réécrire en le terme 1 avec des règles de réécriture qui exploitent l'équivalence entre algèbre booléennes et anneaux où x2 = x. en biologie, les systèmes de Lindenmayer modélisent l'évolution de plantes, de bactéries, etc. pour expliquer la théorie des fonctions avec le minimum de concepts, c'est la logique combinatoire.

Source officielle

https://fr.wikipedia.org/wiki/Réécriture_(informatique)

À 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.

Cours associés (25)

ME-411: Mechanics of slender structures

Analysis of the mechanical response and deformation of slender structural elements. ...

CS-214: Software construction

Learn how to design and implement reliable, maintainable, and efficient software using a mix of programming skills (declarative style, higher-order functions, inductive types, parallelism) and fundamental software construction concepts (reusability, abstr ...

EE-556: Mathematics of data: from theory to computation

This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees

Afficher plus

Séances de cours associées (32)

Analyse de terminaison à l'aide de paires de dépendances

Explore l'analyse automatisée de terminaison à l'aide de paires de dépendances, couvrant les techniques classiques et modernes, les concours annuels et des outils comme AProVE.

Définitions de la valeur et conditions

Couvre les expressions conditionnelles et booléennes, les règles de réécriture et les définitions de valeurs.

Fonctions et état

Explore les fonctions, l'état, la réécriture et les objets stateful dans la programmation.

Afficher plus

Publications associées (5)

Dynamic indoor thermal environment control using Reinforcement Learning: Balancing energy efficiency and human well-being

Buildings are complex dynamic systems, and traditional HVAC (Heating Ventilation and AirConditioning) control methods, which rely on rule-based algorithms, often struggle to adapt, resulting in inefficiencies and suboptimal indoor conditions. Maintaining and updating these rule-based systems is challenging, as evolving environments require frequent modifications, increasing complexity, and the risk of inconsistencies. Reinforcement Learning (RL) can effectively optimize complex systems like building energy

Elsevier BV2026

When can transformers reason with abstract symbols?

We investigate the capabilities of transformer models on relational reasoning tasks. In these tasks, models are trained on a set of strings encoding abstract relations, and are then tested out-of-distribution on data that contains symbols that did not appear in the training dataset. We prove that for any relational reasoning task in a large family of tasks, transformers learn the abstract relations and generalize to the test set when trained by gradient descent on sufficiently large quantities of training d

International Conference on Learning Representations, ICLR2024

Deep Bayesian Trust : A Dominant and Fair Incentive Mechanism for Crowd

An important class of game-theoretic incentive mechanisms for eliciting effort from a crowd are the peer based mechanisms, in which workers are paid by matching their answers with one another. The other classic mechanism is to have the workers solve some g ...

AAAI2019

Afficher plus

Graph Chat

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Source officielle

https://fr.wikipedia.org/wiki/Réécriture_(informatique)

À propos de ce résultat

Cours associés (25)

ME-411: Mechanics of slender structures

Analysis of the mechanical response and deformation of slender structural elements. ...

CS-214: Software construction

EE-556: Mathematics of data: from theory to computation

Afficher plus

Séances de cours associées (32)

Analyse de terminaison à l'aide de paires de dépendances

Explore l'analyse automatisée de terminaison à l'aide de paires de dépendances, couvrant les techniques classiques et modernes, les concours annuels et des outils comme AProVE.

Définitions de la valeur et conditions

Couvre les expressions conditionnelles et booléennes, les règles de réécriture et les définitions de valeurs.

Fonctions et état

Explore les fonctions, l'état, la réécriture et les objets stateful dans la programmation.

Afficher plus

Publications associées (5)

Dynamic indoor thermal environment control using Reinforcement Learning: Balancing energy efficiency and human well-being

Elsevier BV2026

When can transformers reason with abstract symbols?

International Conference on Learning Representations, ICLR2024

Deep Bayesian Trust : A Dominant and Fair Incentive Mechanism for Crowd

AAAI2019

Afficher plus

Personnes associées (9)

Simon Guilloud

Expertise I am a PhD student at EPFL working in the Laboratory of Automated Reasoning and Analysis with Prof. Viktor KunÄak.My main domains of research are proof assistants and algorithms for logic-related problems. Expertise I am a PhD student at EPFL working in the Laboratory of Automated Reasoning and Analysis with Prof. Viktor KunÄak.My main domains of research are proof assistants and algorithms for logic-related problems.

Dimitri Racordon

Expertise Programming language design, type systems, memory safety I got my Ph.D. in computer science at the University of Geneva, Switzerland. I worked on model checking and developed efficient data structures to generate and explore large state spaces. SI then studied logics and type systems while trying to find new ways to teach computer science.I have always loved coding, but quickly realized I'm not so good at writing correct programs. So I thought I'd better write clever compilers to do it for me. Eve

Viktor Kuncak

Viktor Kunčak joined EPFL in 2007, after receiving a PhD degree from MIT. Since then has been leading the Laboratory for Automated Reasoning and Analysis and supervised at least 12 completed PhD theses. His works on languages, algorithms and systems for verification and automated reasoning. He served as an initiator and one of the coordinators of a European network (COST action) in the area of automated reasoning, verification, and synthesis. In 2012 he received a 5-year single-investigator European Research Council (ERC) grant of 1.5M EUR. His invited talks include those at Lambda Days, Scala Days, NFM, LOPSTR, SYNT, ICALP, CSL, RV, VMCAI, and SMT. A paper on test generation he co-authored received an ACM SIGSOFT distinguished paper award at ICSE. A PLDI paper he co-authored was published in the Communications of the ACM as a Research Highlight article. His Google Scholar profile reports an over-approximate H-index of 38. He was an associate editor of ACM Transactions on Programming Languages and Systems (TOPLAS) and served as a co-chair of conferences on Computer-Aided Verification (CAV), Formal Methods in Computer Aided Design (FMCAD), Workshop on Synthesis (SYNT), and Verification, Model Checking, and Abstract Interpretation (VMCAI). At EPFL he teaches courses on functional and parallel programming, compilers, and verification. He has co-taught the MOOC "Parallel Programming" that was visited by over 100'000 learners and completed by thousands of students from all over the world.

Ayatallah Ahmed Gamal Kamal Elakhras

Expertise Dataflow ArchitectureHigh-Level Synthesis Ayatallah is a Ph.D. student in the Processor Architecture Laboratory, advised by Professor Paolo Ienne. Between October 2023 and March 2024, she did an internship at AMD in the Research and Advanced Development team, under the supervision of Dr. Kristof Denolf. She received a B.Sc. degree in Computer Engineering from the American University in Cairo, Egypt in 2020 and started her Ph.D. in the same year.Her research interests include dataflow architecture,

Paolo Ienne

Paolo Ienne has been a Professor at the EPFL since 2000 and heads the Processor Architecture Laboratory (LAP). Prior to that, he worked for the Semiconductors Group of Siemens AG, Munich, Germany (which later became Infineon Technologies AG) where he was at the head of the Embedded Memories unit in the Design Libraries division. His research interests include various aspects of computer and processor architecture, FPGAs and reconfigurable computing, electronic design automation, and computer arithmetic. Ienne was a recipient of Best Paper Awards at the 20th, 24th, and 28th ACM/SIGDA International Symposia on Field-Programmable Gate Arrays (FPGA), in 2012, 2016 and 2020, at the 19th and 30th International Conference on Field-Programmable Logic and Applications (FPL), in 2009 and 2020, at the International Conference on Compilers, Architectures, and Synthesis for Embedded Systems (CASES), in 2007, and at the 40th Design Automation Conference (DAC), in 2003; many other papers have been candidates to Best Paper Awards in prestigious venues. He has served as general, programme, and topic chair of renown international conferences, including organizing in Lausanne the 26th International Conference on Field-Programmable Logic and Applications (FPL) in 2016. He serves on the steering committee of the IEEE Symposium on Computer Arithmetic (ARITH) and of the International Conference on Field-Programmable Logic and Applications (FPL). Ienne has guest edited a number of special issues and special sections on various topics for IEEE and ACM journals. He is regularly member of program committees of international workshops and conferences in the areas of design automation, computer architecture, embedded systems, compilers, FPGAs, and asynchronous design. He has been an associate editor of ACM Transactions on Architecture and Code Optimization (TACO), since 2015, of ACM Computing Surveys (CSUR), since 2014, and of ACM Transactions on Design Automation of Electronic Systems (TODAES) from 2011 to 2016.

Christoph Koch

Enseignement et PhD Doctorant·es actuel·les Léonard Léchot, Zhekai Jiang, Hanbit Lee A dirigé les thèses EPFL de Immanuel Trummer, Aleksandar Vitorovic, Milos Nikolic, Daniel Lupei, Mohammed El Seidy, Ioannis Klonatos, Mohammad Dashti Rahmat Abadi, Amir Shaikhha, Lionel Parreaux, Sachin Basil John, Zilu Tian A co-dirigé les thèses EPFL de David Kozhaya Cours Making intelligent things A CS-358(a) Le cours vise à enseigner le prototypage d'artefacts physiques intelligents et à résoudre des d

Luca Di Bartolomeo

Giovanni De Micheli

Expertise Technologies de conception pour les systèmes intégrés, tels que la synthèse, le codesign de HW/SW et la conception de basse puissance. Technologies de conception des systèmes sur les plateformes hétérogènes comprenant les composants électriques, et biologiques. En savoir plus Consulter svp http://si2.epfl.ch/~demichel/ Enseignement et PhD A dirigé les thèses EPFL de Abhishek Garg, Mohamed Haykel Ben Jamaa, Francesco Zanini, Ciprian Seiculescu, Cristina Boero, Hu Xu, Andrea Cavallini, Shashi Kanth

Martin Odersky

Enseignement et PhD Doctorant·es actuel·les Matthieu Bovel, Yaoyu Zhao, Anna Herlihy, Nguyên Cao Pham, Yichen Xu A dirigé les thèses EPFL de Julie Vachon, Matthias Zenger, Michel Schinz, Philippe Altherr, Vincent Cremet, Burak Emir, Stéphane Micheloud, Iulian Dragos, Philipp Haller, Gilles Dubochet, Tiark Rompf, Ingo Maier, Lukas Rytz, Aleksandar Prokopec, Heather Miller, Vlad Ureche, Nada Amin, Manohar Jonnalagedda, Hubert Plociniczak, Vojin Jovanovic, Sandro Stucki, Eugene Burmako, Dmytro Petrashko, Séb

Concepts associés (12)

Grammaire formelle

Une grammaire formelle est un formalisme permettant de définir une syntaxe et donc un langage formel, c'est-à-dire un ensemble de mots admissibles sur un alphabet donné. La notion de grammaire formelle est particulièrement utilisée en programmation logique, compilation (analyse syntaxique), en théorie de la calculabilité et dans le traitement des langues naturelles (tout particulièrement en ce qui concerne leur morphologie et leur syntaxe).

Abstract rewriting system

In mathematical logic and theoretical computer science, an abstract rewriting system (also (abstract) reduction system or abstract rewrite system; abbreviated ARS) is a formalism that captures the quintessential notion and properties of rewriting systems. In its simplest form, an ARS is simply a set (of "objects") together with a binary relation, traditionally denoted with ; this definition can be further refined if we index (label) subsets of the binary relation.

Confluence (informatique)

vignette|Le nom « confluence » est le même que celui utilisé en géographie : deux cours d'eau se rejoignent. En mathématiques, ou en informatique, la confluence d'une relation binaire est définie comme la propriété suivante : Pour tous éléments tels que et , il existe un élément tel que et . La confluence est équivalente à la propriété de Church-Rosser. La confluence locale est une propriété plus faible que la confluence, utile pour les systèmes de réécriture. Elle est définie par : Pour tous éléments tels que et , il existe un élément tel que et .

Afficher plus

Exercices associés (6)

Tube irrégulier

An incompressible liquid circulates in a tube. At a certain location, the section of the tube strongly decreases (cf. figure). The continuity equation indicates us that :

\frac{\partial\rho}{\partial t} + \nabla\cdot \rho \vec{v} = 0~.

Show that this is equivalent to the simpler equation:

\quad \langle v_n\rangle=\frac{1}{S_n}\iint_{S_n}\vec{v}\cdot d\vec{\sigma} ~.$$ If we add to the figure the velocity vectors as well as the vect

Boucler la boucle

A stuntwoman attempts to drive her car weighing mg around a vertical looping track of radius R. She enters the track at point P with velocity V⃗_(P) and we assume that she then free-wheels around the track without either braking or accelerating. There is no friction.

Write the car’s equations of motion for the entire loop.
Express the car’s mechanical energy at all points of the loop, and show that the mechanical energy is a simple integral of the motion.
Compute the reaction force from t

Saut à l élastique

A student with mass m, attached to an elastic cord with spring constant k, jumps without any initial speed from a bridge at height h above the river. The elastic cord barely stops the student from touching the river. We neglect friction. We suggest defining a y-axis pointing upwards and with its origin at river height.

Using the conservation of total mechanical energy, show that the cord’s rest length l₀ is $l_0=h-\sqrt{\frac{2mgh}{k}}$ .
Show that, while jumping, the student reached maximal sp

Afficher plus

Notebooks associés (4)

Designing FIR Filters Using the Parks-McClellan Algorithm

The Parks-McClellan Filter Design Method[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

The Parks-McClellan (PM) algorithm is a clever application of advanced polynomial fitting techniques to the problem of FIR filter design. In this notebook we will explore the key ideas behind the method by considering the design of a simple Type-I lowpass filter. NOTE: This notebook uses interactive widgets. If the interactive controls do not work or show up, please fo

Whistle-Activated Keylock System Implementation

Whistling Keylock[1]¶ In this notebook we will implement a simple "whistle-activated" keylock, that is, an access control system where the password is a pre-defined melody. To program the lock, you record your musical passphrase and then, to open the lock, you whistle it back. Although the implementation will be simple and skip most of the fine details that would be necessary to produce a truly robust system, we need to take into account at least the following points: * The syste

Voice Transformation Techniques Using Digital Signal Processing

A Gallery of Voice Transformers[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will explore various ways to implement a system that changes the voice of a speaker. Typical applications for these techniques, strictly sorted by plausibility, include international spy missions and prank telephone calls, and devices such as the one displayed here can be easily bought on the web... or in a novelty shop. No description has been provided for t

Exploring Quantization and Oversampling through One-Bit Music

One-Bit Music[1]¶ In this notebook we will talk about quantization and oversampling and we will do so by taking a trip down memory lane to revisit the early from monophonic square waves, introduce polyphony by way of pulse-width modulation and finish with the basics of sigma-delta quantization. pacman In [1]: import matplotlib import matplotlib.pyplot as plt import numpy as np import scipy.signal as sp from scipy.io import wavfile import IPython In [2]: import sys ! wget -q -O mus

Personnes associées (9)

Simon Guilloud

Dimitri Racordon

Viktor Kuncak

Ayatallah Ahmed Gamal Kamal Elakhras

Exercices associés (6)

Tube irrégulier

An incompressible liquid circulates in a tube. At a certain location, the section of the tube strongly decreases (cf. figure). The continuity equation indicates us that :

\frac{\partial\rho}{\partial t} + \nabla\cdot \rho \vec{v} = 0~.

Show that this is equivalent to the simpler equation:

\quad \langle v_n\rangle=\frac{1}{S_n}\iint_{S_n}\vec{v}\cdot d\vec{\sigma} ~.$$ If we add to the figure the velocity vectors as well as the vect

Boucler la boucle

Write the car’s equations of motion for the entire loop.
Express the car’s mechanical energy at all points of the loop, and show that the mechanical energy is a simple integral of the motion.
Compute the reaction force from t

Saut à l élastique

Using the conservation of total mechanical energy, show that the cord’s rest length l₀ is $l_0=h-\sqrt{\frac{2mgh}{k}}$ .
Show that, while jumping, the student reached maximal sp

Afficher plus

Notebooks associés (4)

Designing FIR Filters Using the Parks-McClellan Algorithm

The Parks-McClellan Filter Design Method[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

Whistle-Activated Keylock System Implementation

Voice Transformation Techniques Using Digital Signal Processing

A Gallery of Voice Transformers[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

Exploring Quantization and Oversampling through One-Bit Music