10 citations · 31 across the 16 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2018
Confluent terminating extensional lambda-calculi with surjective pairing and terminal type
Yohji Akama
For the lambda-calculus with surjective pairing and terminal type, Curien and Di Cosmo were inspired by Knuth-Bendix completion, and introduced a confluent rewriting system that (1…
cs.LO2011
Set systems: order types, continuous nondeterministic deformations, and quasi-orders
Yohji Akama
By reformulating a learning process of a set system L as a game between Teacher and Learner, we define the order type of L to be the order type of the game tree, if the tree is wel…