| 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 | 885 | 1991 |
| An overview of λProlog D Miller, G Nadathur Proc. of the 5th Int. Conf. on Logic Programming, 1988 | 634* | 1988 |
| Higher-order logic programming DA Miller, G Nadathur Third International Conference on Logic Programming: Imperial College of …, 1986 | 260 | 1986 |
| Programming with higher-order logic D Miller, G Nadathur Cambridge University Press, 2012 | 218 | 2012 |
| A logic programming approach to manipulating formulas and programs D Miller, G Nadathur University of Pennsylvania. Moore School of Electrical Engineering …, 1987 | 166 | 1987 |
| Higher-order unification and matching G Dowek Handbook of automated reasoning, 1009-1062, 2001 | 155 | 2001 |
| Higher-order logic programming G Nadathur, D Miller Handbook of logic in artificial intelligence and logic programming 5, 499-590, 1998 | 149 | 1998 |
| Higher-order Horn clauses G Nadathur, D Miller Journal of the ACM (JACM) 37 (4), 777-814, 1990 | 139 | 1990 |
| System Description: Teyjus-A Compiler and Abstract Machine Based Implementation of lambda-Prolog. G Nadathur, DJ Mitchell CADE 16, 287-291, 1999 | 107 | 1999 |
| A higher-order logic as the basis for logic programming G Nadathur University of Pennsylvania, 1987 | 104 | 1987 |
| 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 | 103 | 2014 |
| The Bedwyr system for model checking over syntactic expressions D Baelde, A Gacek, D Miller, G Nadathur, A Tiu CADE 4603, 391-397, 2007 | 93 | 2007 |
| 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 | 87 | 1986 |
| HEREDITARY HARROP FORMULAS AND UNIFORM PROOF SYSTEMS. D Miller, G Nadathur, A Scedrov Unknown Host Publication Title, 98-105, 1987 | 84 | 1987 |
| A notation for lambda terms a generalization of environments G Nadathur, DS Wilson Theoretical Computer Science 198 (1-2), 49-98, 1998 | 78* | 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 | 69* | 1999 |
| 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 | 67 | 2008 |
| A two-level logic approach to reasoning about computations A Gacek, D Miller, G Nadathur Journal of Automated Reasoning 49 (2), 241-273, 2012 | 66 | 2012 |
| Nominal abstraction A Gacek, D Miller, G Nadathur Information and Computation 209 (1), 48-73, 2011 | 64 | 2011 |
| A proof procedure for the logic of hereditary Harrop formulas G Nadathur Journal of Automated Reasoning 11, 115-145, 1993 | 64 | 1993 |
Dale MillerDirector of Research, INRIAVerified email at inria.fr
