4 citations · 10 across the 7 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013★ 1 cited
Global semantic typing for inductive and coinductive computing
Daniel M Leivant
Inductive and coinductive types are commonly construed as ontological (Church-style) types, denoting canonical data-sets such as natural numbers, lists, and streams. For various pu…
cs.LO2013
Alternating Turing machines for inductive languages
Daniel M Leivant
We show that alternating Turing machines, with a novel and natural definition of acceptance, accept precisely the inductive (Pi-1-1) languages. Total alternating machines, that eit…