| Completeness and cut-elimination in the intuitionistic theory of types M DeMarco, J Lipton Journal of Logic and Computation 15 (6), 821-854, 2005 | 35 | 2005 |
| On the algebraic structure of declarative programming languages G Amato, J Lipton, R McGrail Theoretical Computer Science 410 (46), 4626-4671, 2009 | 34 | 2009 |
| Logic programming in tau categories SE Finkelstein, P Freyd, J Lipton Computer Science Logic: 8th Workshop, CSL'94 Kazimierz, Poland, September 25 …, 1995 | 32 | 1995 |
| A new framework for declarative programming SE Finkelstein, P Freyd, J Lipton Theoretical Computer Science 300 (1-3), 91-160, 2003 | 25 | 2003 |
| Hiord: A type-free higher-order logic programming language with predicate abstraction D Cabeza, M Hermenegildo, J Lipton Annual Asian Computing Science Conference, 93-108, 2004 | 22 | 2004 |
| Constructive Kripke semantics and realizability J Lipton Logic from Computer Science: Proceedings of a Workshop held November 13–17 …, 1992 | 18 | 1992 |
| Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels J Lipton, MJ O'Donnell Annals of Pure and Applied Logic 81 (1-3), 187-239, 1996 | 17 | 1996 |
| Combinatory Logic Programming: Computing in Relation Calculi. P Broome, J Lipton ILPS 94, 269-285, 1994 | 13 | 1994 |
| Higher-order logic programming languages with constraints: A semantics J Lipton, S Nieva International Conference on Typed Lambda Calculi and Applications, 272-289, 2007 | 12 | 2007 |
| Encapsulating data in logic programming via categorical constraints J Lipton, R McGrail International Conference on Algebraic and Logic Programming, 391-410, 1998 | 12 | 1998 |
| Realizability, set theory and term extraction J Lipton The Curry-Howard isomorphism, 257-364, 1995 | 10 | 1995 |
| Some notes on logic programming with a relational machine J Lipton, E Chapman Using Relational Methods in Computer Science, Technical Report, 1-34, 1998 | 8 | 1998 |
| Kripke semantics for dependent type theory and realizability interpretations J Lipton Symposium on Constructivity in Computer Science, 22-32, 1991 | 8 | 1991 |
| Logic programming in tabular allegories EJ Gallego Arias, J B Lipton Technical Communications of the 28th International Conference on Logic …, 2012 | 7 | 2012 |
| A constructive semantic approach to cut elimination in type theories with axioms O Hermant, J Lipton International Workshop on Computer Science Logic, 169-183, 2008 | 7 | 2008 |
| Indexed categories and bottom-up semantics of logic programs G Amato, J Lipton Logic for Programming, Artificial Intelligence, and Reasoning: 8th …, 2001 | 7 | 2001 |
| Constraint logic programming with a relational machine EJ Gallego Arias, J Lipton, J Mariño Formal Aspects of Computing 29, 97-124, 2017 | 6 | 2017 |
| First-order unification using variable-free relational algebra EJG Arias, J Lipton, J Mariño, P Nogueira Logic Journal of the IGPL 19 (6), 790-820, 2011 | 6 | 2011 |
| Kripke semantics for higher-order type theory applied to constraint logic programming languages J Lipton, S Nieva Theoretical Computer Science 712, 1-37, 2018 | 5 | 2018 |
| Completeness and Cut-elimination in the Intuitionistic Theory of Types-Part 2. O Hermant, J Lipton J. Log. Comput. 20 (2), 597-602, 2010 | 5 | 2010 |
Gallego Arias, Emilio JesúsStarting Reseacher, Inria, Université de Paris, IRIF, CNRS, F-75013 Paris, FranceVerified email at x80.org
