Search the dblp DataBase
Gopalan Nadathur :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Dale Miller , Gopalan Nadathur Higher-Order Logic Programming. [Citation Graph (2, 0)][DBLP ] ICLP, 1986, pp:448-462 [Conf ] Dale Miller , Gopalan Nadathur , Frank Pfenning , Andre Scedrov Uniform Proofs as a Foundation for Logic Programming. [Citation Graph (1, 0)][DBLP ] Ann. Pure Appl. Logic, 1991, v:51, n:1-2, pp:125-157 [Journal ] Gopalan Nadathur , Dale Miller Higher-Order Horn Clauses [Citation Graph (1, 0)][DBLP ] J. ACM, 1990, v:37, n:4, pp:777-814 [Journal ] Amy P. Felty , Elsa L. Gunter , John Hannan , Dale Miller , Gopalan Nadathur , Andre Scedrov Lambda-Prolog: An Extended Logic Programming Language. [Citation Graph (0, 0)][DBLP ] CADE, 1988, pp:754-755 [Conf ] Gopalan Nadathur , Dustin J. Mitchell System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:287-291 [Conf ] Keehang Kwon , Gopalan Nadathur , Debra Sue Wilson Implementing a Notion of Modules in the Logic Programming Language Lambda-Prolog. [Citation Graph (0, 0)][DBLP ] ELP, 1992, pp:359-393 [Conf ] Gopalan Nadathur The Metalanguage lambda-Prolog and Its Implementation. [Citation Graph (0, 0)][DBLP ] FLOPS, 2001, pp:1-20 [Conf ] Radha Jagadeesan , Gopalan Nadathur , Vijay A. Saraswat Testing Concurrent Systems: An Interpretation of Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] FSTTCS, 2005, pp:517-528 [Conf ] Bharat Jayaraman , Gopalan Nadathur Implementation Techniques for Scoping Constructs in Logic Programming. [Citation Graph (0, 0)][DBLP ] ICLP, 1991, pp:871-886 [Conf ] Gopalan Nadathur , Natalie Linnell Practical Higher-Order Pattern Unification with On-the-Fly Raising. [Citation Graph (0, 0)][DBLP ] ICLP, 2005, pp:371-386 [Conf ] Gopalan Nadathur , Dale Miller An Overview of Lambda-PROLOG. [Citation Graph (0, 0)][DBLP ] ICLP/SLP, 1988, pp:810-827 [Conf ] Gopalan Nadathur , Aravind K. Joshi Mutual Beliefs in Conversational Systems: Their Role in Referring Expressions. [Citation Graph (0, 0)][DBLP ] IJCAI, 1983, pp:603-605 [Conf ] Gopalan Nadathur , Debra Sue Wilson A Representation of Lambda Terms Suitable for Operations on Their Intensions. [Citation Graph (0, 0)][DBLP ] LISP and Functional Programming, 1990, pp:341-348 [Conf ] Dale Miller , Gopalan Nadathur , Andre Scedrov Hereditary Harrop Formulas and Uniform Proof Systems [Citation Graph (0, 0)][DBLP ] LICS, 1987, pp:98-105 [Conf ] Gopalan Nadathur , Donald W. Loveland Uniform Proofs and Disjunctive Logic Programming (Extended Abstract) [Citation Graph (0, 0)][DBLP ] LICS, 1995, pp:148-155 [Conf ] Gopalan Nadathur , Xiaochu Qi Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages. [Citation Graph (0, 0)][DBLP ] LPAR, 2005, pp:110-124 [Conf ] Gopalan Nadathur , Xiaochu Qi Explicit substitutions in the reduction of lambda terms. [Citation Graph (0, 0)][DBLP ] PPDP, 2003, pp:195-206 [Conf ] Chuck Liang , Gopalan Nadathur Tradeoffs in the Intensional Representation of Lambda Terms. [Citation Graph (0, 0)][DBLP ] RTA, 2002, pp:192-206 [Conf ] Dale Miller , Gopalan Nadathur A Logic Programming Approach to Manipulating Formulas and Programs. [Citation Graph (0, 0)][DBLP ] SLP, 1987, pp:379-388 [Conf ] Gopalan Nadathur , Bharat Jayaraman Towards a WAM Model for Lambda-Prolog. [Citation Graph (0, 0)][DBLP ] NACLP, 1989, pp:1180-1198 [Conf ] Keehang Kwon , Gopalan Nadathur , Debra Sue Wilson Implementing Polymorphic Typing in a Logic Programming Language. [Citation Graph (0, 0)][DBLP ] Comput. Lang., 1994, v:20, n:1, pp:25-42 [Journal ] Gopalan Nadathur Uniform Provability in Classical Logic [Citation Graph (0, 0)][DBLP ] CoRR, 1998, v:0, n:, pp:- [Journal ] Gopalan Nadathur Correspondences between Classical, Intuitionistic and Uniform Provability [Citation Graph (0, 0)][DBLP ] CoRR, 1998, v:0, n:, pp:- [Journal ] Gopalan Nadathur A treatment of higher-order features in logic programming [Citation Graph (0, 0)][DBLP ] CoRR, 2004, v:0, n:, pp:- [Journal ] Gopalan Nadathur , Bharat Jayaraman , Keehang Kwon Scoping Constructs in Logic Programming: Implementation Problems and their Solution [Citation Graph (0, 0)][DBLP ] CoRR, 1998, v:0, n:, pp:- [Journal ] Gopalan Nadathur The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2002, v:67, n:, pp:- [Journal ] Chuck Liang , Gopalan Nadathur , Xiaochu Qi Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 2004, v:33, n:2, pp:89-132 [Journal ] Gopalan Nadathur A Proof Procedure for the Logic of Hereditary Harrop Formulas. [Citation Graph (0, 0)][DBLP ] J. Autom. Reasoning, 1993, v:11, n:1, pp:115-145 [Journal ] Gopalan Nadathur A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations. [Citation Graph (0, 0)][DBLP ] Journal of Functional and Logic Programming, 1999, v:1999, n:2, pp:- [Journal ] Gopalan Nadathur , Guanshan Tong Realizing Modularity in lambdaProlog. [Citation Graph (0, 0)][DBLP ] Journal of Functional and Logic Programming, 1999, v:1999, n:Special Issue 1, pp:- [Journal ] Gopalan Nadathur , Bharat Jayaraman , Keehang Kwon Scoping Constructs in Logic Programming: Implementation Problems and their Solutions. [Citation Graph (0, 0)][DBLP ] J. Log. Program., 1995, v:25, n:2, pp:119-161 [Journal ] Gopalan Nadathur Uniform Provability in Classical Logic. [Citation Graph (0, 0)][DBLP ] J. Log. Comput., 1998, v:8, n:2, pp:209-229 [Journal ] Gopalan Nadathur Correspondences between classical, intuitionistic and uniform provability. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:232, n:1-2, pp:273-298 [Journal ] Gopalan Nadathur , Debra Sue Wilson A Notation for Lambda Terms: A Generalization of Environments. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1998, v:198, n:1-2, pp:49-98 [Journal ] Gopalan Nadathur A treatment of higher-order features in logic programming. [Citation Graph (0, 0)][DBLP ] TPLP, 2005, v:5, n:3, pp:305-354 [Journal ] David Baelde , Andrew Gacek , Dale Miller , Gopalan Nadathur , Alwen Tiu The Bedwyr System for Model Checking over Syntactic Expressions. [Citation Graph (0, 0)][DBLP ] CADE, 2007, pp:391-397 [Conf ] David Baelde , Andrew Gacek , Dale Miller , Gopalan Nadathur , Alwen Tiu The Bedwyr system for model checking over syntactic expressions [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Andrew Gacek , Gopalan Nadathur A Simplified Suspension Calculus and its Relationship to Other Explicit Substitution Calculi [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Combining Generic Judgments with Recursive Definitions. [Citation Graph (, )][DBLP ] A meta-programming approach to realizing dependently typed logic programming. [Citation Graph (, )][DBLP ] Combining generic judgments with recursive definitions [Citation Graph (, )][DBLP ] Reasoning in Abella about Structural Operational Semantics Specifications [Citation Graph (, )][DBLP ] Nominal Abstraction [Citation Graph (, )][DBLP ] A two-level logic approach to reasoning about computations [Citation Graph (, )][DBLP ] A Meta-Programming Approach to Realizing Dependently Typed Logic Programming [Citation Graph (, )][DBLP ] Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search [Citation Graph (, )][DBLP ] Reasoning in Abella about Structural Operational Semantics Specifications. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.305secs