Distilling abstract machines B Accattoli, P Barenbaum, D Mazza
ACM SIGPLAN Notices 49 (9), 363-376, 2014
89 2014 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
31 2017 A strong distillery B Accattoli, P Barenbaum, D Mazza
Asian Symposium on Programming Languages and Systems, 231-250, 2015
24 2015 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
10 2018 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
10 2013 Optimality and the linear substitution calculus P Barenbaum, E Bonelli
2nd International Conference on Formal Structures for Computation and …, 2017
6 2017 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
3 2021 Distilling Abstract Machines (Long Version) B Accattoli, P Barenbaum, D Mazza
arXiv preprint arXiv:1406.2370, 2014
3 2014 Semantics of a Relational -Calculus P Barenbaum, F Lochbaum, M Milicich
International Colloquium on Theoretical Aspects of Computing, 242-261, 2020
2 2020 Two Decreasing Measures for Simply Typed Lambda-Terms (Extended Version) P Barenbaum, C Sottile
arXiv preprint arXiv:2304.12440, 2023
1 2023 Reductions in higher-order rewriting and their equivalence P Barenbaum, E Bonelli
arXiv preprint arXiv:2210.15654, 2022
1 2022 Rewrites as terms through justification logic P Barenbaum, E Bonelli
Proceedings of the 22nd International Symposium on Principles and Practice …, 2020
1 2020 Superdevelopments for weak reduction E Bonelli, P Barenbaum
arXiv preprint arXiv:1001.4429, 2010
1 2010 Hybrid Intersection Types for PCF (Extended Version) P Barenbaum, D Kesner, M Milicich
arXiv preprint arXiv:2404.14340, 2024
2024 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