Daniel M. Leivant
Affiliations: | Indiana University, Bloomington, Bloomington, IN, United States |
Area:
Computer ScienceGoogle:
"Daniel Leivant"Children
Sign in to add trainee| Yevgeniy Makarov | grad student | 2006 | Indiana University |
| Byron L. Long | grad student | 2009 | Indiana University |
| Ramyaa | grad student | 2012 | Indiana University |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Paiva Vd, Moss LS, Leivant D, et al. (2016) 22nd Workshop on Logic, Language, Information and Computation (WoLLIC 2015) Logic Journal of the Igpl \/ Bulletin of the Igpl. 24: 859-859 |
| Leivant DM. (2014) Global semantic typing for inductive and coinductive computing Logical Methods in Computer Science. 10 |
| Finkel O, Leivant D. (2014) Ambiguity of Ï-Languages of Turing Machines Logical Methods in Computer Science. 10 |
| Leivant D. (2013) Alternating Turing machines for inductive languages Logical Methods in Computer Science. 9 |
| Ramyaa R, Leivant D. (2011) Ramified Corecurrence and Logspace Electronic Notes in Theoretical Computer Science. 276: 247-261 |
| Leivant D. (2009) Inductive Completeness of Logics of Programs Electronic Notes in Theoretical Computer Science. 228: 101-112 |
| Leivant D. (2008) Propositional Dynamic Logic with Program Quantifiers Electronic Notes in Theoretical Computer Science. 218: 231-240 |
| Leivant D. (2004) Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion Theoretical Computer Science. 318: 181-196 |
| Leivant D. (2003) Feasible functionals and intersection of ramified types Electronic Notes in Theoretical Computer Science. 70: 149-162 |
| Leivant D. (2002) Intrinsic reasoning about functional programs I: first order theories Annals of Pure and Applied Logic. 114: 117-153 |