{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:54Z","timestamp":1725663114743},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540151999"},{"type":"electronic","value":"9783540393078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-15199-0_18","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:11:54Z","timestamp":1330193514000},"page":"276-293","source":"Crossref","is-referenced-by-count":3,"title":["A PROLOG environment for developing and reasoning about data types"],"prefix":"10.1007","author":[{"given":"Jieh","family":"Hsiang","sequence":"first","affiliation":[]},{"given":"Mandayam K.","family":"Srivas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"18_CR1","unstructured":"R. E. Davis, \u201cRunnable Specification as a Design Tool\u201d, in Logic Programming, K. L. Clark and S. Tarnlund, (eds.), Academic Press, January 1982, 141\u2013152."},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"H. Ehrig, \u201cAlgebraic Theory of Parameterized Specifications with Requirements\u201d, 6th CAAP, 1981.","DOI":"10.1007\/3-540-10828-9_51"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"F. Fages, \u201cAssociative-Commutative Unification\u201d, 7th Conf. on Automated Deduction, Nappa Valley, CA, May, 1984, 194\u2013208.","DOI":"10.1007\/978-0-387-34768-4_12"},{"key":"18_CR4","volume-title":"Current Trends in Programming Methodology","author":"J. A. Goguen","year":"1978","unstructured":"J. A. Goguen, J. W. Thatcher and E. G. Wagner, \u201cInitial Algebra Approach to the Specification, Correctness, and Implementation of Abstract Data Types\u201d, in Current Trends in Programming Methodology, vol. IV Data Structuring, R. T. Yeh, (ed.), Prentice Hall (Automatic Computation Series), Englewood Cliffs, NJ, 1978."},{"key":"18_CR5","unstructured":"J. A. Goguen and J. J. Tardo, \u201cAn Introduction to OBJ: A Language for Writing and Testing Formal Algebraic Program Specifications\u201d, Proceedings of the Conference on Specification of Reliable Software, Cambridge, MA 02139, 1979."},{"key":"18_CR6","unstructured":"J. A. Goguen, \u201cParameterized Programming\u201d, Proceedings of the Workshop on Reusability in Programming, 1982."},{"issue":"1","key":"18_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","volume":"10","author":"J. V. Guttag","year":"1978","unstructured":"J. V. Guttag and J. J. Horning, \u201cThe Algebraic Specification of Abstract Data Types\u201d, Acta Informatica, 10, 1 (1978), 27\u201352.","journal-title":"Acta Informatica"},{"key":"18_CR8","unstructured":"A. Hansson and S. Tarnlund, \u201cProgram Transformation by Data Structure\u201d, in Logic Programming, K. L. Clark and S. Tarnlund, (eds.), Academic Press, January 1982, 141\u2013152."},{"key":"18_CR9","unstructured":"J. Hsiang and M. K. Srivas, \u201cOn Proving First Order Inductive Properties in Horn Clauses\u201d, Technical Report 84\/75, SUNY at Stony Brook, Stony Brook, NY 11794, 1984."},{"key":"18_CR10","unstructured":"J. Hsiang and M. K. Srivas, \u201cA PROLOG Environment for Developing and Reasoning about Data Types\u201d, Technical Report 84\/074, SUNY at Stony Brook, Stony Brook, NY 11794, 1984."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"G. Huet and J. M. Hullot, \u201cProofs by Induction in Equational Theories with Constructors\u201d, 21st IEEE Symposium on Foundations of Computer Science, 1980, 797\u2013821.","DOI":"10.1109\/SFCS.1980.37"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"G. Huet and D. C. Oppen, \u201cEquations and Rewrite Rules: A Survey\u201d, in Formal Languages: Perspectives and Open Problems, R. Book, (ed.), Academic Press, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"J. M. Hullot, \u201cCanonical Forms and Unification\u201d, 5th Conference on Automated Deduction, Les Arcs, France, 1980, 318\u2013334.","DOI":"10.21236\/ADA087640"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"D. Kapur and M. K. Srivas, \u201cExpressiveness of the Operation Set of a Data Abstraction\u201d, Seventh Annual ACM Symposium on Principles of Programming Languages, Las Vegas, Nevada, January 28\u201330, 1980, 139\u2013153.","DOI":"10.1145\/567446.567460"},{"key":"18_CR15","unstructured":"W. A. Kornfeld, \u201cEquality in Prolog\u201d, Proc. 8th IJCAI, Karlsruhe, Germany, August 1983, 514\u2013519."},{"key":"18_CR16","unstructured":"P. Mishra, \u201cTowards a Theory of Types in Prolog\u201d, 1984 International Symposium on Logic Programming, Atlantic City, New Jersey, Feb. 6\u20139, 1984, 289\u2013298."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"D. R. Musser, \u201cAbstract Data Types in the AFFIRM System\u201d, IEEE, 1, 6 (Jan. 1980),.","DOI":"10.1109\/TSE.1980.230459"},{"key":"18_CR18","volume-title":"Ph.D. Thesis","author":"P. Padawitz","year":"1982","unstructured":"P. Padawitz, \u201cCorrectness, Completeness and Consistency of Equational Data Type Specifications\u201d, in Ph.D. Thesis,, Technische Universitat, Berlin, 1982."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"D. A. Plaisted, \u201cThe Occur-Check Problem in Prolog\u201d, 1984 International Symposium on Logic Programming, Atlantic City, New Jersey, Feb. 6\u20139, 1984, 272\u2013280.","DOI":"10.1007\/BF03037324"},{"key":"18_CR20","unstructured":"M. K. Srivas, \u201cA Rewrite Rule Based Approach to Program Transformation\u201d, The Rewrite Rule Laboratory Workshop, Schenectady, NY 12345, September 1983."},{"key":"18_CR21","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1145\/322261.322262","volume":"28","author":"M. E. Stickel","year":"1981","unstructured":"M. E. Stickel, \u201cA Unification Algorithm for Associative-Commutative Functions\u201d, J. ACM, 28, (1981), 233\u2013264.","journal-title":"J. ACM"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"M. E. Stickel, \u201cA Prolog Technology Theorem Prover\u201d, 1984 International Symposium on Logic Programming, Atlantic City, New Jersey, Feb. 6\u20139, 1984, 212\u2013219.","DOI":"10.1007\/BF03037328"},{"key":"18_CR23","unstructured":"P. A. Subrahmanyam and J. You, \u201cConceptual Basis and Evaluation Strategies for Integrating Functional and Logic Programming\u201d, 1984 International Symposium on Logic Programming, Atlantic City, New Jersey, February 6\u20139, 1984, 144\u2013153."}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-15199-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:08:08Z","timestamp":1605643688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-15199-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540151999","9783540393078"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-15199-0_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}