Pablo Barenbaum

According to our database, Pablo Barenbaum authored at least 25 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

The Essense of Useful Evaluation Through Quantitative Types (Extended Version).

Pablo Barenbaum, Delia Kesner, Mariana Milicich

CoRR, 2024

Hybrid Intersection Types for PCF (Extended Version).

Pablo Barenbaum, Delia Kesner, Mariana Milicich

CoRR, 2024

Hybrid Intersection Types for PCF.

Pablo Barenbaum, Delia Kesner, Mariana Milicich

Proceedings of the LPAR 2024: Proceedings of 25th Conference on Logic for Programming, 2024

2023

Two Decreasing Measures for Simply Typed Lambda-Terms (Extended Version).

Pablo Barenbaum, Cristian Sottile

CoRR, 2023

Two Decreasing Measures for Simply Typed λ-Terms.

Pablo Barenbaum, Cristian Sottile

Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

Proofs and Refutations for Intuitionistic and Second-Order Logic.

Pablo Barenbaum, Teodoro Freund

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

Reductions in Higher-Order Rewriting and Their Equivalence.

Pablo Barenbaum, Eduardo Bonelli

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

A Diamond Machine for Strong Evaluation.

Beniamino Accattoli, Pablo Barenbaum

Proceedings of the Programming Languages and Systems - 21st Asian Symposium, 2023

2022

Proofs and Refutations for Intuitionistic and Second-Order Logic (Extended Version).

Pablo Barenbaum, Teodoro Freund

CoRR, 2022

2021

A Constructive Logic with Classical Proofs and Refutations (Extended Version).

Pablo Barenbaum, Teodoro Freund

CoRR, 2021

A Constructive Logic with Classical Proofs and Refutations.

Pablo Barenbaum, Teodoro Freund

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020

Dynamic Semantics of Calculi with Explicit Substitutions at a Distance. (Semántica dinámica de cálculos de sustituciones explícitas a distancia / Sémantique dynamique des calculs avec substitutions explicites à distance).

Pablo Barenbaum

PhD thesis, 2020

Semantics of a Relational λ-Calculus (Extended Version).

Pablo Barenbaum, Federico Lochbaum, Mariana Milicich

CoRR, 2020

Rewrites as Terms through Justification Logic.

Pablo Barenbaum, Eduardo Bonelli

Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

Semantics of a Relational λ-Calculus.

Pablo Barenbaum, Federico Lochbaum, Mariana Milicich

Proceedings of the Theoretical Aspects of Computing - ICTAC 2020 - 17th International Colloquium, Macau, China, November 30, 2020

2019

Factoring Derivation Spaces via Intersection Types (Extended Version).

Pablo Barenbaum, Gonzalo Ciruelos

CoRR, 2019

2018

Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract.

Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed

Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

Factoring Derivation Spaces via Intersection Types.

Pablo Barenbaum, Gonzalo Ciruelos

Proceedings of the Programming Languages and Systems - 16th Asian Symposium, 2018

2017

Foundations of strong call by need.

Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner

Proc. ACM Program. Lang., 2017

Optimality and the Linear Substitution Calculus.

Pablo Barenbaum, Eduardo Bonelli

Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2015

A Strong Distillery.

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014

Distilling Abstract Machines (Long Version).

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

CoRR, 2014

Distilling abstract machines.

Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza

Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013

Efficient repeat finding in sets of strings via suffix arrays.

Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber

Discret. Math. Theor. Comput. Sci., 2013

2009

Superdevelopments for Weak Reduction

Eduardo Bonelli, Pablo Barenbaum

Proceedings of the Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming, 2009