Zobrazeno 1 - 10
of 69
pro vyhledávání: '"rewriting calculus"'
Publikováno v:
WRLA
The Rewriting Calculus has been proposed as a foundational system combining the central ideas of λ-calculus and term rewriting. The rewriting is explicit, in the sense that rules must be applied explicitly to terms to transform them. This paper begi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c1fd1a0308c17a3c3c6983adf228442c
https://doi.org/10.1016/j.entcs.2004.06.028
https://doi.org/10.1016/j.entcs.2004.06.028
Autor:
Benjamin Wack, Clément Houtmann
Publikováno v:
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2008, Rewriting calculi, higher-order reductions and patterns, 18 (3), pp.431-465. ⟨10.1017/S0960129508006749⟩
Mathematical Structures in Computer Science, 2008, Rewriting calculi, higher-order reductions and patterns, 18 (3), pp.431-465. ⟨10.1017/S0960129508006749⟩
Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2008, Rewriting calculi, higher-order reductions and patterns, 18 (3), pp.431-465. ⟨10.1017/S0960129508006749⟩
Mathematical Structures in Computer Science, 2008, Rewriting calculi, higher-order reductions and patterns, 18 (3), pp.431-465. ⟨10.1017/S0960129508006749⟩
Pure Pattern Type Systems (P2TS) combine the frameworks and capabilities of rewriting and λ-calculus within a unified setting. Their type systems, which are adapted from Barendregt's λ-cube, are especially interesting from a logical point of view.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ad3c39a2684056d6ab7e51058cd7760
https://doi.org/10.1017/s0960129508006749
https://doi.org/10.1017/s0960129508006749
Publikováno v:
7th International Workshop on Reduction Strategies in Rewriting and Programming-WRS 2007
7th International Workshop on Reduction Strategies in Rewriting and Programming-WRS 2007, Jun 2007, Paris, France
7th International Workshop on Reduction Strategies in Rewriting and Programming-WRS 2007, Jun 2007, Paris, France
International audience; The graph rewriting calculus is an extension of the $\rho$-calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using unification constraints in addition to the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37384c6565dda5a2f22f67ee39b39441
Publikováno v:
EXPRESS
The ρ -calculus generalises both term rewriting and the λ -calculus in a uniform framework. Interaction nets are a form of graph rewriting which proved most successful in understanding the dynamics of the λ -calculus, the prime example being the i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f6da11a972db90d7f26fdb6715342880
https://doi.org/10.1016/j.entcs.2006.05.004
https://doi.org/10.1016/j.entcs.2006.05.004
Autor:
Claude Kirchner
Publikováno v:
4th International Workshop on Reduction Strategies in Rewriting and Programming-WRS'2004
4th International Workshop on Reduction Strategies in Rewriting and Programming-WRS'2004, 2004, Aachen, Germany
4th International Workshop on Reduction Strategies in Rewriting and Programming-WRS'2004, 2004, Aachen, Germany
Colloque sur invitation.; This is a position paper preparing the round table organized during the 4th International Workshop on Reduction Strategies in Rewriting and Programming. I sketch what I believe to be important challenges of strategic rewriti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be6c1ea4d110331748963578b0a7af99
https://doi.org/10.1016/j.entcs.2004.11.017
https://doi.org/10.1016/j.entcs.2004.11.017
Publikováno v:
Electronic Notes in Theoretical Computer Science
WRS 2003, 3rd International Workshop on Reduction Strategies in Rewriting and Programming-Final Proceedings
WRS 2003, 3rd International Workshop on Reduction Strategies in Rewriting and Programming-Final Proceedings, Jun 2003, Valencia, Spain. pp.593-624, ⟨10.1016/S1571-0661(05)82613-1⟩
WRS 2003, 3rd International Workshop on Reduction Strategies in Rewriting and Programming-Final Proceedings
WRS 2003, 3rd International Workshop on Reduction Strategies in Rewriting and Programming-Final Proceedings, Jun 2003, Valencia, Spain. pp.593-624, ⟨10.1016/S1571-0661(05)82613-1⟩
International audience; This paper presents an overview on the use of the rewriting calculus to express rewrite strategies. We motivate first the use of rewrite strategies by examples in the ELAN language. We then show how this has been modeled in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36332f185d93cc01580eee87e1607ec2
Publikováno v:
Sixth International Workshop on Reduction Strategies in Rewriting and Programming
Sixth International Workshop on Reduction Strategies in Rewriting and Programming, Aug 2006, Seattle, Washington, United States. pp.39-56
Sixth International Workshop on Reduction Strategies in Rewriting and Programming, Aug 2006, Seattle, Washington, United States. pp.39-56
We use the ρ-calculus as an intermediate language to compile functional languages with pattern-matching features, and give an interaction net encoding of the ρ-terms arising from the compilation. This encoding gives rise to new strategies of evalua
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::506c7f1f81a503e45d5284f67d4d6f9c
https://hal.inria.fr/inria-00000821
https://hal.inria.fr/inria-00000821
Autor:
Liquori, Luigi, Wack, Benjamin
Publikováno v:
Electronic Notes in Theoretical Computer Science
Proceedings of the Fifth International Workshop on Rewriting Logic and Its Applications (WRLA 2004) Rewriting Logic and Its Applications 2004
Proceedings of the Fifth International Workshop on Rewriting Logic and Its Applications (WRLA 2004) Rewriting Logic and Its Applications 2004, Narciso Marti-Oliet, Mar 2004, Barcelona, Spain. pp.89-111, ⟨10.1016/j.entcs.2004.06.027⟩
Proceedings of the Fifth International Workshop on Rewriting Logic and Its Applications (WRLA 2004) Rewriting Logic and Its Applications 2004
Proceedings of the Fifth International Workshop on Rewriting Logic and Its Applications (WRLA 2004) Rewriting Logic and Its Applications 2004, Narciso Marti-Oliet, Mar 2004, Barcelona, Spain. pp.89-111, ⟨10.1016/j.entcs.2004.06.027⟩
International audience; The rewriting calculus (rho-calculus), is a minimal framework embedding lambda-calculus and term rewriting systems, by allowing abstraction on variables and patterns. The rho-calculus features higher-order functions (from lamb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::46baf05f3111cf4cb34563f37e4e5454
https://hal.inria.fr/inria-00099910/file/2005-wrla-04.pdf
https://hal.inria.fr/inria-00099910/file/2005-wrla-04.pdf
Autor:
Hélène Kirchner, Oana Andrei
Publikováno v:
TERMGRAPH 2009, 5th International Workshop on Computing with Terms and Graphs, Satellite Event of ETAPS 2009
TERMGRAPH 2009, 5th International Workshop on Computing with Terms and Graphs, Satellite Event of ETAPS 2009, A. Corradini, Mar 2009, York, United Kingdom
TERMGRAPH 2009, 5th International Workshop on Computing with Terms and Graphs, Satellite Event of ETAPS 2009, A. Corradini, Mar 2009, York, United Kingdom
From our previous work on biochemical applications, the structure of port graph (or multigraph with ports) and a rewriting calculus have proved to be well-suited formalisms for modeling interactions between proteins. Then port graphs have been propos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bccfdf9bb5bf654d260f8def45d53378
https://hal.inria.fr/inria-00418560
https://hal.inria.fr/inria-00418560