James Lipton

According to our database1, James Lipton authored at least 23 papers between 1991 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Uniform Algebras: Models and constructive Completeness for Full, Simply Typed λProlog.
CoRR, 2024

2018
Kripke semantics for higher-order type theory applied to constraint logic programming languages.
Theor. Comput. Sci., 2018

2017
Constraint logic programming with a relational machine.
Formal Aspects Comput., 2017

2014
Declarative Compilation for Constraint Logic Programming.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2014

2012
Logic Programming in Tabular Allegories.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

2011
First-order unification using variable-free relational algebra.
Log. J. IGPL, 2011

2010
Completeness and Cut-elimination in the Intuitionistic Theory of Types - Part 2.
J. Log. Comput., 2010

2009
On the algebraic structure of declarative programming languages.
Theor. Comput. Sci., 2009

2008
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms.
Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007
Higher-Order Logic Programming Languages with Constraints: A Semantics.
Proceedings of the Typed Lambda Calculi and Applications, 8th International Conference, 2007

2005
Completeness and Cut-elimination in the Intuitionistic Theory of Types.
J. Log. Comput., 2005

2004
Erratum to: "A new framework for declarative programming": [Theoret. Comput. Sci. 300 (2003) 91-160].
Theor. Comput. Sci., 2004

Hiord: A Type-Free Higher-Order Logic Programming Language with Predicate Abstraction.
Proceedings of the Advances in Computer Science, 2004

2003
A new framework for declarative programming.
Theor. Comput. Sci., 2003

2001
Indexed Categories and Bottom-Up Semantics of Logic Programs.
Proceedings of the Logic for Programming, 2001

1998
Encapsulating Data in Logic Programming via Categorial Constraints.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

1996
Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels.
Ann. Pure Appl. Log., 1996

A New Framework for Declarative Programming: Categorial Perspectives.
Proceedings of the Extensions of Logic Programming, 5th International Workshop, 1996

1994
Combinatory Logic Programming: Computing in Relation Calculi.
Proceedings of the Logic Programming, 1994

Intuitive Counterexamples for Constructive Fallacies.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Logic Programming in Tau Categories.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1991
Provability in TBLL: A Decision Procedure.
Proceedings of the Computer Science Logic, 5th Workshop, 1991

Kripke Semantics for Dependent Type Theory and Realizability Interpretations.
Proceedings of the Constructivity in Computer Science, 1991


  Loading...