{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:34:43Z","timestamp":1750307683679,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,21]],"date-time":"2008-09-21T00:00:00Z","timestamp":1221955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,9,21]]},"DOI":"10.1145\/1411260.1411271","type":"proceedings-article","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T13:39:01Z","timestamp":1222177141000},"page":"73-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Declarative language extensions for prolog courses"],"prefix":"10.1145","author":[{"given":"Ulrich","family":"Neumerkel","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Wien, Vienna, Austria"}]},{"given":"Markus","family":"Triska","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Wien, Vienna, Austria"}]},{"given":"Jan","family":"Wielemaker","sequence":"additional","affiliation":[{"name":"Universiteit van Amsterdam, Amsterdam, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2008,9,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Why the occur-check is not a problem. PLILP","author":"Apt K.","year":"1992","unstructured":"K. Apt , A. Pellegrini . Why the occur-check is not a problem. PLILP . 1992 . LNCS 631. K. Apt, A. Pellegrini. Why the occur-check is not a problem. PLILP. 1992. LNCS 631."},{"key":"e_1_3_2_1_2_1","volume-title":"J. E. W. Smetsers. Conventional and uniqueness typing in graph rewrite systems. FSTTCS.","author":"Barendsen E.","year":"1993","unstructured":"E. Barendsen , J. E. W. Smetsers. Conventional and uniqueness typing in graph rewrite systems. FSTTCS. 1993 . LNCS 761. E. Barendsen, J. E. W. Smetsers. Conventional and uniqueness typing in graph rewrite systems. FSTTCS. 1993. LNCS 761."},{"key":"e_1_3_2_1_3_1","volume-title":"An Open-Ended Finite Domain Constraint Solver. PLILP","author":"Carlsson M.","year":"1997","unstructured":"M. Carlsson , G. Ottosson , B. Carlson . An Open-Ended Finite Domain Constraint Solver. PLILP . 1997 . M. Carlsson, G. Ottosson, B. Carlson. An Open-Ended Finite Domain Constraint Solver. PLILP. 1997."},{"key":"e_1_3_2_1_4_1","volume-title":"K. L. Clark, S.-A. Trnlund (eds)","author":"Colmerauer A.","year":"1982","unstructured":"A. Colmerauer . Prolog and Infinite Trees. Logic Programming , K. L. Clark, S.-A. Trnlund (eds) , 1982 . A. Colmerauer. Prolog and Infinite Trees. Logic Programming, K. L. Clark, S.-A. Trnlund (eds), 1982."},{"key":"e_1_3_2_1_5_1","volume-title":"Vienna papers - 2 -","author":"Deransart P.","year":"1990","unstructured":"P. Deransart . The problem of unification in standard Prolog - a discussion paper in ISO\/IEC JTC1 SC22 WG17 N59 Prolog , Vienna papers - 2 - 1990 . P. Deransart. The problem of unification in standard Prolog - a discussion paper in ISO\/IEC JTC1 SC22 WG17 N59 Prolog, Vienna papers - 2 - 1990."},{"key":"e_1_3_2_1_6_1","volume-title":"NSTO Programs (Not Subject to Occur-Check). ISLP","author":"Deransart P.","year":"1991","unstructured":"P. Deransart , G. Ferrand , M. Teguia . NSTO Programs (Not Subject to Occur-Check). ISLP . 1991 . P. Deransart, G. Ferrand, M. Teguia. NSTO Programs (Not Subject to Occur-Check). ISLP. 1991."},{"key":"e_1_3_2_1_7_1","volume-title":"Constraint Satisfaction in Logic Programming","author":"van Hentenryck P.","year":"1989","unstructured":"P. van Hentenryck . Constraint Satisfaction in Logic Programming . MIT Press , 1989 . P. van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1238844.1238856"},{"key":"e_1_3_2_1_9_1","volume-title":"General core","author":"IEC","year":"1995","unstructured":"ISO\/ IEC 13211-1 Programming languages - Prolog - Part 1 : General core . 1995 . (7.3 Unification) ISO\/IEC 13211-1 Programming languages - Prolog - Part 1: General core. 1995. (7.3 Unification)"},{"key":"e_1_3_2_1_10_1","volume-title":"Applying static analysis techniques for inferring termination conditions of logic programs. SAS","author":"Mesnard F.","year":"2001","unstructured":"F. Mesnard , U. Neumerkel . Applying static analysis techniques for inferring termination conditions of logic programs. SAS . 2001 , LNCS 2126. F. Mesnard, U. Neumerkel. Applying static analysis techniques for inferring termination conditions of logic programs. SAS. 2001, LNCS 2126."},{"key":"e_1_3_2_1_11_1","volume-title":"How to Solve It: Modern Heuristics","author":"Michalewicz Z.","year":"1998","unstructured":"Z. Michalewicz , D. B. Fogel . How to Solve It: Modern Heuristics . Springer , 1998 \/2000. Z. Michalewicz, D. B. Fogel. How to Solve It: Modern Heuristics. Springer, 1998\/2000."},{"key":"e_1_3_2_1_12_1","volume-title":"ISO\/IEC DTR 13211-3: 2006 Definite clause grammar rules (Draft of","author":"Moura P.","year":"2008","unstructured":"P. Moura (ed.) ISO\/IEC DTR 13211-3: 2006 Definite clause grammar rules (Draft of April 2008 ). P. Moura (ed.) ISO\/IEC DTR 13211-3:2006 Definite clause grammar rules (Draft of April 2008)."},{"key":"e_1_3_2_1_13_1","unstructured":"U. Neumerkel. Pruning Infinite Failure Branches in Programs with Occur-Check. LPAR. 1992. U. Neumerkel. Pruning Infinite Failure Branches in Programs with Occur-Check. LPAR. 1992."},{"key":"e_1_3_2_1_14_1","volume-title":"How to teach Prolog. Teaching beginners Prolog. Tutorial PAP","author":"Neumerkel U.","year":"1995","unstructured":"U. Neumerkel . How to teach Prolog. Teaching beginners Prolog. Tutorial PAP . 1995 . U. Neumerkel. How to teach Prolog. Teaching beginners Prolog. Tutorial PAP. 1995."},{"key":"e_1_3_2_1_15_1","unstructured":"U. Neumerkel. Teaching Prolog and CLP Tutorial ICLP. 1997. U. Neumerkel. Teaching Prolog and CLP Tutorial ICLP. 1997."},{"key":"e_1_3_2_1_16_1","volume-title":"Localizing and explaining reasons for nonterminating logic programs with failure slices. PPDP","author":"Neumerkel U.","year":"1999","unstructured":"U. Neumerkel , F. Mesnard . Localizing and explaining reasons for nonterminating logic programs with failure slices. PPDP . 1999 . LNCS 1702. U. Neumerkel, F. Mesnard. Localizing and explaining reasons for nonterminating logic programs with failure slices. PPDP. 1999. LNCS 1702."},{"key":"e_1_3_2_1_17_1","volume-title":"Declarative program development in Prolog with GUPU. WLPE","author":"Neumerkel U.","year":"2002","unstructured":"U. Neumerkel , St. Kral . Declarative program development in Prolog with GUPU. WLPE . 2002 . U. Neumerkel, St. Kral. Declarative program development in Prolog with GUPU. WLPE. 2002."},{"key":"e_1_3_2_1_18_1","volume-title":"The Seven-Eleven Problem","author":"Pritchard P.","year":"1813","unstructured":"P. Pritchard , D. Gries . The Seven-Eleven Problem . Cornell University TR 83-574 http:\/\/hdl.handle.net\/ 1813 \/6414 1983. P. Pritchard, D. Gries. The Seven-Eleven Problem. Cornell University TR 83-574 http:\/\/hdl.handle.net\/1813\/6414 1983."},{"key":"e_1_3_2_1_19_1","volume-title":"Vienna papers - 2 -","author":"Scowen R.","year":"1990","unstructured":"R. Scowen . Unification - another discussion paper in ISO\/IEC JTC1 SC22 WG17 N59 Prolog , Vienna papers - 2 - 1990 . R. Scowen. Unification - another discussion paper in ISO\/IEC JTC1 SC22 WG17 N59 Prolog, Vienna papers - 2 - 1990."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"Shapiro E.","year":"1983","unstructured":"E. Shapiro , Algorithmic Program Debugging . MIT Press , 1983 . E. Shapiro, Algorithmic Program Debugging. MIT Press, 1983."},{"key":"e_1_3_2_1_21_1","volume-title":"The execution algorithm of Mercury: an efficient purely declarative logic programming language. JLP 29(1-3)","author":"Somogyi Z.","year":"1996","unstructured":"Z. Somogyi , F. Henderson , Th. Conway . The execution algorithm of Mercury: an efficient purely declarative logic programming language. JLP 29(1-3) , 1996 . Z. Somogyi, F. Henderson, Th. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. JLP 29(1-3), 1996."},{"key":"e_1_3_2_1_22_1","unstructured":"J. Wielemaker. A programming environment for developing large applications. LPE. 1990. J. Wielemaker. A programming environment for developing large applications. LPE. 1990."},{"key":"e_1_3_2_1_23_1","volume-title":"An overview of the SWI-Prolog programming environment. WLPE","author":"Wielemaker J.","year":"2003","unstructured":"J. Wielemaker . An overview of the SWI-Prolog programming environment. WLPE . 2003 . J.Wielemaker. An overview of the SWI-Prolog programming environment. WLPE. 2003."},{"key":"e_1_3_2_1_24_1","unstructured":"J. Wielemaker. Prolog Unit Tests. Manual. http:\/\/www.swi-prolog.org\/packages\/plunit.html 2006. J. Wielemaker. Prolog Unit Tests. Manual. http:\/\/www.swi-prolog.org\/packages\/plunit.html 2006."},{"key":"e_1_3_2_1_25_1","volume-title":"Garbage Collection for Pure Input Streams. Submitted paper","author":"Wielemaker J.","year":"2008","unstructured":"J. Wielemaker , U. Neumerkel . Garbage Collection for Pure Input Streams. Submitted paper . 2008 . J. Wielemaker, U. Neumerkel. Garbage Collection for Pure Input Streams. Submitted paper. 2008."}],"event":{"name":"ICFP08: ACM SIGPLAN International Conference on Functional Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Victoria BC Canada","acronym":"ICFP08"},"container-title":["Proceedings of the 2008 international workshop on Functional and declarative programming in education"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411260.1411271","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1411260.1411271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:47Z","timestamp":1750253387000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411260.1411271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,21]]},"references-count":25,"alternative-id":["10.1145\/1411260.1411271","10.1145\/1411260"],"URL":"https:\/\/doi.org\/10.1145\/1411260.1411271","relation":{},"subject":[],"published":{"date-parts":[[2008,9,21]]},"assertion":[{"value":"2008-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}