Hugo Musso Gualandi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hugo Musso Gualandi has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Gustavo de Mendonça Freire
Universidade Federal do Rio de Janeiro, Instituto de Computação, Rio de Janeiro, Brazil
1 shared publication - Hugo Nobrega
Universidade Federal do Rio de Janeiro, Instituto de Computação, Rio de Janeiro, Brazil
1 shared publication - Jan Vitek
Czech Technical University, Prague, Czech Republic
1 shared publication - João Paixão
Universidade Federal do Rio de Janeiro, Instituto de Computação, Rio de Janeiro, Brazil
1 shared publication - Manas Thakur
Indian Institute of Technology Bombay, Mumbai, India
1 shared publication - Meetesh Kalpesh Mehta
IIT Bombay, Mumbai, India
1 shared publication
Latest Publications
- Open Access
- 17 August 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (ICFP) , 4-33
An Equational and Graphical Fixed-Point Calculus (Functional Pearl)
The fixed-point calculus is a toolbox of theorems for reasoning equationally about fixed points. However, the underlying concepts of the calculus are not defined equationally, including the central definition, that of least fixed point. Thus, although the key theorems of the fixed-point calculus are equational, their proofs are not. In this work, we give equational specifications for the main concepts of the fixed-point calculus for partially ordered sets, to allow more proofs to be written in an equational style. Since reasoning equationally can be cumbersome without appropriate abstractions, we employ the graphical language of string diagrams, based on a category of feasibility relations, to make reasoning more ergonomical. Our contributions culminate in graphical equational proofs of key results of the fixed-point calculus, including the rolling, diagonal, and square rules; fixed-point fusion; and the mutual recursion theorem.
- 17 August 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 10 (ICFP) , 4-33
Open AccessAn Equational and Graphical Fixed-Point Calculus (Functional Pearl)
The fixed-point calculus is a toolbox of theorems for reasoning equationally about fixed points. However, the underlying concepts of the calculus are not defined equationally, including the central definition, that of least fixed point. Thus, although the key theorems of the fixed-point calculus are equational, their proofs are not. In this work, we give equational specifications for the main concepts of the fixed-point calculus for partially ordered sets, to allow more proofs to be written in an equational style. Since reasoning equationally can be cumbersome without appropriate abstractions, we employ the graphical language of string diagrams, based on a category of feasibility relations, to make reasoning more ergonomical. Our contributions culminate in graphical equational proofs of key results of the fixed-point calculus, including the rolling, diagonal, and square rules; fixed-point fusion; and the mutual recursion theorem.
- Open Access
- 16 October 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 7 (OOPSLA2) , 1176-1197
Reusing Just-in-Time Compiled Code
Most code is executed more than once. If not entire programs then libraries remain unchanged from one run to the next. Just-in-time compilers expend considerable effort gathering insights about code they compiled many times, and often end up generating the same binary over and over again. We explore how to reuse compiled code across runs of different programs to reduce warm-up costs of dynamic languages. We propose to use speculative contextual dispatch to select versions of functions from an off-line curated code repository . That repository is a persistent database of previously compiled functions indexed by the context under which they were compiled. The repository is curated to remove redundant code and to optimize dispatch. We assess practicality by extending Ř, a compiler for the R language, and evaluating its performance. Our results suggest that the approach improves warmup times while preserving peak performance.
- 16 October 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 7 (OOPSLA2) , 1176-1197
Open AccessReusing Just-in-Time Compiled Code
Most code is executed more than once. If not entire programs then libraries remain unchanged from one run to the next. Just-in-time compilers expend considerable effort gathering insights about code they compiled many times, and often end up generating the same binary over and over again. We explore how to reuse compiled code across runs of different programs to reduce warm-up costs of dynamic languages. We propose to use speculative contextual dispatch to select versions of functions from an off-line curated code repository . That repository is a persistent database of previously compiled functions indexed by the context under which they were compiled. The repository is curated to remove redundant code and to optimize dispatch. We assess practicality by extending Ř, a compiler for the R language, and evaluating its performance. Our results suggest that the approach improves warmup times while preserving peak performance.
- 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
- 1 April 2020
- Published by Elsevier in Science of Computer Programming
- Vol. 189
Pallene: A companion language for Lua
- 1 April 2020
- Published by Elsevier in Science of Computer Programming
- Vol. 189
Pallene: A companion language for Lua