Case of (Quite) Painless Dependently Typed Programming: Fully Certified Merge Sort in Agda. - Ernesto Copello; Alvaro Tasistro; Bruno Bianchi (SBLP, 2014)

Modelando procesos cognitivos de la lectura natural con GPT-2. - Bruno Bianchi; Alfredo Umfurer; Juan E. Kamienkowski (CoRR, 2024)

Disentanglement and Compositionality of Letter Identity and Letter Position in Variational Auto-Encoder Vision Models. - Bruno Bianchi; Aakash Agrawal; Stanislas Dehaene; Emmanuel Chemla; Yair Lakretz (CoRR, 2024)

Modeling cognitive processes of natural reading with transformer-based Language Models. - Bruno Bianchi; Fermín Travi; Juan E. Kamienkowski (CoRR, 2025)