Call by need computations in orthogonal term rewriting systems
The foundation of term rewriting is equational logic but for the sake of efficiency, the equations are oriented and become the rules of a term rewriting system. Term rewriting form a model of computation on algebraic data structures (terms). Term rewriting systems play an important role in various d...
Main Author: | Durand, Irène |
---|---|
Language: | FRE |
Published: |
Université Sciences et Technologies - Bordeaux I
2005
|
Subjects: | |
Online Access: | http://tel.archives-ouvertes.fr/tel-00599195 http://tel.archives-ouvertes.fr/docs/00/59/91/95/PDF/hdr.pdf |
Similar Items
-
Call by need computations in orthogonal term rewriting systems
by: Durand, Irène
Published: (2005) -
The graph rewriting calculus: properties and expressive capabilities
by: Bertolissi, Clara
Published: (2005) -
The versatility of using explanations within constraint programming
by: Jussien, Narendra
Published: (2003) -
Contributions à l'analyse de systèmes par approximation d'ensembles réguliers
by: Courbis, Roméo
Published: (2011) -
Étalonnage des robots à câbles : identification et qualification
by: Alexandre Dit Sandretto, Julien
Published: (2013)