{"_id":"aS8fzS32HBye5kc6q","bibbaseid":"kahle-studer-formalizingnonterminationofrecursiveprograms-2001","authorIDs":[],"author_short":["Kahle, R.","Studer, T."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Reinhard"],"propositions":[],"lastnames":["Kahle"],"suffixes":[]},{"firstnames":["Thomas"],"propositions":[],"lastnames":["Studer"],"suffixes":[]}],"title":"Formalizing non-termination of recursive programs","journal":"Journal of Logic and Algebraic Programming","volume":"49","number":"1–2","pages":"1–14","url":"2001/ks01.pdf","year":"2001","bibtex":"@Article{ks01,\n Author = {Reinhard Kahle and Thomas Studer},\n Title = {Formalizing non-termination of recursive programs},\n Journal = {Journal of Logic and Algebraic Programming},\n Volume = {49},\n Number = {1{--}2},\n Pages = {1{--}14},\n url = {2001/ks01.pdf},\n year = 2001\n}\n\n","author_short":["Kahle, R.","Studer, T."],"key":"ks01","id":"ks01","bibbaseid":"kahle-studer-formalizingnonterminationofrecursiveprograms-2001","role":"author","urls":{"Paper":"http://home.inf.unibe.ch/~brambi/2001/ks01.pdf"},"downloads":0},"bibtype":"article","biburl":"http://home.inf.unibe.ch/~brambi/ltg.bib","creationDate":"2020-02-26T09:06:59.073Z","downloads":0,"keywords":[],"search_terms":["formalizing","non","termination","recursive","programs","kahle","studer"],"title":"Formalizing non-termination of recursive programs","year":2001,"dataSources":["jFQMeatnEb8qn3qdH"]}