User loginNavigation 
The complexity of abstract machinesI previously wrote about a brand of research by Guy Blelloch on the Cost semantics for functional languages, which let us make precise claim about the complexity of functional programs without leaving their usual and comfortable programming models (betareduction). While the complexity behavior of weak reduction strategies, such as callbyvalue and callbyname, is by now relatively wellunderstood, the lambdacalculus has a much richer range of reduction strategies, in particular those that can reduce under lambdaabstractions, whose complexity behavior is sensibly more subtle and was, until recently, not very well understood. (This has become a practical concern since the rise in usage of proof assistants that must implement reduction under binders and are very concerned about the complexity of their reduction strategy, which consumes a lot of time during type/proofchecking.) Beniamino Accatoli, who has been coauthoring a lot of work in that area, recently published on arXiv a new paper that has survey quality, and is a good introduction to this area of work and other pointers from the literature.

Browse archivesActive forum topics 
Recent comments
1 hour 22 min ago
1 hour 22 min ago
1 hour 58 min ago
3 hours 33 min ago
5 hours 51 min ago
8 hours 40 min ago
9 hours 16 min ago
10 hours 6 min ago
16 hours 42 min ago
16 hours 48 min ago