Projects per year
Fingerprint
The Fingerprint is created by mining the titles and abstracts of the person's research outputs and projects/funding awards to create an index of weighted terms from discipline-specific thesauri.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Projects
- 4 Finished
-
SHF: Small: A Higher-Order Framework for Meta-Theoretic
Nadathur, G. (PI)
THE NATIONAL SCIENCE FOUNDATION
7/1/16 → 9/30/22
Project: Research project
-
Midwest Verification Day, 2011
Nadathur, G. (PI) & Whalen, M. W. (CoI)
THE NATIONAL SCIENCE FOUNDATION
8/1/11 → 7/31/12
Project: Research project
-
SHF:Small: Reasoning about Specifications of Computation
Nadathur, G. (PI)
THE NATIONAL SCIENCE FOUNDATION
6/1/09 → 9/30/14
Project: Research project
-
Supporting Higher-Order Approaches to Symbolic Computati
Nadathur, G. (PI)
THE NATIONAL SCIENCE FOUNDATION
9/1/04 → 8/31/09
Project: Research project
-
Ground Stratified Inductive Definitions
Guermond, N. & Nadathur, G., Jul 15 2026, 11th International Conference on Formal Structures for Computation and Deduction, FSCD 2026. Pfenning, F. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 18. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 378).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
A Modular Approach to Metatheoretic Reasoning for Extensible Languages
Michaelson, D., Nadathur, G. & Van Wyk, E., Sep 16 2025, In: ACM Transactions on Programming Languages and Systems. 47, 3, 10.Research output: Contribution to journal › Article › peer-review
Open Access -
Ground Stratification for a Logic of Definitions with Induction
Guermond, N. & Nadathur, G., 2025, In: Electronic Proceedings in Theoretical Computer Science, EPTCS. 431, p. 1-16 16 p.Research output: Contribution to journal › Conference article › peer-review
Open Access1 Link opens in a new tab Scopus citations -
Transporting Theorems about Typeability in LF Across Schematically Defined Contexts
Johnson, C. & Nadathur, G., Dec 13 2025, Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming, PPDP 2025, Co-located with the 41st International Conference on Logic Programming. Biernacka, M., Olarte, C., Ricca, F. & Cheney, J. (eds.). Association for Computing Machinery, Inc, 12. (Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming, PPDP 2025, Co-located with the 41st International Conference on Logic Programming).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Open Access -
Binding Contexts as Partitionable Multisets in Abella
Gray, T. & Nadathur, G., Jul 8 2024, In: Electronic Proceedings in Theoretical Computer Science, EPTCS. 404, p. 19-34 16 p.Research output: Contribution to journal › Conference article › peer-review
Open Access1 Link opens in a new tab Scopus citations