{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:29Z","timestamp":1725456329398},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055498X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013608","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:35:56Z","timestamp":1132727756000},"page":"181-191","source":"Crossref","is-referenced-by-count":0,"title":["Logical and computational invariants of programs"],"prefix":"10.1007","author":[{"given":"Lars","family":"Halln\u00e4s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"M. Aronsson et. al. The programming language GCLA; a definitional approach to logic programming New Generation Computing, 4, 1990.","DOI":"10.1007\/BF03037453"},{"key":"7_CR2","unstructured":"M.Aronsson et.al. A survey of GCLA: A definitional approach to logic programming, in: P. Schroeder-Heister (ed.), Extensions of Logic Programming: Proceedings of a workshop held at the SNS, Universit\u00e4t T\u00fcbingen, 1989, Springer Lecture Notes in Artificial Intelligence."},{"key":"7_CR3","unstructured":"D.Fredholm, S.Serafimovski, Partial inductive definitions as type systems for \u03bb-terms, in: Dybjer et.al. (ed.), Proceedings of the 1989 workshop on programming logic in B\u00e5stad, Chalmers 1990. (To appear in BIT.)"},{"key":"7_CR4","unstructured":"D. Fredholm, On function definitions I. Basic notions and primitive recursive function definitions, Licentiate thesis Chalmers 1990."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"L. Halln\u00e4s, Partial inductive definitions, TCS 87,1991.","DOI":"10.1016\/S0304-3975(06)80007-1"},{"key":"7_CR6","unstructured":"L. Halln\u00e4s, B. Nordstr\u00f6m, A definitional view of functional programming in: Dybjer et.al. (ed.), Proceedings of the 1989 workshop on programming logic in B\u00e5stad, Chalmers 1990."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"L. Halln\u00e4s, P. Schroeder-Heister, A proof theoretic approach to logic programming I,II Journal of logic and computation 1990\u201391","DOI":"10.1093\/logcom\/1.2.261"},{"key":"7_CR8","unstructured":"P. Schroeder-Heister, Hypothetical reasoning and definitional reflection in logic programming, in: P. Schroeder-Heister (ed.), Extensions of Logic Programming: Proceedings of a workshop held at the SNS, Universit\u00e4t T\u00fcbingen, 1989, Springer Lecture Notes in Artificial Intelligence."}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0013608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:27:39Z","timestamp":1586579259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055498X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0013608","relation":{},"subject":[]}}