{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:44Z","timestamp":1725455624233},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540557075"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023871","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:02:35Z","timestamp":1132380155000},"page":"163-173","source":"Crossref","is-referenced-by-count":0,"title":["Intensionally stable functions"],"prefix":"10.1007","author":[{"given":"B.","family":"Gamate","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"G. Berry: Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des lambda-calculs typ\u00e9s Th\u00e8se de doctorat d'\u00e9tat, U. Paris VII"},{"key":"14_CR2","unstructured":"P.L. Curien: Categorical combinators, sequential algorithms and functional programming Research Notes in Theoretical Computer Science"},{"key":"14_CR3","unstructured":"G. Kahn & G. Plotkin: Structures de donn\u00e9es concr\u00e8tes Rapport IRIA-LABORIA 336"},{"key":"14_CR4","unstructured":"B. Gamatie: On sequential functions Rapport INRIA 1138"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"R. Milner: Fully abstract models of typed lambda-calculi TCS 4(1), 1\u201323","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"M. Nielsen, G. Plotkin, G. Winskel: Petri nets, event structures and domains TCS 13 85\u2013108","DOI":"10.1016\/0304-3975(81)90112-2"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"G. Plotkin: LCF considered as a programming language TCS 5(3), 223\u2013256","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"14_CR8","unstructured":"J. Vuillemin: Proof techniques for recursive programs Thesis Stanford U."}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science \u2014 Tver '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023871.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:57Z","timestamp":1607550657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540557075"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0023871","relation":{},"subject":[]}}