1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
cs.PL2021★ 1 cited
Implementing G-Machine in HyperLMNtal
Jin Sano
Since language processing systems generally allocate/discard memory with complex reference relationships, including circular and indirect references, their implementation is often…