Showing cs.PLShow all
3 papers · 1 filter
cs.PL2025
Graph Rewriting Language as a Platform for Quantum Diagrammatic Calculi
Kayo Tei, Haruto Mishina, Naoki Yamamoto +1
Systematic discovery of optimization paths in quantum circuit simplification remains a challenge. Today, ZX-calculus, a computing model for quantum circuit transformation, is attra…
cs.PL2025
Introducing Linear Implication Types to for Computing With Incomplete Graphs
Jin Sano, Naoki Yamamoto, Kazunori Ueda
Designing programming languages that enable intuitive and safe manipulation of data structures is a critical research challenge. Conventional destructive memory operations using po…
cs.PL2022
Type checking data structures more complex than trees
Jin Sano, Naoki Yamamoto, Kazunori Ueda
Graphs are a generalized concept that encompasses more complex data structures than trees, such as difference lists, doubly-linked lists, skip lists, and leaf-linked trees. Normall…