Kripke Semantics for Dependent Type Theory and Realizability Interpretations. - James Lipton (Constructivity in Computer Science, 1991)

Provability in TBLL: A Decision Procedure. - Jawahar Chirimar; James Lipton (CSL, 1991)

Logic Programming in Tau Categories. - Stacy E. Finkelstein; Peter J. Freyd; James Lipton (CSL, 1994)

Intuitive Counterexamples for Constructive Fallacies. - James Lipton; Michael J. O'Donnell (MFCS, 1994)

Combinatory Logic Programming: Computing in Relation Calculi. - Paul Broome; James Lipton (ILPS, 1994)

A New Framework for Declarative Programming: Categorial Perspectives. - James Lipton; Stacy E. Finkelstein; Peter J. Freyd (ELP, 1996)

Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels. - James Lipton; Michael J. O'Donnell (Ann. Pure Appl. Log., 1996)

Encapsulating Data in Logic Programming via Categorial Constraints. - James Lipton; Robert W. McGrail (PLILP/ALP, 1998)

Indexed Categories and Bottom-Up Semantics of Logic Programs. - Gianluca Amato; James Lipton (LPAR, 2001)

A new framework for declarative programming. - Stacy E. Finkelstein; Peter J. Freyd; James Lipton (Theor. Comput. Sci., 2003)

Hiord: A Type-Free Higher-Order Logic Programming Language with Predicate Abstraction. - Daniel Cabeza; Manuel V. Hermenegildo; James Lipton (ASIAN, 2004)

Erratum to: "A new framework for declarative programming": [Theoret. Comput. Sci. 300 (2003) 91-160]. - Stacy E. Finkelstein; Peter J. Freyd; James Lipton (Theor. Comput. Sci., 2004)

Completeness and Cut-elimination in the Intuitionistic Theory of Types. - Mary DeMarco; James Lipton (J. Log. Comput., 2005)

Higher-Order Logic Programming Languages with Constraints: A Semantics. - James Lipton; Susana Nieva (TLCA, 2007)

A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms. - Olivier Hermant; James Lipton (CSL, 2008)

On the algebraic structure of declarative programming languages. - Gianluca Amato; James Lipton; Robert W. McGrail (Theor. Comput. Sci., 2009)

Completeness and Cut-elimination in the Intuitionistic Theory of Types - Part 2. - Olivier Hermant; James Lipton (J. Log. Comput., 2010)

First-order unification using variable-free relational algebra. - Emilio Jesús Gallego Arias; James Lipton; Julio Mariño; Pablo Nogueira (Log. J. IGPL, 2011)

Logic Programming in Tabular Allegories. - Emilio Jesús Gallego Arias; James Lipton (ICLP (Technical Communications), 2012)

Declarative Compilation for Constraint Logic Programming. - Emilio Jesús Gallego Arias; James Lipton; Julio Mariño-Carballo (LOPSTR, 2014)

Constraint logic programming with a relational machine. - Emilio Jesús Gallego Arias; James Lipton; Julio Mariño (Formal Aspects Comput., 2017)

Kripke semantics for higher-order type theory applied to constraint logic programming languages. - James Lipton; Susana Nieva (Theor. Comput. Sci., 2018)

Uniform Algebras: Models and constructive Completeness for Full, Simply Typed λProlog. - Gianluca Amato; Mary DeMarco; James Lipton (CoRR, 2024)