3 papers
cs.PL2026
Programming Backpropagation with Reverse Handlers for Arrows
Takahiro Sanada, Keisuke Hoshino, Kenshin Hirai +1
We introduce a new programming language and its categorical semantics in order to design and implement neural networks within the framework of algebraic effects and handlers for ar…
cs.DS2026
A Coalgebraic Dijkstra Algorithm
Takahiro Sanada, Yoà v Montacute, Kittiphon Phalakarn +1
The Dijkstra algorithm is a classical method for solving the shortest path problem on weighted graphs. There are several variations of the Dijkstra algorithm, including algorithms…
cs.FL2024
Explicit Hopcroft's Trick in Categorical Partition Refinement
Takahiro Sanada, Ryota Kojima, Yuichi Komorida +2
Algorithms for partition refinement are actively studied for a variety of systems, often with the optimisation called Hopcroft's trick. However, the low-level description of those…