Talks

“Redex → Coq: towards a theory of decidability of Redex’s reduction semantics”. M. Soldevila, R. Ribeiro and B. Ziliani. In Fifteenth Conference on Interactive Theorem Proving, ITP’24. Virtual.

“Redex → Coq: towards a theory of decidability of Redex’s reduction semantics” (and some background on proof assistants based on dependent type theory). M. Soldevila, R. Ribeiro and B. Ziliani. At Saarland University, Dependable Systems and Software group, April 2024, Saarbrücken, Germany.

“Introducción a los asistentes de pruebas basados en teorı́a de tipos dependientes, en especı́fico “Coq” (y resultados parciales sobre Redex → Coq)” (spanish). M. Soldevila and B. Ziliani. At Reunión Anual De La Unión Matemática Argentina (UMA’23), September 2023, Salta, Argentina.

“Understanding Lua’s Garbage Collection - Towards a Formalized Static Analyzer” (english). M. Soldevila, B. Ziliani, and D. Fridlender. At 22nd International Symposium on Principles and Practice of Declarative Programming, virtual conference, 2020.

“Semántica operacional y su aplicación para el estudio de recolección de basura, en Lua 5.2” (english). M. Soldevila, B. Ziliani, and D. Fridlender. At Seminario LoRel (listed in researchseminars.org), Argentina, 2020.

“Decoding Lua: Formal semantics for the developer and the semanticist”. M. Soldevila, B. Ziliani, B. Silvestre, D. Fridlender, and F. Mascarenhas. At 13th ACM SIGPLAN Dynamic Languages Symposium, DLS 2017, Vancouver, Canada, 2017.

“Decoding Lua: Formal semantics for the developer and the semanticist”. M. Soldevila, B. Ziliani, B. Silvestre, D. Fridlender, and F. Mascarenhas. At ACM SIGPLAN conference on Systems, Programming, Languages and Applications: Software for Humanity (SPLASH) Poster track, Vancouver, Canada, 2017.