Pablo Barenbaum
Pablo Barenbaum
Verified email at dc.uba.ar
TitleCited byYear
Distilling abstract machines
B Accattoli, P Barenbaum, D Mazza
ACM SIGPLAN Notices 49 (9), 363-376, 2014
472014
A strong distillery
B Accattoli, P Barenbaum, D Mazza
Asian Symposium on Programming Languages and Systems, 231-250, 2015
132015
Foundations of strong call by need
T Balabonski, P Barenbaum, E Bonelli, D Kesner
Proceedings of the ACM on Programming Languages 1 (ICFP), 20, 2017
92017
Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need
P Barenbaum, E Bonelli, K Mohamed
Proceedings of the 20th International Symposium on Principles and Practice …, 2018
32018
Distilling Abstract Machines (Long Version)
B Accattoli, P Barenbaum, D Mazza
arXiv preprint arXiv:1406.2370, 2014
32014
Efficient repeat finding in sets of strings via suffix arrays
P Barenbaum, V Becher, A Deymonnaz, M Halsband, PA Heiber
Discrete Mathematics and Theoretical Computer Science 15 (2), 59--70, 2013
32013
Optimality and the linear substitution calculus
P Barenbaum, E Bonelli
2nd International Conference on Formal Structures for Computation and …, 2017
12017
Superdevelopments for weak reduction
E Bonelli, P Barenbaum
arXiv preprint arXiv:1001.4429, 2010
12010
Factoring Derivation Spaces via Intersection Types
P Barenbaum, G Ciruelos
Asian Symposium on Programming Languages and Systems, 24-44, 2018
2018
Efficient repeat finding in sets of strings via suffix arrays
PA Heiber, M Halsband, A Deymonnaz, V Becher, P Barenbaum
Discrete Mathematics & Theoretical Computer Science 15, 2013
2013
Superdevelopments en el cálculo-λ débil
P Barenbaum
Universidad de Buenos Aires, 2010
2010
The system can't perform the operation now. Try again later.
Articles 1–11