The Power of Closed Reduction Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Taming Modal Impredicativity: Superlazy Reduction
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Context semantics, linear logic, and computational complexity
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
Towards a geometry of recursion
Theoretical Computer Science
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Hi-index | 0.00 |
The theme of this paper is profunctors, and their centrality and ubiquity in understanding concurrent computation. Profunctors (a.k.a. distributors, or bimodules) are a generalisation of relations to categories. Here they are first presented and motivated ...