{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:10:00Z","timestamp":1709824200733},"reference-count":11,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1996,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We refine the mathematical specification of a WAM extension to typeconstraint logic programming given in [BeB96]. We provide a full specification and correctness proof of the PROTOS Abstract Machine (PAM), an extension of the WAM by polymorphic order-sorted unification as required by the logic programming language PROTOS-L, by refining the abstract type constraints used in [BeB96] to the polymorphic order-sorted types of PROTOS-L. This allows us to develop a detailed and mathematically precise account of the PAM's compiled type constraint representation and solving facilities, and to extend the correctness theorem to compilation on the fully specified PAM.<\/jats:p>","DOI":"10.1007\/bf01211908","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T19:28:44Z","timestamp":1109359724000},"page":"539-564","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Refinement of a typed WAM extension by polymorphic order-sorted types"],"prefix":"10.1145","volume":"8","author":[{"given":"Christoph","family":"Beierle","sequence":"first","affiliation":[{"name":"Fachbereich Informatik, LG Praktische Informatik VIII, FernUniversit\u00e4t Hagen, Bahnhofstr. 48, D-58084, Hagen, Germany"}]},{"given":"Egon","family":"B\u00f6rger","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Pisa, Italy"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7160.001.0001"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01213533"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"publisher","DOI":"10.1147\/rd.363.0375"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90049-3"},{"key":"e_1_2_1_2_5_2","first-page":"36","volume-title":"CSL'89 \u2014 3rd Workshop on Computer Science Logic","author":"B\u00f6rger E.","year":"1990"},{"key":"e_1_2_1_2_6_2","first-page":"20","volume-title":"Logic Programming: Formal Methods and Practical Applications","author":"B\u00f6rger E.","year":"1995"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90107-S"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(84)90017-1"},{"key":"e_1_2_1_2_9_2","unstructured":"Smolka G.: TEL (Version 0.9) Report and User Manual. SEKI-Report SR 87-17 FB Informatik Universit\u00e4t Kaiserslautern 1988."},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"crossref","unstructured":"Smolka G.: Logic Programming over Polymorphically Order-Sorted Types. PhD thesis FB Informatik Univ. Kaiserslautern 1989.","DOI":"10.1007\/3-540-50667-5_58"},{"key":"e_1_2_1_2_11_2","unstructured":"Warren D. H. D.: An Abstract PROLOG Instruction Set. Technical Report 309 SRI 1983."}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211908.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211908\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01211908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:28:13Z","timestamp":1641482893000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01211908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["10.1007\/BF01211908"],"URL":"https:\/\/doi.org\/10.1007\/bf01211908","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,9]]}}}