Nadathur, Gopalan - Department of Computer Science and Engineering, University of Minnesota

• A Treatment of Higher-Order Features in Logic Programming
• Proof Procedures for Logic Programming Donald W. Loveland and Gopalan Nadathur
• System Description: Teyjus|A Compiler and Abstract Machine
• An Explicit Substitution Notation in a Prolog Implementation
• Optimizing the Runtime Processing of Types in a Higher-Order Logic Programming Language
• Teyjus: A Prolog Implementation Gopalan Nadathur
• A Proof Procedure for the Logic of Hereditary Harrop Formulas
• Explicit Substitutions in the Reduction of Lambda Terms Gopalan Nadathur
• Combining generic judgments with recursive definitions Andrew Gacek
• Implementing a Notion of Modules in the Logic Programming Language Prolog
• Optimizing the Runtime Processing of Types in a Higher-Order Logic Programming Language
• Scoping Constructs in Logic Programming: Implementation Problems and their Solution
• Uniform Proofs and Disjunctive Logic Programming (Extended Abstract) y
• The Journal of Functional and Logic Programming
• Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
• Testing concurrent systems: An interpretation of intuitionistic logic
• Mixing Finite Success and Finite Failure in an Automated Prover
• A Simplified Suspension Calculus and its Relationship to Other Explicit Substitution Calculi
• A Notation for Lambda Terms: A Generalization of Environments *
• Practical Higher-Order Pattern Unification With On-the-Fly Raising
• CS-1993-24 Implementing Polymorphic Typing in a
• Implementing Polymorphic Typing in a Logic Programming Language
• HigherOrder Logic Programming Gopalan Nadathur
• Electronic Notes in Theoretical Computer Science 67 (2003) URL: http://www.elsevier.nl/locate/entcs/volume67.html 13 pages
• Reasoning in Abella about Structural Operational Semantics Specifications
• Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
• CS-1992-17 A Proof Procedure for the Logic of
• CS-1994-19 Proof Procedures for Logic Programming
• A Notation for Lambda Terms: A Generalization of Environments*
• Draft: Not for distribution An Approach to Modularity and Separate
• Explicit Substitutions in the Reduction of Lambda Terms Gopalan Nadathur
• Practical HigherOrder Pattern Unification With OntheFly Raising
• The Metalanguage Prolog and Its Implementation
• CS-1994-35 Scoping Constructs in Logic Programming
• Uniform Proofs and Disjunctive Logic Programming (Extended Abstract)y
• CS-1994-38 Higher-Order Logic Programming
• CS-1993-18 Implementing a Notion of Modules in the