{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:16Z","timestamp":1725663556112},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540531623"},{"type":"electronic","value":"9783540467380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-53162-9_33","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:01:18Z","timestamp":1330207278000},"page":"101-116","source":"Crossref","is-referenced-by-count":3,"title":["Axiomatization of a functional logic language"],"prefix":"10.1007","author":[{"given":"Francois","family":"Bronsard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uday S.","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-18779-0","volume-title":"The Munich Project CIP. Volume 292 of LNCS","author":"F. L. Bauer","year":"1987","unstructured":"F. L. Bauer. The Munich Project CIP. Volume 292 of LNCS, Springer-Verlag, Berlin, 1987."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"F. Bronsard. Program Synthesis in a Functional Logic Language. (forthcoming Ph.D. proposal), University of Illinois, 1990.","DOI":"10.1007\/3-540-53162-9_33"},{"issue":"4","key":"7_CR3","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1137\/0212047","volume":"12","author":"S. L. Bloom","year":"1983","unstructured":"S. L. Bloom and R. Tindell. Varieties of \u201cif-then-else\u201d. SIAM J. Computing, 12(4):677\u2013707, 1983.","journal-title":"SIAM J. Computing"},{"key":"7_CR4","series-title":"Technical Report","volume-title":"Computing with rewrite systems","author":"N. Dershowitz","year":"1983","unstructured":"N. Dershowitz. Computing with rewrite systems. Technical Report ATR-83(8478)-1, Information Sciences Research Office, The Aerospace Corp., El Segundo, CA., January 1983."},{"key":"7_CR5","unstructured":"J. Darlington, A. J. Field, and H. Pull. The unification of functional and logic languages. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 37\u201370, Prentice-Hall, 1986."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"J. Darlington and Y. K. Guo. Unification of functional and logic languages \u2014 Towards constraint functional programming. In TENCON Special Session on Functional Languages: Theory and Applications, Bombay, India, Nov 1989.","DOI":"10.1109\/TENCON.1989.176919"},{"key":"7_CR7","unstructured":"M. Fay. First-order unification in an equational theory. In Fourth Workshop on Automated Deduction, pages 161\u2013167, Austin, Texas, 1979."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"J. A. Goguen and J. Meseguer. Equality, types, modules and generics for logic programming. In Proc. 2nd Intern. Logic Prog. Conf., Uppsala, pages 115\u2013125, 1984.","DOI":"10.1016\/0743-1066(84)90004-9"},{"issue":"2","key":"7_CR9","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/0216025","volume":"16","author":"I. Guessarian","year":"1987","unstructured":"I. Guessarian and J. Meseguer. On the axiomatisation of \u201cif-then-else\u201d. SIAM J. Computing, 16(2):332\u2013357, Apr 1987.","journal-title":"SIAM J. Computing"},{"key":"7_CR10","unstructured":"D. Hilbert and W. Ackermann. Principles of Mathematical Logic. Chelsea Pub. Co., New York, 1950. translated by L. M. Hammond, G. G. Leckie, and F. Steinhardt."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"J-M. Hullot. Canonical forms and unification. In Conf. on Automated Deduction, pages 318\u2013334, 1980.","DOI":"10.21236\/ADA087640"},{"key":"7_CR12","unstructured":"E.C. Leisenring. Mathematical Logic and Hilbert's \u03b5-symbol. Gordon and Breach Science Publishers, NY, 1969."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"G. Lindstrom. Functional programming and the logical variable. In ACM Symp. on Princ. of Program. Languages, 1985.","DOI":"10.1145\/318593.318657"},{"key":"7_CR14","unstructured":"R.S. Nikhil, K. Pingali, and Arvind. Id Nouveau. Technical Report CSG 265, MIT, 1986."},{"key":"7_CR15","unstructured":"G. Pottinger. Ulysses: Logical Foundations of the Definition Facility. Technical Report TR 11-9, Odyssey Research Associates, Jan 1988."},{"key":"7_CR16","first-page":"138","volume-title":"Symp. on Logic Program.","author":"U. S. Reddy","year":"1985","unstructured":"U. S. Reddy. Narrowing as the operational semantics of functional languages. In Symp. on Logic Program., pages 138\u2013151, IEEE, Boston, 1985."},{"key":"7_CR17","unstructured":"U. S. Reddy. Logic Languages based on Functions: Semantics and Implementation. Technical Report UIUCDCS-R-86-1305, Univ. Illinois at Urbana-Champaign, 1986. Ph.D. thesis done at Univ. of Utah."},{"key":"7_CR18","unstructured":"U. S. Reddy. On the relationship between logic and functional languages. In D. DeGroot and G. Lindstrom, editors, Logic Programming: Functions, Relations and Equations, pages 3\u201336, Prentice-Hall, 1986."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Functional logic languages, Part I. In Graph Reduction, pages 401\u2013425, Springer-Verlag, 1987. (Lecture Notes in Computer Science, Vol 279).","DOI":"10.1007\/3-540-18420-1_68"},{"key":"7_CR20","unstructured":"U. S. Reddy. Design principles for an interactive program derivation system. In Proc. AAAI-88 Workshop on Automating Software Design, pages 145\u2013155, AAAI, 1988."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Transformational derivation of programs using the Focus system. In Symp. Practical Software Development Environments, pages 163\u2013172, ACM, December 1988.","DOI":"10.1145\/64135.65019"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Rewriting techniques for program synthesis. In N. Dershowitz, editor, Rewriting Techniques and Appl., pages 388\u2013403, Springer-Verlag, 1989. (LNCS Vol. 355).","DOI":"10.1007\/3-540-51081-8_121"},{"issue":"4","key":"7_CR23","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J. R. Slagle","year":"1974","unstructured":"J. R. Slagle. Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM, 21(4):622\u2013642, 1974.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53162-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:26:42Z","timestamp":1605648402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53162-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540531623","9783540467380"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-53162-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}