BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Croatia
1 × Denmark
1 × Germany
1 × Italy
1 × Japan
1 × Sweden
1 × United Kingdom
2 × France
2 × Spain
7 × USA
Collaborated with:
D.Miller Y.Wang D.Baelde B.Jayaraman A.Gacek N.Linnell X.Qi C.Liang ∅ D.J.Mitchell D.W.Loveland D.S.Wilson A.Scedrov Z.Snow K.Chaudhuri A.Tiu A.P.Felty E.L.Gunter J.Hannan
Talks about:
program (9) logic (7) prolog (5) higher (4) order (4) implement (3) approach (3) system (3) proof (3) term (3)

Person: Gopalan Nadathur

DBLP DBLP: Nadathur:Gopalan

Facilitated 1 volumes:

PPDP 1999Ed

Contributed to:

PPDP 20132013
LICS 20122012
PPDP 20102010
LICS 20082008
CADE 20072007
ICLP 20052005
PPDP 20032003
RTA 20022002
FLOPS 20012001
CADE 19991999
LICS 19951995
ICLP 19911991
LFP 19901990
NACLP 19891989
CADE 19881988
ICLP/SPL 19881988
LICS 19871987
SLP 19871987
ICLP 19861986
ESOP 20162016
PPDP 20182018

Wrote 21 papers:

PPDP-2013-WangCGN #higher-order #reasoning #relational #specification
Reasoning about higher-order relational specifications (YW, KC, AG, GN), pp. 157–168.
LICS-2012-BaeldeN #deduction #fixpoint #logic
Combining Deduction Modulo and Logics of Fixed-Point Definitions (DB, GN), pp. 105–114.
PPDP-2010-SnowBN #approach #logic programming #metaprogramming
A meta-programming approach to realizing dependently typed logic programming (ZS, DB, GN), pp. 187–198.
LICS-2008-GacekMN #recursion
Combining Generic Judgments with Recursive Definitions (AG, DM, GN), pp. 33–44.
CADE-2007-BaeldeGMNT #model checking
The Bedwyr System for Model Checking over Syntactic Expressions (DB, AG, DM, GN, AT), pp. 391–397.
ICLP-2005-NadathurL #higher-order #on the fly #unification
Practical Higher-Order Pattern Unification with On-the-Fly Raising (GN, NL), pp. 371–386.
PPDP-2003-NadathurQ #reduction
Explicit substitutions in the reduction of λ terms (GN, XQ), pp. 195–206.
RTA-2002-LiangN #representation #trade-off
Tradeoffs in the Intensional Representation of λ Terms (CL, GN), pp. 192–206.
FLOPS-2001-Nadathur #implementation #metalanguage #prolog
The Metalanguage λ-Prolog and Its Implementation (GN), pp. 1–20.
CADE-1999-NadathurM #automaton #compilation #implementation #prolog #λ-calculus
System Description: Teyjus — A Compiler and Abstract Machine Based Implementation of lambda-Prolog (GN, DJM), pp. 287–291.
LICS-1995-NadathurL #logic programming #proving
Uniform Proofs and Disjunctive Logic Programming (GN, DWL), pp. 148–155.
ICLP-1991-JayaramanN #implementation #logic programming
Implementation Techniques for Scoping Constructs in Logic Programming (BJ, GN), pp. 871–886.
LFP-1990-NadathurW #representation
A Representation of λ Terms Suitable for Operations on Their Intensions (GN, DSW), pp. 341–348.
NACLP-1989-NadathurJ #prolog #towards
Towards a WAM Model for λ-Prolog (GN, BJ), pp. 1180–1198.
CADE-1988-FeltyGHMNS #logic programming #named #programming language #prolog #λ-calculus
Lambda-Prolog: An Extended Logic Programming Language (APF, ELG, JH, DM, GN, AS), pp. 754–755.
JICSCP-1988-NadathurM88 #overview #prolog
An Overview of λ-PROLOG (GN, DM), pp. 810–827.
LICS-1987-MillerNS #proving
Hereditary Harrop Formulas and Uniform Proof Systems (DM, GN, AS), pp. 98–105.
SLP-1987-MillerN87 #approach #logic programming #source code
A Logic Programming Approach to Manipulating Formulas and Programs (DM, GN), pp. 379–388.
ICLP-1986-MillerN86 #higher-order #logic programming
Higher-Order Logic Programming (DM, GN), pp. 448–462.
ESOP-2016-WangN #approach #functional #higher-order #source code #syntax
A Higher-Order Abstract Syntax Approach to Verified Transformations on Functional Programs (YW, GN), pp. 752–779.
PPDP-2018-NadathurW #morphism #polymorphism #proving
Schematic Polymorphism in the Abella Proof Assistant (GN, YW), p. 13.
Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.