{"id":"https://openalex.org/W2082611979","doi":"https://doi.org/10.1007/bf01213533","title":"Specification and correctness proof of a WAM extension with abstract type constraints","display_name":"Specification and correctness proof of a WAM extension with abstract type constraints","publication_year":1996,"publication_date":"1996-07-01","ids":{"openalex":"https://openalex.org/W2082611979","doi":"https://doi.org/10.1007/bf01213533","mag":"2082611979"},"language":"en","primary_location":{"id":"doi:10.1007/bf01213533","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf01213533","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/BF01213533","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1007/BF01213533","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002320735","display_name":"Christoph Beierle","orcid":"https://orcid.org/0000-0002-0736-8516"},"institutions":[{"id":"https://openalex.org/I120691247","display_name":"University of Hagen","ror":"https://ror.org/04tkkr536","country_code":"DE","type":"education","lineage":["https://openalex.org/I120691247"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christoph Beierle","raw_affiliation_strings":["Fachbereich Informatik, LG Praktische Informatik VIII, FernUniversit\u00e4t Hagen, Bahnhofstr. 48, D-58084, Hagen, Germany"],"affiliations":[{"raw_affiliation_string":"Fachbereich Informatik, LG Praktische Informatik VIII, FernUniversit\u00e4t Hagen, Bahnhofstr. 48, D-58084, Hagen, Germany","institution_ids":["https://openalex.org/I120691247"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021020828","display_name":"Egon B\u00f6rger","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Egon B\u00f6rger","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Pisa, Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002320735"],"corresponding_institution_ids":["https://openalex.org/I120691247"],"apc_list":null,"apc_paid":null,"fwci":1.6567,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87019807,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":"4","first_page":"428","last_page":"462"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.7326080799102783},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7252408266067505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6754215955734253},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6646055579185486},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.5951817035675049},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5122494101524353},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4805239140987396},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4524745047092438},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4503464102745056},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.45029422640800476},{"id":"https://openalex.org/keywords/type-theory","display_name":"Type theory","score":0.431708425283432},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4156220555305481},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.41529732942581177},{"id":"https://openalex.org/keywords/generic-programming","display_name":"Generic programming","score":0.4147689938545227},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.4137299656867981},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4007127285003662},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.38986343145370483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2606876492500305}],"concepts":[{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.7326080799102783},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7252408266067505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6754215955734253},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6646055579185486},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.5951817035675049},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5122494101524353},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4805239140987396},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4524745047092438},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4503464102745056},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.45029422640800476},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.431708425283432},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4156220555305481},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.41529732942581177},{"id":"https://openalex.org/C7051814","wikidata":"https://www.wikidata.org/wiki/Q1051282","display_name":"Generic programming","level":2,"score":0.4147689938545227},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.4137299656867981},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4007127285003662},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.38986343145370483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2606876492500305},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01213533","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf01213533","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/BF01213533","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/bf01213533","is_oa":true,"landing_page_url":"https://doi.org/10.1007/bf01213533","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/BF01213533","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323015","display_name":"Bundesministerium f\u00fcr Forschung und Technologie","ror":"https://ror.org/04pz7b180"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2082611979.pdf","grobid_xml":"https://content.openalex.org/works/W2082611979.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W14560249","https://openalex.org/W14637534","https://openalex.org/W41993862","https://openalex.org/W64092819","https://openalex.org/W70020211","https://openalex.org/W79760435","https://openalex.org/W134953795","https://openalex.org/W1479704934","https://openalex.org/W1523542737","https://openalex.org/W1539030153","https://openalex.org/W1559402073","https://openalex.org/W1563334701","https://openalex.org/W1572649525","https://openalex.org/W1603788080","https://openalex.org/W1606504862","https://openalex.org/W1836997725","https://openalex.org/W1980166798","https://openalex.org/W2004587039","https://openalex.org/W2006804775","https://openalex.org/W2006928136","https://openalex.org/W2031532267","https://openalex.org/W2035855976","https://openalex.org/W2038037493","https://openalex.org/W2060498389","https://openalex.org/W2123396057","https://openalex.org/W2132638915","https://openalex.org/W2175224012","https://openalex.org/W2224671975","https://openalex.org/W2612793397","https://openalex.org/W3105529609"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W1531664660","https://openalex.org/W2097415053","https://openalex.org/W2500041535","https://openalex.org/W1563755460","https://openalex.org/W2032348095","https://openalex.org/W2520084020","https://openalex.org/W2156897434","https://openalex.org/W1971069708"],"abstract_inverted_index":{"Abstract":[0,11,42],"We":[1],"provide":[2,29],"a":[3,30,37,79,171,178,186],"mathematical":[4],"specification":[5,32,161],"of":[6,9,36,47,69,88,115,121,134,162,173,216],"an":[7,45,213],"extension":[8,46,166,211],"Warren's":[10],"Machine":[12,43],"(WAM)":[13],"for":[14,182,197],"executing":[15],"Prolog":[16,103,142,158],"to":[17,28,78,81,95,98,111,131,208],"type-constraint":[18,141,164,201],"logic":[19,58,202],"programming":[20,59,203],"and":[21,33,75,90,117,136,153,181],"prove":[22],"its":[23],"correctness.":[24],"Our":[25],"aim":[26],"is":[27,129,167,189,223],"full":[31],"correctness":[34,187],"proof":[35,188],"concrete":[38],"system,":[39],"the":[40,48,57,67,70,86,122,125,132,163,194,209,220],"PROTOS":[41],"(PAM),":[44],"WAM":[49,165,210],"by":[50,56,170],"polymorphic":[51],"order-sorted":[52],"unification":[53],"as":[54],"required":[55],"language":[60],"PROTOS-L.":[61],"In":[62],"this":[63,82],"paper,":[64],"while":[65],"leaving":[66],"details":[68],"PAM's":[71],"type":[72,92,126],"constraint":[73,100,127],"representation":[74],"solving":[76],"facilities":[77],"sequel":[80],"work,":[83],"we":[84,138,192],"keep":[85],"notion":[87,215],"types":[89,217],"dynamic":[91],"constraints":[93],"abstract":[94,200,214],"allow":[96],"applications":[97],"different":[99],"formalisms":[101],"like":[102],"III":[104],"or":[105],"CLP(R).":[106],"This":[107],"generality":[108],"permits":[109],"us":[110],"introduce":[112],"modular":[113],"extensions":[114],"B\u00f6rger's":[116,152],"Rosenzweig's":[118,154],"formal":[119],"derivation":[120],"WAM.":[123],"Since":[124],"handling":[128],"orthogonal":[130],"compilation":[133],"predicates":[135],"clauses,":[137],"start":[139],"from":[140,151],"algebras":[143],"with":[144,212],"compiled":[145,156],"AND/OR":[146],"structure":[147],"that":[148,196],"are":[149],"derived":[150],"corresponding":[155],"standard":[157],"algebras.":[159],"The":[160],"then":[168],"given":[169],"sequence":[172],"evolving":[174],"algebras,":[175],"each":[176,183],"representing":[177],"refinement":[179,184],"level,":[180],"step":[185],"given.":[190],"Thus,":[191],"obtain":[193],"theorem":[195],"every":[198,206],"such":[199],"system":[204],"L,":[205],"compiler":[207],"which":[218],"satisfies":[219],"specified":[221],"conditions,":[222],"correct.":[224]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}