Pablo Barenbaum

According to our database1, Pablo Barenbaum authored at least 13 papers between 2009 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

Rewrites as Terms through Justification Logic.
Proceedings of the PPDP '20: 22nd International Symposium on Principles and Practice of Declarative Programming, 2020

Semantics of a Relational λ-Calculus.
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).
CoRR, 2019

2018
Pattern Matching and Fixed Points: Resource Types and Strong Call-By-Need: Extended Abstract.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

Factoring Derivation Spaces via Intersection Types.
Proceedings of the Programming Languages and Systems - 16th Asian Symposium, 2018

2017
Foundations of strong call by need.
Proc. ACM Program. Lang., 2017

Optimality and the Linear Substitution Calculus.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2015
A Strong Distillery.
Proceedings of the Programming Languages and Systems - 13th Asian Symposium, 2015

2014
Distilling Abstract Machines (Long Version).
CoRR, 2014

Distilling abstract machines.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

2013
Efficient repeat finding in sets of strings via suffix arrays.
Discret. Math. Theor. Comput. Sci., 2013

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


  Loading...