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 | 826 | 1991 |

Domain theory in logical form S Abramsky Annals of pure and applied logic 51 (1-2), 1-77, 1991 | 630 | 1991 |

An overview of λProlog D Miller, G Nadathur Proc. of the 5th Int. Conf. on Logic Programming, 1988 | 599* | 1988 |

Higher-order logic programming DA Miller, G Nadathur International Conference on Logic Programming, 448-462, 1986 | 249 | 1986 |

Programming with higher-order logic D Miller, G Nadathur Cambridge University Press, 2012 | 156 | 2012 |

A logic programming approach to manipulating formulas and programs D Miller, G Nadathur University of Pennsylvania. Moore School of Electrical Engineering …, 1987 | 153 | 1987 |

Higher-order logic programming G Nadathur, D Miller Handbook of logic in artificial intelligence and logic programming 5, 499-590, 1998 | 140 | 1998 |

Higher-order Horn clauses G Nadathur, D Miller Journal of the ACM (JACM) 37 (4), 777-814, 1990 | 126 | 1990 |

System description: Teyjus—A compiler and abstract machine based implementation of λProlog G Nadathur, DJ Mitchell International Conference on Automated Deduction, 287-291, 1999 | 102 | 1999 |

A higher-order logic as the basis for logic programming G Nadathur University of Pennsylvania, 1987 | 96 | 1987 |

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 | 91 | 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 | 81 | 1986 |

A notation for lambda terms a generalization of environments G Nadathur, DS Wilson Theoretical Computer Science 198 (1-2), 49-98, 1998 | 76* | 1998 |

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 | 72 | 2014 |

HEREDITARY HARROP FORMULAS AND UNIFORM PROOF SYSTEMS. D Miller, G Nadathur, A Scedrov Unknown Host Publication Title, 98-105, 1987 | 72 | 1987 |

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 |

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 | 62 | 2008 |

A representation of lambda terms suitable for operations on their intensions G Nadathur, DS Wilson Proceedings of the 1990 ACM conference on LISP and functional programming …, 1990 | 59 | 1990 |

A proof procedure for the logic of hereditary Harrop formulas G Nadathur Journal of Automated Reasoning 11 (1), 115-145, 1993 | 58 | 1993 |

A two-level logic approach to reasoning about computations A Gacek, D Miller, G Nadathur Journal of Automated Reasoning 49 (2), 241-273, 2012 | 56 | 2012 |