Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Gopalan Nadathur
2010 – today
- 2013
[c24]Yuting Wang, Kaustuv Chaudhuri, Andrew Gacek, Gopalan Nadathur: Reasoning about higher-order relational specifications. PPDP 2013: 157-168- [i15]Yuting Wang, Kaustuv Chaudhuri, Andrew Gacek, Gopalan Nadathur: Reasoning About Higher-Order Relational Specifications. CoRR abs/1302.2584 (2013)
- [i14]Yuting Wang, Gopalan Nadathur: Towards Extracting Explicit Proofs from Totality Checking in Twelf. CoRR abs/1307.1738 (2013)
- 2012
- [j17]Andrew Gacek, Dale Miller, Gopalan Nadathur: A Two-Level Logic Approach to Reasoning About Computations. J. Autom. Reasoning 49(2): 241-273 (2012)
- [c23]David Baelde, Gopalan Nadathur: Combining Deduction Modulo and Logics of Fixed-Point Definitions. LICS 2012: 105-114
- [i13]David Baelde, Gopalan Nadathur: Combining Deduction Modulo and Logics of Fixed-Point Definitions. CoRR abs/1204.6236 (2012)
- 2011
- [j16]
- [e2]Herman Geuvers, Gopalan Nadathur (Eds.): Proceedings Sixth International Workshop on Logical Frameworks and Meta-languages: Theory and Practice. EPTCS 71, 2011
- 2010
- [c22]Zachary Snow, David Baelde, Gopalan Nadathur: A meta-programming approach to realizing dependently typed logic programming. PPDP 2010: 187-198
- [i12]Zachary Snow, David Baelde, Gopalan Nadathur: A Meta-Programming Approach to Realizing Dependently Typed Logic Programming. CoRR abs/1005.4379 (2010)
- [i11]Zachary Snow, David Baelde, Gopalan Nadathur: Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search. CoRR abs/1007.0779 (2010)
2000 – 2009
- 2009
- [j15]Andrew Gacek, Dale Miller, Gopalan Nadathur: Reasoning in Abella about Structural Operational Semantics Specifications. Electr. Notes Theor. Comput. Sci. 228: 85-100 (2009)
- [i10]
- [i9]Andrew Gacek, Dale Miller, Gopalan Nadathur: A two-level logic approach to reasoning about computations. CoRR abs/0911.2993 (2009)
- 2008
- [c21]Andrew Gacek, Dale Miller, Gopalan Nadathur: Combining Generic Judgments with Recursive Definitions. LICS 2008: 33-44
- [i8]Andrew Gacek, Dale Miller, Gopalan Nadathur: Combining generic judgments with recursive definitions. CoRR abs/0802.0865 (2008)
- [i7]Andrew Gacek, Dale Miller, Gopalan Nadathur: Reasoning in Abella about Structural Operational Semantics Specifications. CoRR abs/0804.3914 (2008)
- 2007
- [c20]David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu: The Bedwyr System for Model Checking over Syntactic Expressions. CADE 2007: 391-397
- [i6]David Baelde, Andrew Gacek, Dale Miller, Gopalan Nadathur, Alwen Tiu: The Bedwyr system for model checking over syntactic expressions. CoRR abs/cs/0702116 (2007)
- [i5]Andrew Gacek, Gopalan Nadathur: A Simplified Suspension Calculus and its Relationship to Other Explicit Substitution Calculi. CoRR abs/cs/0702152 (2007)
- 2005
- [j14]Gopalan Nadathur: A treatment of higher-order features in logic programming. TPLP 5(3): 305-354 (2005)
- [c19]Radha Jagadeesan, Gopalan Nadathur, Vijay A. Saraswat: Testing Concurrent Systems: An Interpretation of Intuitionistic Logic. FSTTCS 2005: 517-528
- [c18]Gopalan Nadathur, Natalie Linnell: Practical Higher-Order Pattern Unification with On-the-Fly Raising. ICLP 2005: 371-386
- [c17]Gopalan Nadathur, Xiaochu Qi: Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages. LPAR 2005: 110-124
- 2004
- [j13]Chuck Liang, Gopalan Nadathur, Xiaochu Qi: Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts. J. Autom. Reasoning 33(2): 89-132 (2004)
- [i4]Gopalan Nadathur: A treatment of higher-order features in logic programming. CoRR cs.PL/0404020 (2004)
- 2003
- [c16]Gopalan Nadathur, Xiaochu Qi: Explicit substitutions in the reduction of lambda terms. PPDP 2003: 195-206
- 2002
- [j12]Gopalan Nadathur: The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations. Electr. Notes Theor. Comput. Sci. 67: 35-48 (2002)
- [c15]Chuck Liang, Gopalan Nadathur: Tradeoffs in the Intensional Representation of Lambda Terms. RTA 2002: 192-206
- 2001
- [c14]
- 2000
- [j11]Gopalan Nadathur: A framework for realizing derivation systems. ACM SIGSOFT Software Engineering Notes 25(1): 66-67 (2000)
- [j10]Gopalan Nadathur: Correspondences between classical, intuitionistic and uniform provability. Theor. Comput. Sci. 232(1-2): 273-298 (2000)
1990 – 1999
- 1999
- [j9]Gopalan Nadathur: A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations. Journal of Functional and Logic Programming 1999(2) (1999)
- [j8]Gopalan Nadathur, Guanshan Tong: Realizing Modularity in lambdaProlog. Journal of Functional and Logic Programming 1999(Special Issue 1) (1999)
- [c13]Gopalan Nadathur, Dustin J. Mitchell: System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog. CADE 1999: 287-291
- [e1]Gopalan Nadathur (Ed.): Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29 - October 1, 1999, Proceedings. Lecture Notes in Computer Science 1702, Springer 1999, ISBN 3-540-66540-4
- 1998
- [j7]
- [j6]Gopalan Nadathur, Debra Sue Wilson: A Notation for Lambda Terms: A Generalization of Environments. Theor. Comput. Sci. 198(1-2): 49-98 (1998)
- [i3]
- [i2]Gopalan Nadathur: Correspondences between Classical, Intuitionistic and Uniform Provability. CoRR cs.LO/9809015 (1998)
- [i1]Gopalan Nadathur, Bharat Jayaraman, Keehang Kwon: Scoping Constructs in Logic Programming: Implementation Problems and their Solution. CoRR cs.PL/9809016 (1998)
- 1995
- [j5]Gopalan Nadathur, Bharat Jayaraman, Keehang Kwon: Scoping Constructs in Logic Programming: Implementation Problems and their Solutions. J. Log. Program. 25(2): 119-161 (1995)
- [c12]Gopalan Nadathur, Donald W. Loveland: Uniform Proofs and Disjunctive Logic Programming (Extended Abstract). LICS 1995: 148-155
- 1994
- [j4]Keehang Kwon, Gopalan Nadathur, Debra Sue Wilson: Implementing Polymorphic Typing in a Logic Programming Language. Comput. Lang. 20(1): 25-42 (1994)
- 1993
- [j3]Gopalan Nadathur: A Proof Procedure for the Logic of Hereditary Harrop Formulas. J. Autom. Reasoning 11(1): 115-145 (1993)
- 1992
- [c11]Keehang Kwon, Gopalan Nadathur, Debra Sue Wilson: Implementing a Notion of Modules in the Logic Programming Language Lambda-Prolog. ELP 1992: 359-393
- [p1]Gopalan Nadathur, Frank Pfenning: The Type System of a Higher-Order Logic Programming Language. Types in Logic Programming 1992: 245-283
- 1991
- [j2]Dale Miller, Gopalan Nadathur, Frank Pfenning, Andre Scedrov: Uniform Proofs as a Foundation for Logic Programming. Ann. Pure Appl. Logic 51(1-2): 125-157 (1991)
- [c10]Bharat Jayaraman, Gopalan Nadathur: Implementation Techniques for Scoping Constructs in Logic Programming. ICLP 1991: 871-886
- 1990
- [j1]
- [c9]Gopalan Nadathur, Debra Sue Wilson: A Representation of Lambda Terms Suitable for Operations on Their Intensions. LISP and Functional Programming 1990: 341-348
1980 – 1989
- 1989
- [c8]
- 1988
- [c7]Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov: Lambda-Prolog: An Extended Logic Programming Language. CADE 1988: 754-755
- [c6]
- 1987
- [c5]Dale Miller, Gopalan Nadathur, Andre Scedrov: Hereditary Harrop Formulas and Uniform Proof Systems. LICS 1987: 98-105
- [c4]Dale Miller, Gopalan Nadathur: A Logic Programming Approach to Manipulating Formulas and Programs. SLP 1987: 379-388
- 1986
- [c3]Dale Miller, Gopalan Nadathur: Some Uses of Higher-Order Logic in Computational Linguistics. ACL 1986: 247-256
- [c2]
- 1983
- [c1]Gopalan Nadathur, Aravind K. Joshi: Mutual Beliefs in Conversational Systems: Their Role in Referring Expressions. IJCAI 1983: 603-605
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 10:58 CEST by the dblp team