{"id":"https://openalex.org/W2108167582","doi":"https://doi.org/10.1145/1411260.1411271","title":"Declarative language extensions for prolog courses","display_name":"Declarative language extensions for prolog courses","publication_year":2008,"publication_date":"2008-09-21","ids":{"openalex":"https://openalex.org/W2108167582","doi":"https://doi.org/10.1145/1411260.1411271","mag":"2108167582"},"language":"en","primary_location":{"id":"doi:10.1145/1411260.1411271","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1411260.1411271","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 international workshop on Functional and declarative programming in education","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069027426","display_name":"Ulrich Neumerkel","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Ulrich Neumerkel","raw_affiliation_strings":["Technische Universit\u00e4t Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072110185","display_name":"Markus Triska","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Markus Triska","raw_affiliation_strings":["Technische Universit\u00e4t Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052365388","display_name":"Jan Wielemaker","orcid":"https://orcid.org/0000-0001-5574-5673"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jan Wielemaker","raw_affiliation_strings":["Universiteit van Amsterdam, Amsterdam, Netherlands"],"affiliations":[{"raw_affiliation_string":"Universiteit van Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I865915315","https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069027426"],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09637358,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"73","last_page":"78"},"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.9995999932289124,"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.9995999932289124,"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.9966999888420105,"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"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9523542523384094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7774358987808228},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7720043063163757},{"id":"https://openalex.org/keywords/arithmetic-function","display_name":"Arithmetic function","score":0.5602014064788818},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.5104590654373169},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.4848693311214447},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4553045630455017},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.41908901929855347},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3846229612827301},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.20531204342842102},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17695599794387817},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.15464922785758972},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.09584993124008179},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.06592994928359985}],"concepts":[{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.9523542523384094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7774358987808228},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7720043063163757},{"id":"https://openalex.org/C112343008","wikidata":"https://www.wikidata.org/wiki/Q140744","display_name":"Arithmetic function","level":2,"score":0.5602014064788818},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.5104590654373169},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4848693311214447},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4553045630455017},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.41908901929855347},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3846229612827301},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.20531204342842102},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17695599794387817},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.15464922785758972},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.09584993124008179},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.06592994928359985},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1411260.1411271","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1411260.1411271","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2008 international workshop on Functional and declarative programming in education","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:publications/4b9d133d-22b8-4032-816d-2f5618736033","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/declarative-language-extensions-for-prolog-courses(4b9d133d-22b8-4032-816d-2f5618736033).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Neumerkel, U, Triska, M & Wielemaker, J 2008, Declarative language extensions for Prolog courses. in FDPE\u201908: Proceedings of the 2008 ACM SIGPLAN Workshop on Functional and Declarative Programming in Education. Association for Computing Machinery (ACM), New York, NY, pp. 73-78, 2008 ACM SIGPLAN Workshop on Functional and Declarative Programming in Education (FDPE\u201908), Victoria, BC, Canada, 21/09/08. < http://doi.acm.org/10.1145/1411260.1411271 >","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/4b9d133d-22b8-4032-816d-2f5618736033","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/declarative-language-extensions-for-prolog-courses(4b9d133d-22b8-4032-816d-2f5618736033).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"FDPE\u201908: Proceedings of the 2008 ACM SIGPLAN Workshop on Functional and Declarative Programming in Education, 73 - 78","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.6200000047683716,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W138610611","https://openalex.org/W185947355","https://openalex.org/W193996434","https://openalex.org/W1480711761","https://openalex.org/W1492160417","https://openalex.org/W1507859480","https://openalex.org/W1508419498","https://openalex.org/W1514468887","https://openalex.org/W1514470545","https://openalex.org/W1524883003","https://openalex.org/W1536968357","https://openalex.org/W1555216982","https://openalex.org/W1573207071","https://openalex.org/W1982243747","https://openalex.org/W1988095917","https://openalex.org/W2012741612","https://openalex.org/W2112774031","https://openalex.org/W3102045914","https://openalex.org/W4230781079","https://openalex.org/W6607582825","https://openalex.org/W6628746355","https://openalex.org/W6630630423","https://openalex.org/W6630827803","https://openalex.org/W6653751088"],"related_works":["https://openalex.org/W1596719193","https://openalex.org/W2365168741","https://openalex.org/W2951371264","https://openalex.org/W1977834309","https://openalex.org/W1849174213","https://openalex.org/W2090744903","https://openalex.org/W1973582361","https://openalex.org/W2510050445","https://openalex.org/W1591583250","https://openalex.org/W2525470665"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"present":[4],"several":[5],"extensions":[6,18,54,94],"to":[7,23,48,59,73],"support":[8],"a":[9,70],"more":[10,50],"declarative":[11],"view":[12],"of":[13,29,45,80],"programming":[14],"in":[15],"Prolog.":[16],"These":[17],"enable":[19],"introductory":[20],"Prolog":[21,30],"courses":[22],"concentrate":[24],"on":[25],"the":[26,49,61,78,100],"pure":[27],"parts":[28],"for":[31],"longer":[32],"periods":[33],"than":[34],"without.":[35],"Even":[36],"quite":[37],"complex":[38],"programs":[39],"can":[40],"now":[41],"be":[42],"written":[43],"free":[44,65],"any":[46],"reference":[47],"problematic":[51],"constructs.":[52],"Our":[53],"include":[55],"an":[56],"alternate":[57],"way":[58],"handle":[60],"occurs-check,":[62],"efficient":[63],"side-effect":[64],"I/O":[66],"with":[67],"DCGs,":[68],"and":[69,83,89],"uniform":[71],"approach":[72],"integer":[74],"arithmetic":[75],"that":[76],"overcomes":[77],"disadvantages":[79],"arithmetical":[81],"evaluation":[82],"finite":[84],"domain":[85],"constraints,":[86],"but":[87],"combines":[88],"amplifies":[90],"their":[91],"strengths.":[92],"All":[93],"have":[95],"been":[96],"included":[97],"recently":[98],"into":[99],"SWI-Prolog":[101],"distribution.":[102]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}