Gopalan Nadathur

According to our database1, Gopalan Nadathur authored at least 63 papers between 1983 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A Modular Approach to Metatheoretic Reasoning for Extensible Languages.
CoRR, 2023

Modularity and Separate Compilation in Logic Programming.
CoRR, 2023

2022
A Logic for Formalizing Properties of LF Specifications.
Proceedings of the PPDP 2022: 24th International Symposium on Principles and Practice of Declarative Programming, Tbilisi, Georgia, September 20, 2022

2021
About a Proof Pearl: A Purported Solution to a POPLMARK Challenge Problem that is Not One.
CoRR, 2021

On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms.
CoRR, 2021

Adelfa: A System for Reasoning about LF Specifications.
Proceedings of the Sixteenth Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, 2021

A Logic for Reasoning About LF Specifications.
CoRR, 2021

2019
A special issue on structural proof theory, automated reasoning and computation in celebration of Dale Miller's 60th birthday.
Math. Struct. Comput. Sci., 2019

2018
Towards a Logic for Reasoning About LF Specifications.
CoRR, 2018

Schematic Polymorphism in the Abella Proof Assistant.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

2016
A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs.
Proceedings of the Programming Languages and Systems, 2016

2015
Verified Transformations on Functional Programs Using the Higher-Order Abstract Syntax Approach.
CoRR, 2015

2014
Abella: A System for Reasoning about Relational Specifications.
J. Formaliz. Reason., 2014

A Lambda Prolog Based Animation of Twelf Specifications.
CoRR, 2014

A Framework for the Verified Transformation of Functional Programs.
Proceedings of the 2014 International Workshop on Logical Frameworks and Meta-languages: Theory and Practice, 2014

2013
Translating Specifications in a Dependently Typed Lambda Calculus into a Predicate Logic Form.
CoRR, 2013

Reasoning about higher-order relational specifications.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Towards extracting explicit proofs from totality checking in twelf.
Proceedings of the Eighth ACM SIGPLAN International Workshop on Logical Frameworks & Meta-languages: Theory & Practice, 2013

2012
A Two-Level Logic Approach to Reasoning About Computations.
J. Autom. Reason., 2012

Combining Deduction Modulo and Logics of Fixed-Point Definitions.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Programming with Higher-Order Logic.
Cambridge University Press, ISBN: 978-0-521-87940-8, 2012

2011
Nominal abstraction.
Inf. Comput., 2011

2010
Redundancies in Dependently Typed Lambda Calculi and Their Relevance to Proof Search
CoRR, 2010

A meta-programming approach to realizing dependently typed logic programming.
Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

2008
Reasoning in Abella about Structural Operational Semantics Specifications.
Proceedings of the International Workshop on Logical Frameworks and Metalanguages: Theory and Practice, 2008

Combining Generic Judgments with Recursive Definitions.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

2007
A Simplified Suspension Calculus and its Relationship to Other Explicit Substitution Calculi
CoRR, 2007

The Bedwyr System for Model Checking over Syntactic Expressions.
Proceedings of the Automated Deduction, 2007

2005
A treatment of higher-order features in logic programming.
Theory Pract. Log. Program., 2005

Optimizing the Runtime Processing of Types in Polymorphic Logic Programming Languages.
Proceedings of the Logic for Programming, 2005

Practical Higher-Order Pattern Unification with On-the-Fly Raising.
Proceedings of the Logic Programming, 21st International Conference, 2005

Testing Concurrent Systems: An Interpretation of Intuitionistic Logic.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004
Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts.
J. Autom. Reason., 2004

2003
Explicit substitutions in the reduction of lambda terms.
Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

2002
The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations.
Proceedings of the 9th Workhop on Logic, Language, Information and Computation, 2002

Tradeoffs in the Intensional Representation of Lambda Terms.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001
The Metalanguage lambda-Prolog and Its Implementation.
Proceedings of the Functional and Logic Programming, 5th International Symposium, 2001

2000
Correspondences between classical, intuitionistic and uniform provability.
Theor. Comput. Sci., 2000

A framework for realizing derivation systems.
ACM SIGSOFT Softw. Eng. Notes, 2000

1999
Realizing Modularity in lambdaProlog.
J. Funct. Log. Program., 1999

A Fine-Grained Notation for Lambda Terms and Its Use in Intensional Operations.
J. Funct. Log. Program., 1999

System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog.
Proceedings of the Automated Deduction, 1999

1998
A Notation for Lambda Terms: A Generalization of Environments.
Theor. Comput. Sci., 1998

Uniform Provability in Classical Logic.
J. Log. Comput., 1998

Scoping Constructs in Logic Programming: Implementation Problems and their Solution
CoRR, 1998

1995
Scoping Constructs in Logic Programming: Implementation Problems and their Solutions.
J. Log. Program., 1995

Uniform Proofs and Disjunctive Logic Programming (Extended Abstract)
Proceedings of the Proceedings, 1995

1994
Implementing Polymorphic Typing in a Logic Programming Language.
Comput. Lang., 1994

1993
A Proof Procedure for the Logic of Hereditary Harrop Formulas.
J. Autom. Reason., 1993

1992
Implementing a Notion of Modules in the Logic Programming Language Lambda-Prolog.
Proceedings of the Extensions of Logic Programming, Third International Workshop, 1992

The Type System of a Higher-Order Logic Programming Language.
Proceedings of the Types in Logic Programming., 1992

1991
Uniform Proofs as a Foundation for Logic Programming.
Ann. Pure Appl. Log., 1991

Implementation Techniques for Scoping Constructs in Logic Programming.
Proceedings of the Logic Programming, 1991

1990
Higher-Order Horn Clauses
J. ACM, October, 1990

A Representation of Lambda Terms Suitable for Operations on Their Intensions.
Proceedings of the 1990 ACM Conference on LISP and Functional Programming, 1990

1989
Towards a WAM Model for Lambda-Prolog.
Proceedings of the Logic Programming, 1989

1988
An Overview of Lambda-PROLOG.
Proceedings of the Logic Programming, 1988

Lambda-Prolog: An Extended Logic Programming Language.
Proceedings of the 9th International Conference on Automated Deduction, 1988

1987
A Logic Programming Approach to Manipulating Formulas and Programs.
Proceedings of the 1987 Symposium on Logic Programming, San Francisco, California, USA, August 31, 1987

Hereditary Harrop Formulas and Uniform Proof Systems
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986
Higher-Order Logic Programming.
Proceedings of the Third International Conference on Logic Programming, 1986

Some Uses of Higher-Order Logic in Computational Linguistics.
Proceedings of the 24th Annual Meeting of the Association for Computational Linguistics, 1986

1983
Mutual Beliefs in Conversational Systems: Their Role in Referring Expressions.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983


  Loading...