Roberto Ierusalimschy
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Roberto Ierusalimschy has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Fabio Mascarenhas
Department of Computer Science UFRJ -Rio de Janeiro Brazil
6 shared publications - Noemi Rodriguez
PUC-Rio
4 shared publications - Sérgio Medeiros
Department of Computer Science UFS -Aracaju Brazil
3 shared publications - Sérgio Queiroz de Medeiros
UFRN
3 shared publications - André Murbach Maidl
Polytechnic School, PUCPR, Curitiba, Brazil
2 shared publications Noemi DE LA Rocque Rodriguez
2 shared publications
Latest Publications
- Open Access
- 22 September 2025
- Published by Sociedade Brasileira de Computação
- p. 97-99
Approaching closures in unmanaged languages: a comparison between C++, Rust, and Swift
When using lambdas in managed languages, the programmer does not need to concern themselves with the disposal of the closure; in contrast, unmanaged languages that implement lambdas need mechanisms to make the closures be disposed safely at the right time. Through examples, we explore and compare the following languages: C++, Rust, and Swift. For each language, we implement examples of the usage of lambdas in increasing complexity, analyzing how they work while showcasing the implementations. After presenting the implementations, we contrast the languages regarding memory safety and typing. Finally, from those experiments, we assess some properties of lambdas in the languages and summarize them in a table, namely: safety features, safe by default, safety guarantees, verbosity, type flexibility, and memory overhead.
- 22 September 2025
- Published by Sociedade Brasileira de Computação
- p. 97-99
Open AccessApproaching closures in unmanaged languages: a comparison between C++, Rust, and Swift
When using lambdas in managed languages, the programmer does not need to concern themselves with the disposal of the closure; in contrast, unmanaged languages that implement lambdas need mechanisms to make the closures be disposed safely at the right time. Through examples, we explore and compare the following languages: C++, Rust, and Swift. For each language, we implement examples of the usage of lambdas in increasing complexity, analyzing how they work while showcasing the implementations. After presenting the implementations, we contrast the languages regarding memory safety and typing. Finally, from those experiments, we assess some properties of lambdas in the languages and summarize them in a table, namely: safety features, safe by default, safety guarantees, verbosity, type flexibility, and memory overhead.
- 10 April 2025
- Published by Elsevier in Journal of Computer Languages
- Vol. 83
The evolution of Lua, continued
- 10 April 2025
- Published by Elsevier in Journal of Computer Languages
- Vol. 83
The evolution of Lua, continued
- Open Access
- 30 September 2024
- Published by Sociedade Brasileira de Computação
- p. 10-16
Compact Representations for Arrays in Lua
Several languages use a tagged representation for values, so that each value carries its own type during runtime. Lua, in particular, represents each value by a structure with two fields: A union for the values themselves and a byte with the tag. Despite its simplicity, this representation has a big drawback: Due to alignment restrictions, it typically wastes more than 40% of memory in padding. This waste is specially expensive for large arrays. In this work, we discuss alternative implementations for Lua arrays that eliminate this waste and evaluate them regarding performance, with a special focus on code overhead and memory locality. The presented data structures are quite generic, and can be used not only in the Lua interpreter, but in any program that needs arrays of tagged values.
- 30 September 2024
- Published by Sociedade Brasileira de Computação
- p. 10-16
Open AccessCompact Representations for Arrays in Lua
Several languages use a tagged representation for values, so that each value carries its own type during runtime. Lua, in particular, represents each value by a structure with two fields: A union for the values themselves and a byte with the tag. Despite its simplicity, this representation has a big drawback: Due to alignment restrictions, it typically wastes more than 40% of memory in padding. This waste is specially expensive for large arrays. In this work, we discuss alternative implementations for Lua arrays that eliminate this waste and evaluate them regarding performance, with a special focus on code overhead and memory locality. The presented data structures are quite generic, and can be used not only in the Lua interpreter, but in any program that needs arrays of tagged values.
- 24 August 2022
- Published by Elsevier in Journal of Computer Languages
- Vol. 72
A surprisingly simple Lua compiler—Extended version
- 24 August 2022
- Published by Elsevier in Journal of Computer Languages
- Vol. 72
A surprisingly simple Lua compiler—Extended version
- Open Access
- 9 August 2021
- Published by Association for Computing Machinery (ACM)
- p. 1-2
From Brazil: A Forest of Computer Graphics and Interactive Techniques
- 9 August 2021
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessFrom Brazil: A Forest of Computer Graphics and Interactive Techniques
- 1 September 2020
- Published by Elsevier in Science of Computer Programming
- Vol. 196
Revisiting monitors
- 1 September 2020
- Published by Elsevier in Science of Computer Programming
- Vol. 196
Revisiting monitors
- 1 February 2019
- Published by Elsevier in Journal of Systems Architecture
- Vol. 97, 239-257
A memory-bounded, deterministic and terminating semantics for the synchronous programming language Céu
- 1 February 2019
- Published by Elsevier in Journal of Systems Architecture
- Vol. 97, 239-257
A memory-bounded, deterministic and terminating semantics for the synchronous programming language Céu
- 2 February 2018
- Published by Faculdades Catolicas in MONOGRAFIAS EM CIÊNCIA DA COMPUTAÇÃO
EMBEDDING CONCURRENCY: A LUA CASE STUDY
- 2 February 2018
- Published by Faculdades Catolicas in MONOGRAFIAS EM CIÊNCIA DA COMPUTAÇÃO
EMBEDDING CONCURRENCY: A LUA CASE STUDY
- 2 February 2018
- Published by Faculdades Catolicas in MONOGRAFIAS EM CIÊNCIA DA COMPUTAÇÃO
CÉU: EMBEDDED, SAFE, AND REACTIVE PROGRAMMING
- 2 February 2018
- Published by Faculdades Catolicas in MONOGRAFIAS EM CIÊNCIA DA COMPUTAÇÃO
CÉU: EMBEDDED, SAFE, AND REACTIVE PROGRAMMING
- 20 August 2016
- Published by Elsevier in Science of Computer Programming
- Vol. 132, 129-140
Error reporting in Parsing Expression Grammars
- 20 August 2016
- Published by Elsevier in Science of Computer Programming
- Vol. 132, 129-140
Error reporting in Parsing Expression Grammars