Follow
Pablo Barenbaum
Pablo Barenbaum
Verified email at dc.uba.ar
Title
Cited by
Cited by
Year
Distilling abstract machines
B Accattoli, P Barenbaum, D Mazza
ACM SIGPLAN Notices 49 (9), 363-376, 2014
892014
Foundations of strong call by need
T Balabonski, P Barenbaum, E Bonelli, D Kesner
Proceedings of the ACM on Programming Languages 1 (ICFP), 1-29, 2017
312017
A strong distillery
B Accattoli, P Barenbaum, D Mazza
Asian Symposium on Programming Languages and Systems, 231-250, 2015
242015
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
102018
Efficient repeat finding in sets of strings via suffix arrays
P Barenbaum, V Becher, A Deymonnaz, M Halsband, PA Heiber
Discrete Mathematics & Theoretical Computer Science 15 (Discrete Algorithms), 2013
102013
Optimality and the linear substitution calculus
P Barenbaum, E Bonelli
2nd International Conference on Formal Structures for Computation and …, 2017
62017
A constructive logic with classical proofs and refutations
P Barenbaum, T Freund
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021
32021
Distilling Abstract Machines (Long Version)
B Accattoli, P Barenbaum, D Mazza
arXiv preprint arXiv:1406.2370, 2014
32014
Semantics of a Relational -Calculus
P Barenbaum, F Lochbaum, M Milicich
International Colloquium on Theoretical Aspects of Computing, 242-261, 2020
22020
Two Decreasing Measures for Simply Typed Lambda-Terms (Extended Version)
P Barenbaum, C Sottile
arXiv preprint arXiv:2304.12440, 2023
12023
Reductions in higher-order rewriting and their equivalence
P Barenbaum, E Bonelli
arXiv preprint arXiv:2210.15654, 2022
12022
Rewrites as terms through justification logic
P Barenbaum, E Bonelli
Proceedings of the 22nd International Symposium on Principles and Practice …, 2020
12020
Superdevelopments for weak reduction
E Bonelli, P Barenbaum
arXiv preprint arXiv:1001.4429, 2010
12010
A Diamond Machine for Strong Evaluation
B Accattoli, P Barenbaum
Asian Symposium on Programming Languages and Systems, 69-90, 2023
2023
Proofs and Refutations for Intuitionistic and Second-Order Logic
P Barenbaum, T Freund
31st EACSL Annual Conference on Computer Science Logic (CSL 2023), 2023
2023
Proofs and Refutations for Intuitionistic and Second-Order Logic (Extended Version)
P Barenbaum, T Freund
arXiv preprint arXiv:2210.07274, 2022
2022
A Constructive Logic with Classical Proofs and Refutations (Extended Version)
P Barenbaum, T Freund
arXiv preprint arXiv:2104.04589, 2021
2021
Dynamic Semantics of Calculi with Explicit Substitutions at a Distance
P Barenbaum
Universidad de Buenos Aires, 2020
2020
Semantica dinamica de calculos de sustituciones explıcitas a distancia
P Barenbaum
Universidad de Buenos Aires, 2020
2020
Semantics of a Relational {\lambda}-Calculus (Extended Version)
P Barenbaum, F Lochbaum, M Milicich
arXiv preprint arXiv:2009.10929, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20