No photo of Gopalan Nadathur

Gopalan Nadathur

1983 …2019

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2018

    Schematic polymorphism in the Abella proof assistant

    Nadathur, G. & Wang, Y., Sep 3 2018, Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, PPDP 2018. Association for Computing Machinery, 15. (ACM International Conference Proceeding Series).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  • 2016

    A higher-order abstract syntax approach to verified transformations on functional programs

    Wang, Y. & Nadathur, G., 2016, Programming Languages and Systems - 25th European Symposium on Programming, ESOP 2016, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2016, Proceedings. Thiemann, P. (ed.). Springer Verlag, p. 752-779 28 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9632).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations
  • 2013

    Reasoning about higher-order relational specifications

    Wang, Y., Chaudhuri, K., Gacek, A. & Nadathur, G., 2013, Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013. p. 157-168 12 p. (Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming, PPDP 2013).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    14 Scopus citations
  • Towards extracting explicit proofs from totality checking in twelf

    Wang, Y. & Nadathur, G., Oct 21 2013, LFMTP 2013 - Proceedings of the 2013 ACM SIGPLAN Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Co-located with ICFP 2013. p. 55-66 12 p. (Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • 2012

    Combining deduction modulo and logics of fixed-point definitions

    Baelde, D. & Nadathur, G., 2012, Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012. p. 105-114 10 p. 6280429. (Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • 2010

    A meta-programming approach to realizing dependently typed logic programming

    Snow, Z., Baelde, D. & Nadathur, G., 2010, PPDP'10 - Proceedings of the 2010 Symposium on Principles and Practice of Declarative Programming. p. 187-198 12 p. (PPDP'10 - Proceedings of the 2010 Symposium on Principles and Practice of Declarative Programming).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Scopus citations
  • 2008

    Combining generic judgments with recursive definitions

    Gacek, A., Miller, D. & Nadathur, G., 2008, Proceedings - 23rd Annual IEEE Symposium on Logic in Computer Science, LICS 2008. p. 33-44 12 p. 4557898. (Proceedings - Symposium on Logic in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    32 Scopus citations
  • 2007

    The Bedwyr system for model checking over syntactic expressions

    Baelde, D., Gacek, A., Miller, D., Nadathur, G. & Tiu, A., 2007, Automated Deduction - CADE-21 - 21st International Conference on Automated Deduction, Proceedings. Springer Verlag, p. 391-397 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4603 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    43 Scopus citations
  • 2005

    Testing concurrent systems: An interpretation of intuitionistic logic

    Jagadeesan, R., Nadathur, G. & Saraswat, V., 2005, FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science - 25th International Conference, Proceedings. p. 517-528 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3821 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    21 Scopus citations
  • 2003

    Explicit Substitutions in the Reduction of Lambda Terms

    Nadathur, G. & Qi, X., 2003, Proceedings of the Fifth ACM SIGPLAN Conference on Principle and Practice of Declarative Programming, (PPDP 03). Association for Computing Machinery, p. 195-206 12 p. (Proceedings of the ACM SIGPLAN Conference on Principles and Practice of Declarative Programming; vol. 5).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
  • 2002

    Tradeoffs in the intensional representation of lambda terms

    Liang, C. & Nadathur, G., 2002, Rewriting Techniques and Applications - 13th International Conference, RTA 2002, Proceedings. Tison, S. (ed.). Springer Verlag, p. 192-206 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2378).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    5 Scopus citations
  • 2001

    The metalanguage λprolog and its implementation

    Nadathur, G., 2001, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Kuchen, H. & Ueda, K. (eds.). Springer Verlag, p. 1-20 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2024).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Scopus citations
  • 1999

    System description: Teyjus—a compiler and abstract machine based implementation of λprolog

    Nadathur, G. & Mitchell, D. J., 1999, Automated Deduction — CADE-16 - 16th International Conference on Automated Deduction, Proceedings. Ganzinger, H. (ed.). Springer Verlag, p. 287-291 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 1632).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    55 Scopus citations
  • 1993

    Implementing a notion of modules in the logic programming language λProlog

    Kwon, K., Nadathur, G. & Wilson, D. S., 1993, Extensions of Logic Programming - 3rd International Workshop, ELP 1992, Proceedings. Lamina, E. & Mello, P. (eds.). Springer Verlag, p. 359-393 35 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 660 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations
  • 1991

    Implementation techniques for scoping constructs in logic programming

    Jayaraman, B. & Nadathur, G., Dec 1 1991, Logic Program Proc 8 Int Conf. Publ by MIT Press, p. 871-886 16 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    11 Scopus citations
  • 1990

    Representation of lambda terms suitable for operations on their intensions

    Nadathur, G. & Wilson, D. S., Dec 1 1990, Proc 1990 ACM Conf LISP Funct Program. Anon (ed.). Publ by ACM, p. 341-348 8 p. (Proc 1990 ACM Conf LISP Funct Program).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    15 Scopus citations
  • 1988

    λProlog: An extended logic programming language

    Felty, A., Gunter, E., Hannan, J., Miller, D., Nadathur, G. & Scedrov, A., Jan 1 1988, 9th International Conference on Automated Deduction, Proceedings. Lusk, E. & Overbeek, R. (eds.). Springer- Verlag, p. 754-755 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 310 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Scopus citations
  • 1987

    HEREDITARY HARROP FORMULAS AND UNIFORM PROOF SYSTEMS.

    Miller, D., Nadathur, G. & Scedrov, A., Jan 1 1987, Unknown Host Publication Title. IEEE, p. 98-105 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    16 Scopus citations
  • LOGIC PROGRAMMING APPROACH TO MANIPULATING FORMULAS AND PROGRAMS.

    Miller, D. & Nadathur, G., Dec 1 1987, Unknown Host Publication Title. IEEE, p. 379-388 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    53 Scopus citations
  • 1986

    Higher-order logic programming

    Miller, D. A. & Nadathur, G., 1986, 3rd International Conference on Logic Programming - Imperial College of Science and Technology, Proceedings. Shapiro, E. (ed.). Springer Verlag, p. 448-462 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 225 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    63 Scopus citations
  • 1983

    MUTUAL BELIEFS IN CONVERSATIONAL SYSTEMS: THEIR ROLE IN REFERRING EXPRESSIONS.

    Nadathur, G. & Joshi, A. K., 1983, Unknown Host Publication Title. Bundy, A. (ed.). p. 603-605 3 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    4 Scopus citations
Your message has successfully been sent.
Your message was not sent due to an error.