Follow
Gopalan Nadathur
Gopalan Nadathur
Professor of Computer Science and Engineering, University of Minnesota
Verified email at cs.umn.edu
Title
Cited by
Cited by
Year
Uniform proofs as a foundation for logic programming
D Miller, G Nadathur, F Pfenning, A Scedrov
Annals of Pure and Applied logic 51 (1-2), 125-157, 1991
8671991
An overview of λProlog
D Miller, G Nadathur
Proc. of the 5th Int. Conf. on Logic Programming, 1988
618*1988
Higher-order logic programming
DA Miller, G Nadathur
International Conference on Logic Programming, 448-462, 1986
2541986
Programming with higher-order logic
D Miller, G Nadathur
Cambridge University Press, 2012
2062012
A logic programming approach to manipulating formulas and programs
D Miller, G Nadathur
University of Pennsylvania. Moore School of Electrical Engineering …, 1987
1601987
Higher-order unification and matching
J Goubault-Larrecq, G Nadathur
Handbook of automated reasoning 2, 1009, 2001
1502001
Higher-order logic programming
G Nadathur, D Miller
Handbook of logic in artificial intelligence and logic programming 5, 499-590, 1998
1461998
Higher-order Horn clauses
G Nadathur, D Miller
Journal of the ACM (JACM) 37 (4), 777-814, 1990
1341990
System description: Teyjus—A compiler and abstract machine based implementation of λProlog
G Nadathur, DJ Mitchell
International Conference on Automated Deduction, 287-291, 1999
1051999
A higher-order logic as the basis for logic programming
G Nadathur
University of Pennsylvania, 1987
971987
Abella: A system for reasoning about relational specifications
D Baelde, K Chaudhuri, A Gacek, D Miller, G Nadathur, A Tiu, Y Wang
Journal of Formalized Reasoning 7 (2), 1-89, 2014
952014
The Bedwyr system for model checking over syntactic expressions
D Baelde, A Gacek, D Miller, G Nadathur, A Tiu
International Conference on Automated Deduction, 391-397, 2007
922007
Some uses of higher-order logic in computational linguistics
DA Miller, G Nadathur
24th Annual Meeting of the Association for Computational Linguistics, 247-256, 1986
851986
HEREDITARY HARROP FORMULAS AND UNIFORM PROOF SYSTEMS.
D Miller, G Nadathur, A Scedrov
Unknown Host Publication Title, 98-105, 1987
801987
A notation for lambda terms a generalization of environments
G Nadathur, DS Wilson
Theoretical Computer Science 198 (1-2), 49-98, 1998
75*1998
A fine-grained notation for lambda terms and its use in intensional operations
G Nadathur
Journal of Functional and Logic Programming 2, 1999, 1999
67*1999
A two-level logic approach to reasoning about computations
A Gacek, D Miller, G Nadathur
Journal of Automated Reasoning 49 (2), 241-273, 2012
642012
Combining generic judgments with recursive definitions
A Gacek, D Miller, G Nadathur
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 33-44, 2008
642008
A proof procedure for the logic of hereditary Harrop formulas
G Nadathur
Journal of Automated Reasoning 11 (1), 115-145, 1993
611993
Nominal abstraction
A Gacek, D Miller, G Nadathur
Information and Computation 209 (1), 48-73, 2011
602011
The system can't perform the operation now. Try again later.
Articles 1–20