Idioma:

Lazy AC-Pattern Matching for Rewriting

Belkhir, Walid ; Giorgetti, Alain

Electronic proceedings in theoretical computer science, 2012-01, Vol.82 (Proc. WRS 2011), p.37-51

Texto completo disponível

Citações Citado por

Título:
Lazy AC-Pattern Matching for Rewriting
Autor: Belkhir, Walid ; Giorgetti, Alain
Assuntos: Computer Science ; Logic in Computer Science
É parte de: Electronic proceedings in theoretical computer science, 2012-01, Vol.82 (Proc. WRS 2011), p.37-51
Descrição: We define a lazy pattern-matching mechanism modulo associativity and commutativity. The solutions of a pattern-matching problem are stored in a lazy list composed of a first substitution at the head and a non-evaluated object that encodes the remaining computations. We integrate the lazy AC-matching in a strategy language: rewriting rule and strategy application produce a lazy list of terms
Editor: Open Publishing Association
Idioma: Inglês

Links

Voltar para lista de resultados

Anterior Resultado 9 Avançar Ir para próxima página