{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:30Z","timestamp":1725664290070},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591559"},{"type":"electronic","value":"9783540492009"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59155-9_12","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:03:45Z","timestamp":1330257825000},"page":"209-230","source":"Crossref","is-referenced-by-count":0,"title":["Imagining CLP(\u039b,\u2261\u03b1\u03b2)"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Ridoux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"12_CR1","unstructured":"H. Andreka and I. Nemeti. The Generalised Completeness of Horn Predicate-Logic as a Programming Language. DAI Research Report 21, University of Edinburgh, 1976."},{"issue":"2","key":"12_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0956796800020025","volume":"1","author":"H. Barendregt","year":"1991","unstructured":"H. Barendregt. Introduction to generalized type systems. J. Functional Programming, 1(2):125\u2013154, 1991.","journal-title":"J. Functional Programming"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"H. Barendregt and K. Hemerik. Types in lambda calculi and programming languages. In N. Jones, editor, European Symp. on Programming, LNCS 432, pages 1\u201335, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52592-0_53"},{"key":"12_CR4","unstructured":"C. Belleann\u00e9e. Vers un d\u00e9monstrateur de th\u00e9or\u00e8mes adaptatif. Th\u00e8se, Universit\u00e9 de Rennes I, 1991."},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(85)90135-5","volume":"39","author":"C. B\u00f6hm","year":"1985","unstructured":"C. B\u00f6hm and A. Berarducci. Automatic synthesis of typed \u03bb-programs on term algebras. Theoretical Computer Science, 39:135\u2013154, 1985.","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","unstructured":"P. Brisset and O. Ridoux. The architecture of an implementation of \u03bbProlog: Prolog\/Mali. In Workshop on \u03bbProlog, Philadelphia, PA, USA, 1992. ftp: \/\/ftp.irisa.fr\/local\/lande."},{"key":"12_CR7","unstructured":"P. Brisset and O. Ridoux. The Compilation of \u03bbProlog and its execution with MALI. Technical Report 687, IRISA, 1992. ftp: \/\/ftp.irisa.fr\/local\/lande."},{"key":"12_CR8","unstructured":"P. Brisset and O. Ridoux. Continuations in \u03bbProlog. In D.S. Warren, editor, 10th Int. Conf. Logic Programming, pages 27\u201343, MIT Press, 1993."},{"key":"12_CR9","unstructured":"P. Brisset and O. Ridoux. Na\u00efve reverse can be linear. In K. Furukawa, editor, 8th Int. Conf. Logic Programming, pages 857\u2013870, MIT Press, 1991."},{"issue":"7","key":"12_CR10","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/79204.79209","volume":"33","author":"J. Cohen","year":"1990","unstructured":"J. Cohen. Constraint logic programming languages. CACM, 33(7):52\u201368, 1990.","journal-title":"CACM"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"A. Colmerauer. An introduction to Prolog III. CACM, 33(7), 1990.","DOI":"10.1145\/79204.79210"},{"key":"12_CR12","unstructured":"S. Coupet-Grimal. Repr\u00e9sentation s\u00e9mantique dans le traitement des langues naturelles en Prolog. In Journ\u00e9es Francophones sur la Programmation en Logique, pages 69-91, Teknea, N\u00eemes, France, 1993."},{"key":"12_CR13","unstructured":"H.B. Curry and R. Feys. Combinatory Logic, Volume I. North-Holland, Amsterdam, 1968."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"M. Dalrymple, S.M. Shieber, and F.C.N. Pereira. Ellipsis and higher-order unification. In Linguistics and Philosophy, pages 399\u2013452, 1991.","DOI":"10.1007\/BF00630923"},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","volume":"34","author":"N.G. Bruijn de","year":"1972","unstructured":"N.G. de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagationes Mathematicae, 34:381\u2013392, 1972.","journal-title":"Indagationes Mathematicae"},{"key":"12_CR16","unstructured":"C.M. Elliott. Extensions and Applications of Higher-Order Unification. Research Report CMU-CS-90-134, School of Computer Science, Carnegie Mellon University, 1990."},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"C.M. Elliott. Higher-order unification with dependent function types. In N. Derschowitz, editor, 3rd Int. Conf. Rewriting Techniques and Applications, LNCS 355, pages 121\u2013136, Springer-Verlag, 1989.","DOI":"10.1007\/3-540-51081-8_104"},{"key":"12_CR18","unstructured":"C.M. Elliott and F. Pfenning. A semi-functional implementation of a higher-order logic programming language. In P. Lee, editor, Topics in Advanced Language Implementation, pages 289\u2013325, MIT Press, 1991."},{"issue":"1","key":"12_CR19","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF00881900","volume":"11","author":"A. Felty","year":"1993","unstructured":"A. Felty. Implementing tactics and tacticals in a higher-order logic programming language. J. Automated Reasoning, 11(1):43\u201381, 1993.","journal-title":"J. Automated Reasoning"},{"issue":"2","key":"12_CR20","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1017\/S0960129500001559","volume":"4","author":"J. Hannan","year":"1992","unstructured":"J. Hannan and D. Miller. From operational semantics to abstract machines. Mathematical Structures in Computer Science, 4(2):415\u2013459, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"12_CR21","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0304-3975(90)90107-S","volume":"89","author":"M. Hanus","year":"1991","unstructured":"M. Hanus. Horn clause programs with polymorphic types: semantics and resolution. Theoretical Computer Science, 89:63\u2013106, 1991.","journal-title":"Theoretical Computer Science"},{"key":"12_CR22","unstructured":"P.M. Hill and J.W. LLoyd. The G\u00f6del Report. Technical Report TR-91-02, University of Bristol, 1991."},{"key":"12_CR23","first-page":"479","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"W.A. Howard","year":"1980","unstructured":"W.A. Howard. The formulae-as-types notion of construction. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 479\u2013490, Academic Press, London, 1980."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"G. Huet. Introduction au \u03bb-calcul typ\u00e9. INRIA, Collection Didactique, 1991.","DOI":"10.1007\/978-3-642-76799-9_4"},{"key":"12_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"G. Huet. A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science, 1:27\u201357, 1975.","journal-title":"Theoretical Computer Science"},{"key":"12_CR26","unstructured":"S. Le Huitouze, P. Louvet, and O. Ridoux. Logic grammars and \u03bbProlog. In D.S. Warren, editor, 10th Int. Conf. Logic Programming, pages 64\u201379, MIT Press, 1993."},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In 14th ACM Symp. Principles of Programming Languages, pages 111\u2013119, ACM, Munich, Germany 1987.","DOI":"10.1145\/41625.41635"},{"key":"12_CR28","unstructured":"B. Jayaraman and G. Nadathur. Implementation techniques for scoping constructs in logic programming. In K. Furukawa, editor, 8th Int. Conf. Logic Programming, pages 871\u2013886, MIT Press, 1991."},{"key":"12_CR29","unstructured":"T.K. Lakshman and U.S. Reddy. Typed Prolog: a semantic reconstruction of the Mycroft-O'Keefe type system. In Int. Logic Programming Symp., pages 202\u2013217, 1991."},{"key":"12_CR30","volume-title":"Foundations of Logic Programming. Symbolic computation-Artificial Intelligence","author":"J.W. Lloyd","year":"1987","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Symbolic computation-Artificial Intelligence, Springer-Verlag, Berlin, FRG, 1987."},{"key":"12_CR31","unstructured":"S. Michaylov and F. Pfenning. An empirical study of the runtime behavior of higher-order logic programs. In Workshop on \u03bbProlog, 1992. Preliminary version."},{"key":"12_CR32","unstructured":"D.A. Miller. Abstract syntax and logic programming. In A. Voronkov, editor, 2nd Russian Conf. Logic Programming, LNCS 592, Springer-Verlag, 1991."},{"key":"12_CR33","unstructured":"D.A. Miller. Lexical scoping as universal quantification. In G. Levi and M. Martelli, editors, 6th Int. Conf. Logic Programming, pages. 268\u2013283, MIT Press, 1989."},{"issue":"4","key":"12_CR34","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D.A. Miller","year":"1991","unstructured":"D.A. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. J. Logic and Computation, 1(4):497\u2013536, 1991.","journal-title":"J. Logic and Computation"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"D.A. Miller. A proposal for modules in \u03bbProlog. In R. Dyckhoff, editor, Int. Workshop Extensions of Logic Programming, LNAI 798, pages 206\u2013221, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-58025-5_58"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"D.A. Miller and G. Nadathur. Higher-order logic programming. In E. Shapiro, editor, 3rd Int. Conf. Logic Programming, LNCS 225, pages 448\u2013462, Springer-Verlag, 1986.","DOI":"10.1007\/3-540-16492-8_94"},{"key":"12_CR37","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D.A. Miller","year":"1991","unstructured":"D.A. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125\u2013157, 1991.","journal-title":"Annals of Pure and Applied Logic"},{"key":"12_CR38","unstructured":"D.A. Miller, G. Nadathur, and A. Scedrov. Hereditary Harrop formulas and uniform proof systems. In D. Gries, editor, 2nd Symp. Logic in Computer Science, pages 98\u2013105, Ithaca, New York, USA, 1987."},{"key":"12_CR39","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A theory of type polymorphism in programming. J. Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"J. Computer and System Sciences"},{"key":"12_CR40","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"A. Mycroft and R.A. O'Keefe. A polymorphic type system for Prolog. Artificial Intelligence, 23:295\u2013307, 1984.","journal-title":"Artificial Intelligence"},{"key":"12_CR41","unstructured":"R. Pareschi and D.A. Miller. Extending definite clause grammars with scoping constructs. In D.H.D. Warren and P. Szeredi, editors, 7th Int. Conf. Logic Programming, pages 373\u2013389, MIT Press, 1990."},{"key":"12_CR42","unstructured":"F. Pfenning. Dependent types in logic programming. In F. Pfenning, editor, Types in Logic Programming, pages 285\u2013311, MIT Press, 1992."},{"key":"12_CR43","doi-asserted-by":"crossref","unstructured":"F. Pfenning. Logic programming in the LF logical framework. In G. Huet and G. Plotkin, editors, Logical Frameworks, pages 149\u2013181, Cambridge University Press, 1991.","DOI":"10.1017\/CBO9780511569807.008"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"F. Pfenning. Partial polymorphic type inference and higher-order unification. In ACM Conf. LISP and Functional Programming, pages 153\u2013163, ACM Press, 1988.","DOI":"10.1145\/62678.62697"},{"key":"12_CR45","doi-asserted-by":"crossref","unstructured":"F. Pfenning. Unification and anti-unification in the calculus of constructions. In Symp. Logic in Computer Science, pages 74\u201385, 1991.","DOI":"10.1109\/LICS.1991.151632"},{"key":"12_CR46","unstructured":"B. Pierce, S. Dietzen, and S. Michaylov. Programming in Higher-Order Typed Lambda-Calculi. Research Report CMU-CS-89-111, School of Computer Science, Carnegie Mellon University, 1989."},{"key":"12_CR47","unstructured":"L. Sterling and E. Shapiro. The Art of Prolog. MIT Press, 1986."},{"key":"12_CR48","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01932293","volume":"17","author":"S-\u00c5. T\u00e4rnlund","year":"1977","unstructured":"S-\u00c5. T\u00e4rnlund. Horn clause computability. BIT, 17:215\u2013226, 1977.","journal-title":"BIT"},{"key":"12_CR49","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryck Van","year":"1989","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, 1989."}],"container-title":["Lecture Notes in Computer Science","Constraint Programming: Basics and Trends"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59155-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:40Z","timestamp":1605630340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59155-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591559","9783540492009"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/3-540-59155-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}