{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:54Z","timestamp":1725664074715},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582168"},{"type":"electronic","value":"9783540485735"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58216-9_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:36:48Z","timestamp":1330270608000},"page":"114-128","source":"Crossref","is-referenced-by-count":2,"title":["Logical closures"],"prefix":"10.1007","author":[{"given":"Dominic","family":"Duggan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Andrew Appel. Compiling with Continuations. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511609619"},{"key":"9_CR2","unstructured":"Thierry Coquand. An analysis of Girard's paradox. In Proceedings of IEEE Symposium on Logic in Computer Science, 1986."},{"key":"9_CR3","unstructured":"Dominic Duggan. Higher-order substitutions. Technical Report CS-9344, University of Waterloo, 1993. 34 pages. Submitted for publication. An earlier version of this paper was presented at the \u03bb-Prolog Workshop, Philadelphia PA, July 1992."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Dominic Duggan. Logical closures. Technical Report UWCS-94-20, Department of Computer Science, University of Waterloo, 1994.","DOI":"10.1007\/3-540-58216-9_33"},{"key":"9_CR5","unstructured":"Dominic Duggan. Possible worlds semantics for higher-order, explicitly polymorphic logic programming. In preparation, 1994."},{"key":"9_CR6","unstructured":"Dominic Duggan. Unification with extended patterns. Technical Report CS-93-37, University of Waterloo, 1994. 57 pages. Revised March 1994. Submitted for publication."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Amy Felty. Encoding the calculus of constructions in a higher-order logic. In Proceedings of IEEE Symposium on Logic in Computer Science, 1993.","DOI":"10.1109\/LICS.1993.287584"},{"key":"9_CR8","unstructured":"Jean-Yves Girard, Yves Lafont, and Paul Taylor. Proofs and Types. Cambridge University Press, 1989."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Robert Harper, John Mitchell, and Eugenio Moggi. Higher-order modules and the phase distinction. In Proceedings of ACM Symposium on Principles of Programming Languages, pages 341\u2013354. Association for Computing Machinery, 1990.","DOI":"10.1145\/96709.96744"},{"issue":"2","key":"9_CR10","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/169701.169696","volume":"15","author":"R. Harper","year":"1993","unstructured":"Robert Harper and John C. Mitchell. On the type structure of Standard ML. ACM Transactions on Programming Languages and Systems, 15(2):211\u2013252, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR11","unstructured":"S. C. Keene. Object Oriented Programming in Common Lisp: A Programming Guide in CLOS. Addison-Wesley, 1989."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Zhaohui Luo. ECC, an extended calculus of constructions. In Proceedings of IEEE Symposium on Logic in Computer Science, pages 385\u2013395. IEEE, 1989.","DOI":"10.1109\/LICS.1989.39193"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"P. Martin-L\u00f6f. An intuitionistic theory of types: Predicative part. In H. E. Rose and J. C. Shepherdson, editors, Logic Colloquium '73, pages 73\u2013118. North-Holland, 1973.","DOI":"10.1016\/S0049-237X(08)71945-1"},{"key":"9_CR14","unstructured":"Dale Miller. Abstractions in logic programming. In Peirgiorgio Odifreddi, editor, Logic and Computer Science, pages 329\u2013359. Academic Press, 1990."},{"issue":"4","key":"9_CR15","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","volume":"1","author":"D. Miller","year":"1991","unstructured":"Dale Miller. A logic programming language with lambda-abstraction, function variables and simple unification. Journal of Logic and Computation, 1(4):497\u2013536, 1991.","journal-title":"Journal of Logic and Computation"},{"key":"9_CR16","unstructured":"Dale Miller. Unification of simply typed \u03bb-terms as logic programming. In Proceedings of the International Conference on Logic Programming, pages 255\u2013269. MIT Press, 1991."},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Dale Miller, Gopalan Nadathur, Frank Pfenning, and Andre 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":"9_CR18","unstructured":"Gopalan Nadathur and Dale Miller. An overview of \u03bb-Prolog. In Proceedings of the International Conference on Logic Programming, pages 810\u2013827. MIT Press, 1988."},{"issue":"4","key":"9_CR19","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1145\/96559.96570","volume":"37","author":"G. Nadathur","year":"1990","unstructured":"Gopalan Nadathur and Dale Miller. Higher-order Horn clauses. Journal of the ACM, 37(4):777\u2013814, October 1990.","journal-title":"Journal of the ACM"},{"key":"9_CR20","unstructured":"Lawrence C. Paulson and Andrew W. Smith. Logic programming, functional programming and inductive definitions. In Peter Schroeder-Heister, editor, Extensions of Logic Programming. Springer-Verlag, 1990."},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Frank Pfenning. Logic programming in the LF logical framework. In Gerard Huet and Gordon Plotkin, editors, Logical Frameworks, pages 149\u2013181. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511569807.008"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Frank Pfenning and Conal Elliott. Higher-order abstract syntax. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 199\u2013208. Association for Computing Machinery, 1988.","DOI":"10.1145\/53990.54010"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Vijay Saraswat. The category of constraint systems is Cartesian closed. In Proceedings of IEEE Symposium on Logic in Computer Science, pages 341\u2013345, 1992.","DOI":"10.1109\/LICS.1992.185546"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Peter Schroeder-Heister. Hypothetical reasoning and definitional reflection in logic programming. In Peter Schroeder-Heister, editor, Extensions of Logic Programming. Springer-Verlag Lecture Notes in Computer Science, 1990.","DOI":"10.1007\/BFb0038689"},{"key":"9_CR25","unstructured":"William Wadge. Higher order Horn logic programming. In Proceedings of the IEEE International Logic Programming Symposium, 1991."}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58216-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:37Z","timestamp":1605647917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58216-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582168","9783540485735"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-58216-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}