default search action
Pablo Barenbaum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c14]Pablo Barenbaum, Delia Kesner, Mariana Milicich:
Hybrid Intersection Types for PCF. LPAR 2024: 181-197 - [i11]Pablo Barenbaum, Delia Kesner, Mariana Milicich:
Hybrid Intersection Types for PCF (Extended Version). CoRR abs/2404.14340 (2024) - [i10]Pablo Barenbaum, Delia Kesner, Mariana Milicich:
The Essense of Useful Evaluation Through Quantitative Types (Extended Version). CoRR abs/2404.18874 (2024) - 2023
- [c13]Beniamino Accattoli
, Pablo Barenbaum:
A Diamond Machine for Strong Evaluation. APLAS 2023: 69-90 - [c12]Pablo Barenbaum, Eduardo Bonelli:
Reductions in Higher-Order Rewriting and Their Equivalence. CSL 2023: 8:1-8:18 - [c11]Pablo Barenbaum, Teodoro Freund:
Proofs and Refutations for Intuitionistic and Second-Order Logic. CSL 2023: 9:1-9:18 - [c10]Pablo Barenbaum, Cristian Sottile:
Two Decreasing Measures for Simply Typed λ-Terms. FSCD 2023: 11:1-11:19 - [i9]Pablo Barenbaum, Cristian Sottile:
Two Decreasing Measures for Simply Typed Lambda-Terms (Extended Version). CoRR abs/2304.12440 (2023) - [i8]Beniamino Accattoli, Pablo Barenbaum:
A Diamond Machine For Strong Evaluation. CoRR abs/2309.12515 (2023) - 2022
- [i7]Pablo Barenbaum, Teodoro Freund:
Proofs and Refutations for Intuitionistic and Second-Order Logic (Extended Version). CoRR abs/2210.07274 (2022) - [i6]Pablo Barenbaum, Eduardo Bonelli:
Reductions in Higher-Order Rewriting and Their Equivalence. CoRR abs/2210.15654 (2022) - 2021
- [c9]Pablo Barenbaum, Teodoro Freund:
A Constructive Logic with Classical Proofs and Refutations. LICS 2021: 1-13 - [i5]Pablo Barenbaum, Teodoro Freund:
A Constructive Logic with Classical Proofs and Refutations (Extended Version). CoRR abs/2104.04589 (2021) - 2020
- [b1]Pablo Barenbaum:
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). University of Buenos Aires, Argentina, 2020 - [c8]Pablo Barenbaum, Federico Lochbaum, Mariana Milicich:
Semantics of a Relational λ-Calculus. ICTAC 2020: 242-261 - [c7]Pablo Barenbaum, Eduardo Bonelli:
Rewrites as Terms through Justification Logic. PPDP 2020: 11:1-11:13 - [i4]Pablo Barenbaum, Federico Lochbaum, Mariana Milicich:
Semantics of a Relational λ-Calculus (Extended Version). CoRR abs/2009.10929 (2020)
2010 – 2019
- 2019
- [i3]Pablo Barenbaum, Gonzalo Ciruelos:
Factoring Derivation Spaces via Intersection Types (Extended Version). CoRR abs/1907.08820 (2019) - 2018
- [c6]Pablo Barenbaum, Gonzalo Ciruelos:
Factoring Derivation Spaces via Intersection Types. APLAS 2018: 24-44 - [c5]Pablo Barenbaum, Eduardo Bonelli, Kareem Mohamed:
Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract. PPDP 2018: 6:1-6:12 - 2017
- [j2]Thibaut Balabonski, Pablo Barenbaum, Eduardo Bonelli, Delia Kesner:
Foundations of strong call by need. Proc. ACM Program. Lang. 1(ICFP): 20:1-20:29 (2017) - [c4]Pablo Barenbaum, Eduardo Bonelli:
Optimality and the Linear Substitution Calculus. FSCD 2017: 9:1-9:16 - 2015
- [c3]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
A Strong Distillery. APLAS 2015: 231-250 - [i2]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
A Strong Distillery. CoRR abs/1509.00996 (2015) - 2014
- [c2]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
Distilling abstract machines. ICFP 2014: 363-376 - [i1]Beniamino Accattoli, Pablo Barenbaum, Damiano Mazza:
Distilling Abstract Machines (Long Version). CoRR abs/1406.2370 (2014) - 2013
- [j1]Pablo Barenbaum, Verónica Becher
Efficient repeat finding in sets of strings via suffix arrays. Discret. Math. Theor. Comput. Sci. 15(2): 59-70 (2013)
2000 – 2009
- 2009
- [c1]Eduardo Bonelli, Pablo Barenbaum:
Superdevelopments for Weak Reduction. WRS 2009: 20-31
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-26 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: