{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:46Z","timestamp":1759626646410,"version":"build-2065373602"},"reference-count":69,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0304-3975(01)00308-5","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"91-160","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["A new framework for declarative programming"],"prefix":"10.1016","volume":"300","author":[{"given":"Stacy E.","family":"Finkelstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Freyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Lipton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00308-5_BIB1","first-page":"19","article-title":"The s-semantics approach: theory and applications","author":"Levi","year":"1994","journal-title":"J. Logic Program."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB2","doi-asserted-by":"crossref","unstructured":"G. Amato, Sequent Calculus and Indexed Categories as Foundations for Logic Programming, Ph.D. Thesis, University of Pisa, 2000.","DOI":"10.1007\/3-540-45653-8_30"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB3","series-title":"Proc. 6th ICLP","first-page":"337","article-title":"Projections instead of variables, a category theoretic interpretation of logic programs","author":"Asperti","year":"1989"},{"issue":"1","key":"10.1016\/S0304-3975(01)00308-5_BIB4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/151646.151650","article-title":"A general framework for semantics based, bottom-up abstract interpretation of logic programs","volume":"15","author":"Barbuti","year":"1993","journal-title":"ACM Trans. Program. Languages Systems"},{"year":"1990","series-title":"Category Theory for Computing Science","author":"Barr","key":"10.1016\/S0304-3975(01)00308-5_BIB5"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB6","doi-asserted-by":"crossref","unstructured":"N. Benton, G. Bierman, V. de Paiva, J.M.E. Hyland, Term assignment for intuitionistic linear logic, in Proc. CSL \u201992, 1993.","DOI":"10.1007\/BFb0037099"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(01)00308-5_BIB7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(94)90200-3","article-title":"A compositional semantics for logic programs","volume":"122","author":"Bossi","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB8","unstructured":"J. Chirimar, Proof Theoretic Approach to Specification Languages, Ph.D. Thesis, University of Pennsylvania, 1995."},{"issue":"7","key":"10.1016\/S0304-3975(01)00308-5_BIB9","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/79204.79209","article-title":"Constraint Logic Programming","volume":"33","author":"Cohen","year":"1990","journal-title":"Commun. ACM"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB10","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1006\/inco.2000.3024","article-title":"A theory of observables in logic programming","volume":"169","author":"Comini","year":"2000","journal-title":"Inform Comput"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB11","doi-asserted-by":"crossref","unstructured":"A. Corradini, A. Asperti, A categorical model for logic programs: Indexed monoidal categories, In Proc. REX Workshop \u201992, Springer Lecture Notes in Computer Science, Springer, Berlin, 1992.","DOI":"10.1007\/3-540-56596-5_31"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB12","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(92)90087-V","article-title":"An algebraic semantics for structured transition systems and its application to logic programs","volume":"103","author":"Corradini","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"2\u20133","key":"10.1016\/S0304-3975(01)00308-5_BIB13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0743-1066(92)90030-7","article-title":"Abstract interpretation and application to logic programs","volume":"13","author":"Cousot","year":"1992","journal-title":"J. Logic Program."},{"year":"1993","series-title":"Categories for Types","author":"Crole","key":"10.1016\/S0304-3975(01)00308-5_BIB14"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB15","unstructured":"O. de Moor, Categories, Relations, and Dynamic Programming, Ph.D. Thesis, St. John's College, Oxford, 1991."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB16","unstructured":"M. DeMarco, Higher order logic programming in the theory of types, Ph.D. Thesis, Wesleyan University, 1999."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB17","unstructured":"M. DeMarco, J. Lipton, The semantics of higher order hereditary harrop logic programming, to appear."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB18","unstructured":"R. Diaconescu, Category semantics for equational and constraint logic programming, Ph.D. Thesis, Oxford University, 1994."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB19","doi-asserted-by":"crossref","unstructured":"S.E. Finkelstein, P. Freyd, J. Lipton, Logic programming in tau categories, in Computer Science Logic \u201994, Lecture Notes in Computer Science, vol. 933, Springer, Berlin, 1995.","DOI":"10.1007\/BFb0022261"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB20","first-page":"211","article-title":"Extensional PERs, Inform","volume":"98","author":"Freyd","year":"1992","journal-title":"Comput"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB21","unstructured":"P. Freyd, The logic of cartesian categories, to appear."},{"year":"1990","series-title":"Categories, Allegories","author":"Freyd","key":"10.1016\/S0304-3975(01)00308-5_BIB22"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB23","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0168-0072(93)90093-S","article-title":"On the unity of logic","volume":"59","author":"Girard","year":"1993","journal-title":"Ann. Pure Appl. Logic"},{"year":"1998","series-title":"Proofs and Types","author":"Girard","key":"10.1016\/S0304-3975(01)00308-5_BIB24"},{"issue":"2","key":"10.1016\/S0304-3975(01)00308-5_BIB25","article-title":"A uniform proof-theoretic investigation of linear logic programming","volume":"4","author":"Harland","year":"1994","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB26","doi-asserted-by":"crossref","unstructured":"C. Hermida, Fibrations, Logical Predicates and Indeterminates, Ph.D. Thesis, University of Edinburgh, 1993.","DOI":"10.7146\/dpb.v22i462.6935"},{"issue":"2","key":"10.1016\/S0304-3975(01)00308-5_BIB27","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1006\/inco.1994.1036","article-title":"Logic programming in a fragment of intuitionistic linear logic","volume":"110","author":"Hodas","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB28","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J.-L. Lassez, Constraint logic programming, in Proc. Symp. on Principles of Programming Languages, ACM, 1987.","DOI":"10.1145\/41625.41635"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB29","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","article-title":"Constraint logic programming: a survey","volume":"19\/20","author":"Jaffar","year":"1994","journal-title":"J. Logic Program."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB30","series-title":"Logic Programming. Proc. 1994 Internat. Symp.,","first-page":"17","article-title":"Abstract interpretation and partial evaluation in functional and logic programming","author":"Jones","year":"1994"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB31","unstructured":"T.K. Lakshman, U.S. Reddy, Typed Prolog: A semantic reconstruction of the Mycroft-O'Keefe type system, in: Proc. 1991 IEEE Symp. on Logic Programming, 1991, pp. 202\u2013220."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB32","unstructured":"J. Lambek, P.J. Scott, Introduction to Higher Order Categorical Logic, Cambridge, Cambridge Univ. Press, 1986."},{"year":"1992","series-title":"Sheaves in Geometry and Logic","author":"Mac Lane","key":"10.1016\/S0304-3975(01)00308-5_BIB33"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB34","unstructured":"J.L. Lassez, K. MacAloon, A constraint sequent calculus, in: Proc. 5th Symp. of LICS, 1990."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB35","series-title":"Proc. 5th Int. Symp. of Logic Programming","article-title":"Models, unfolding rules, and fixpoint semantics","author":"Levi","year":"1988"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB36","series-title":"Principles of Declarative Programming","article-title":"Encapsulating data in logic programming via categorical constraints","volume":"vol. 1490","author":"Lipton","year":"1998"},{"year":"1987","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/S0304-3975(01)00308-5_BIB37"},{"issue":"3","key":"10.1016\/S0304-3975(01)00308-5_BIB38","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative modeling of the operational behaviour of logic languages","volume":"69","author":"Martelli","year":"1989","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(01)00308-5_BIB39","first-page":"86","article-title":"A model-theoretic reconstruction of the operational semantics of logic programs","volume":"102","author":"Martelli","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB40","series-title":"First Order Categorical Logic","volume":"vol. 611","author":"Makkai","year":"1977"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB41","unstructured":"R. McGrail, Monads and control in logic programming, Ph.D. Thesis, Wesleyan University, 1997."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB42","unstructured":"Maria Chiara Meo, A framework for reasoning about the semantics of logic programs, Ph.D. Thesis, University of Pisa, 1996."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB43","doi-asserted-by":"crossref","unstructured":"D.Miller, A logical analysis of modules in logic programming. J. Logic Program, 1989, pp. 79\u2013108.","DOI":"10.1016\/0743-1066(89)90031-9"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB44","doi-asserted-by":"crossref","unstructured":"D. Miller, A multiple-conclusion meta-logic, in Proc. 1994 Symp. on Logics in Computer Science, 1994, pp. 272\u2013281.","DOI":"10.1109\/LICS.1994.316062"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB45","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","article-title":"A. Scedrov, Uniform proofs as a foundation for logic programming","volume":"51","author":"Miller","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB46","doi-asserted-by":"crossref","DOI":"10.1016\/0890-5401(91)90052-4","article-title":"Notions of computation and monads","volume":"93","author":"Moggi","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB47","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0743-1066(92)90024-W","article-title":"Logic programming with functiona and predicates: the language babel","volume":"12","author":"Moreno-Navarro","year":"1992","journal-title":"The J. Logic Program."},{"issue":"3","key":"10.1016\/S0304-3975(01)00308-5_BIB48","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","article-title":"A polymorphic type system for prolog","volume":"23","author":"Mycroft","year":"1984","journal-title":"Artif. Intell."},{"issue":"4","key":"10.1016\/S0304-3975(01)00308-5_BIB49","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/96559.96570","article-title":"Higher-order horn clauses","volume":"37","author":"Nadathur","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB50","unstructured":"G. Nadathur, D. Miller, Higher-order logic programming, in Handbook of Logics for Artificial Intelligence and Logic Programming, vol. 5, Oxford Univ. Press, Oxford, 1996."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB51","doi-asserted-by":"crossref","unstructured":"P.W. O'Hearn, R.D. Tennent, Parametricity and local variables. Technical report, Syracuse University, 1993.","DOI":"10.1145\/158511.158624"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB52","unstructured":"L. Ong, Non-determinism in functional programming, in Proc. 8th IEEE Symp. on Logic and Computer Science, 1993."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB53","series-title":"A hyperdoctrinal view of constraint systems","volume":"vol. 666","author":"Panangaden","year":"1993"},{"year":"1992","series-title":"Types in logic programming, Chapter, Dependent Types in Logic Programming","author":"Pfenning","key":"10.1016\/S0304-3975(01)00308-5_BIB54"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB55","series-title":"Category Theory and Computer Programming","volume":"vol. 240","author":"Pitt","year":"1985"},{"year":"1990","series-title":"Logical Foundations of Functional Programming, Chapter, On Functors Expressible in the Polymorphic Lambda Calculus","author":"Plotkin","key":"10.1016\/S0304-3975(01)00308-5_BIB56"},{"year":"1986","series-title":"Algebra categorically, Category Theory and Computer Programming","author":"Poign\u00e9","key":"10.1016\/S0304-3975(01)00308-5_BIB57"},{"year":"1996","series-title":"A new foundation for logic programming, Extensions of Logic Programming \u201996","author":"Power","key":"10.1016\/S0304-3975(01)00308-5_BIB58"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB59","unstructured":"D. Pym, Functorial kripke models of the \u03bb\u03c0-calculus, Lecture at Newton Institute Semantics Programme, Workshop on Category Theory and Logic Programming, Cambridge, September 1995."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB60","doi-asserted-by":"crossref","unstructured":"D.E. Rydeheard, R.M. Burstall, A categorical unification algorithm, in: Category Theory Comput. Program. LNCS, Vol. 240, 1985.","DOI":"10.1007\/3-540-17162-2_139"},{"issue":"1","key":"10.1016\/S0304-3975(01)00308-5_BIB61","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0167-6423(90)90056-J","article-title":"A functional theory of exceptions","volume":"14","author":"Spivey","year":"1990","journal-title":"Sci. Comput. Program."},{"year":"1992","series-title":"Semantics of Type Theory","author":"Streicher","key":"10.1016\/S0304-3975(01)00308-5_BIB62"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB63","doi-asserted-by":"crossref","DOI":"10.1006\/inco.1995.1048","article-title":"Negation and constraint logic programming","volume":"118","author":"Stuckey","year":"1995","journal-title":"Inform. Comput."},{"year":"1999","series-title":"Practical Foundations of Mathematics","author":"Taylor","key":"10.1016\/S0304-3975(01)00308-5_BIB64"},{"year":"1988","series-title":"Constructivism in Mathematics: An Introduction, vol. 2","author":"Troelstra","key":"10.1016\/S0304-3975(01)00308-5_BIB65"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB66","doi-asserted-by":"crossref","DOI":"10.1145\/321978.321991","article-title":"The semantics of predicate logic as a programming language","volume":"23","author":"van Emden","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00308-5_BIB67","doi-asserted-by":"crossref","DOI":"10.1017\/S0960129500001560","article-title":"Comprehending monads","volume":"2","author":"Wadler","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB68","unstructured":"P. Wadler, How to declare an imperative, in Proc. Int. Logic Programming Symp., MIT Press, Cambridge, MA, 1995."},{"key":"10.1016\/S0304-3975(01)00308-5_BIB69","doi-asserted-by":"crossref","unstructured":"G. Amato, J. Lipton, Indexed categories and bottom-up semantics of logic programming, in: Proc. LPAR \u201901, Lecture Notes in Artificial Intelligence, Vol. 2250, 2002.","DOI":"10.1007\/3-540-45653-8_30"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003085?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003085?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:44Z","timestamp":1759625564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":69,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0304397501003085"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00308-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A new framework for declarative programming","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(01)00308-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}