The following pages link to Kazuyuki Asada (Q2029492):
Displaying 11 items.
- Categorifying Computations into Components via Arrows as Profunctors (Q2919448) (← links)
- Almost Every Simply Typed $$\lambda $$-Term Has a Long $$\beta $$-Reduction Sequence (Q2988360) (← links)
- The algebra of recursive graph transformation language UnCAL: complete axiomatisation and iteration categorical semantics (Q3130301) (← links)
- Decision Algorithms for Checking Definability of Order-2 Finitary PCF (Q3459425) (← links)
- On word and frontier languages of unsafe higher-order grammars (Q4598252) (← links)
- (Q4625705) (← links)
- Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered (Q5090949) (← links)
- Pumping Lemma for Higher-order Languages (Q5111429) (← links)
- Structural recursion for querying ordered graphs (Q5244813) (← links)
- Streaming ranked-tree-to-string transducers (Q5918275) (← links)
- Streaming ranked-tree-to-string transducers (Q5918805) (← links)
