Sunil Kothari

Researcher
Palo Alto

Biography



Sunil Kothari is a researcher at the Printing and Content Delivery Lab.

 

Research interests

 Strategic and operational planning using Computer  Simulation, SLA negotiation, SLA management for commercial/industrial print.

Awards

Commonwealth Scholarship, 2000-01.

Publications

Selected Recent Publications:
[1] Sunil Kothari, Sharad Singhal, Gary Dispoto, I-Jong Lin. On the Connections Between Types and Service Level Agreements and Implications for Digital Commercial Printing and Other Domains, pp.323-332, 2012 Annual SRII Global Conference, 2012.
 
[2] Sunil Kothari, Jun Zeng, Eric Hoarau, Giordano Beretta, John Ludd Recker, I-Jong Lin. Toward a SLA-based Marketplace for Commercial Print Providers. Presented at the NIP27, Minneapolis, 2011.

Prior Publications and Technical Reports:


[3] S. Kothari. Type Inference and Unification: Formal and Informal Proofs In and Around Wand's Algorithm. PhD Dissertation, University of Wyoming, May 2011. Contains detailed versions of papers 3,4,5,6,7,8 and 9.  Available here.

[4] S. Kothari and J. Caldwell. Towards a Formalized Completeness Proof of Wand's Type Inference Algorithm: Some Issues of Freshness. Technical Report, University of Wyoming, 2010.
 
[5] S. Kothari and J. Caldwell. A Machine Checked Model of Idempotent MGU Axioms For a List of Equational Constraints. Presented at the 24th International Workshop on Unification (UNIF'10), July 14, 2010, Edinburgh, United Kingdom. An updated version of 4 and 5 was published in EPTCS (Vol. 42).

[6] S. Kothari and J. Caldwell. Toward a machine-certified correctness proof of Wand's type reconstruction algorithm. Extended abstract. 4th Informal ACM SIGPLAN Workshop on Mechanizing Metatheory (WMM'09), Edinburgh, United Kingdom.

[7] S. Kothari, J. Caldwell. A Machine Checked Model of MGU Axioms: Applications of Finite Maps and Functional Induction. Presented at the 23rd International Workshop on Unification (UNIF'09), Montreal, Canada.

[8] S. Kothari and J. Caldwell. On Extending Wand's Type Reconstruction Algorithm to Handle Polymorphic Let. Presented at the Fourth Conference on Computability in Europe (CiE'08), Athens, Greece. June 15-20, 2008. 

[9] S. Kothari and J. Caldwell. Wand's Algorithm extended for the Polymorphic ML-Let.Technical Report, University of Wyoming, 2007.

[10] S. Kothari. Type Reconstruction Algorithms - A Survey. Technical Report, University of Wyoming, 2007.

[11] S. Kothari and M. Sulzmann. C++ templates/traits versus haskell type classes. Technical Report TRB2/05, The National University of Singapore, 2005.

[12] S.Kothari. A declarative approach towards ensuring auto-completion and auto-update of HTML form fields. Unpublished paper.