Marcos Viera
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Marcos Viera has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- João Saraiva
University of Minho & HASLab, INESCTEC, Braga, Portugal
5 shared publications - Alberto Pardo
Universidad de la República
4 shared publications - José Nuno Macedo
INESC TEC, University of Minho, Braga, Portugal
4 shared publications - Alejandra Carboni
Facultad de Psicología, Centro de Investigación Básica en Psicología, Universidad de la República , Montevideo
1 shared publication - Anaclara Gerosa
Universidad de la República, Montevideo, Uruguay
1 shared publication - Daniel Calegari
Universidad ORT Uruguay
1 shared publication
Latest Publications
- 2 August 2026
- Published by Springer Nature
- p. 51-70
Verifying the Functional Correctness of Braun Trees with LiquidHaskell
- 2 August 2026
- Published by Springer Nature
- p. 51-70
Verifying the Functional Correctness of Braun Trees with LiquidHaskell
- Open Access
- 9 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 26-38
Representing Data Structures with Invariants in Haskell: The Cases of BST and AVL
- 9 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 26-38
Open AccessRepresenting Data Structures with Invariants in Haskell: The Cases of BST and AVL
- Open Access
- 8 August 2025
- Published by Elsevier in Computers and Education Open
- Vol. 9
A review of computational thinking interventions in upper elementary education
- 8 August 2025
- Published by Elsevier in Computers and Education Open
- Vol. 9
Open AccessA review of computational thinking interventions in upper elementary education
- Open Access
- 12 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 16-29
Property-based Testing of Attribute Grammars
- 12 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 16-29
Open AccessProperty-based Testing of Attribute Grammars
- Open Access
- 15 February 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 211
Zipper-based embedding of strategic attribute grammars
- 15 February 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 211
Open AccessZipper-based embedding of strategic attribute grammars
- Open Access
Zipping Strategies and Attribute Grammars
Strategic term rewriting and attribute grammars are two powerful programming techniques widely used in language engineering. The former, relies on strategies to apply term rewrite rules in defining language transformations, while the latter is suitable to express context-dependent language processing algorithms. Each of these techniques, however, is usually implemented by its own powerful and large language processor system. As a result, it makes such systems harder to extend and to combine. In this paper, we present the embedding of both strategic tree rewriting and attribute grammars in a zipper-based, purely functional setting. Zippers provide a simple, but generic tree-walk mechanism that is the building block technique we use to express the purely-functional embedding of both techniques. The embedding of the two techniques in the same setting has several advantages: First, we easily combine/zip attribute grammars and strategies, thus providing language engineers the best of the two worlds. Second, the combined embedding is easier to maintain and extend since it is written in a concise and uniform setting. This results in a very small library which is able to express advanced (static) analysis and transformation tasks. We show the expressive power of our library in optimizing Haskell let expressions, expressing several Haskell refactorings and solving several language processing tasks of the LDTA Tool Challenge.
Open AccessZipping Strategies and Attribute Grammars
Strategic term rewriting and attribute grammars are two powerful programming techniques widely used in language engineering. The former, relies on strategies to apply term rewrite rules in defining language transformations, while the latter is suitable to express context-dependent language processing algorithms. Each of these techniques, however, is usually implemented by its own powerful and large language processor system. As a result, it makes such systems harder to extend and to combine. In this paper, we present the embedding of both strategic tree rewriting and attribute grammars in a zipper-based, purely functional setting. Zippers provide a simple, but generic tree-walk mechanism that is the building block technique we use to express the purely-functional embedding of both techniques. The embedding of the two techniques in the same setting has several advantages: First, we easily combine/zip attribute grammars and strategies, thus providing language engineers the best of the two worlds. Second, the combined embedding is easier to maintain and extend since it is written in a concise and uniform setting. This results in a very small library which is able to express advanced (static) analysis and transformation tasks. We show the expressive power of our library in optimizing Haskell let expressions, expressing several Haskell refactorings and solving several language processing tasks of the LDTA Tool Challenge.
- 15 November 2015
- Published by Springer Nature
- p. 112-127
Model-Driven Engineering Based on Attribute Grammars
- 15 November 2015
- Published by Springer Nature
- p. 112-127
Model-Driven Engineering Based on Attribute Grammars
- Open Access
- 22 October 2006
- Published by Association for Computing Machinery (ACM)
- p. 11-20
A multi-stage language with intensional analysis
- 22 October 2006
- Published by Association for Computing Machinery (ACM)
- p. 11-20
Open AccessA multi-stage language with intensional analysis