{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:50:29Z","timestamp":1725562229576},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_3","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"12-26","source":"Crossref","is-referenced-by-count":6,"title":["Choice in Dynamic Linking"],"prefix":"10.1007","author":[{"given":"Mart\u00edn","family":"Abadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georges","family":"Gonthier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Avigad, J., Zach, R.: The epsilon calculus. In the Stanford Encyclopedia of Philosophy, version of May 3 (2002) on the web at, \n                    \n                      http:\/\/plato.stanford.edu\/entries\/epsilon-calculus\n                    \n                    \n                  ,"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Cardelli, L.: Program fragments, linking, and modularization. In: Conference Record of POPL 1997: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January15\u201317 pp. 266\u2013277 (1997)","DOI":"10.1145\/263699.263735"},{"key":"3_CR3","first-page":"2208","volume-title":"The Computer Science and Engineering Handbook, ch. 103","author":"L. Cardelli","year":"1997","unstructured":"Cardelli, L.: Type systems. In: Tucker, A.B. (ed.) The Computer Science and Engineering Handbook, ch. 103, pp. 2208\u20132236. CRC Press, Boca Raton (1997)"},{"key":"3_CR4","unstructured":"Cardelli, L., Leroy, X.: Abstract types and the dot notation. In: Proceedings of the IFIP TC2 Working Conference on Programming Concepts and Methods, North Holland, pp. 479\u2013504 (1990)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Dean, D.: The security of static typing with dynamic linking. In: Proceedings of the Fourth ACM Conference on Computer and Communications Security, pp. 18\u201327 (1997)","DOI":"10.1145\/266420.266428"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Drossopoulou, S., Eisenbach, S., Wragg, D.: A fragment calculus\u2014 towards a model of separate compilation, linking and binary compatibility. In: Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, pp. 147\u2013156 (1999)","DOI":"10.1109\/LICS.1999.782606"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/3-540-36575-3_4","volume-title":"Programming Languages and Systems","author":"S. Drossopoulou","year":"2003","unstructured":"Drossopoulou, S., Lagorio, G., Eisenbach, S.: Flexible models for dynamic linking. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 38\u201353. Springer, Heidelberg (2003)"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.2307\/2272162","volume":"40","author":"T.B. Flannagan","year":"1975","unstructured":"Flannagan, T.B.: On an extension of Hilbert\u2019s second \u03b5-theorem. Journal of Symbolic Logic\u00a040(3), 393\u2013397 (1975)","journal-title":"Journal of Symbolic Logic"},{"key":"3_CR9","unstructured":"Girard, J.-Y.: Interpr\u00e9tation Fonctionnelle et Elimination des Coupures de l\u2019Arithm\u00e9tique d\u2019Ordre Sup\u00e9rieur. Th\u00e8se de doctorat d\u2019\u00e9tat, Universit\u00e9 Paris VII (June 1972)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Glew, N., Morrisett, G.: Type safe linking and modular assembly language. In: Conference Record of POPL 1999: 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 250\u2013261 (January 1999)","DOI":"10.1145\/292540.292563"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(99)00036-8","volume":"70","author":"R. Harper","year":"1999","unstructured":"Harper, R., Mitchell, J.C.: Parametricity and variants of Girard\u2019s J operator. Information Processing Letters\u00a070(1), 1\u20135 (1999)","journal-title":"Information Processing Letters"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45332-6_6","volume-title":"Types in Compilation","author":"M. Hicks","year":"2001","unstructured":"Hicks, M., Weirich, S., Crary, K.: Safe and flexible dynamic linking of native code. In: Harper, R. (ed.) TIC 2000. LNCS, vol.\u00a02071, Springer, Heidelberg (2001)"},{"key":"3_CR13","unstructured":"Krivine, J.-L.: Two talks about specifications and objects. Lectures at TYPES Spring School (March 2002)"},{"key":"3_CR14","volume-title":"Mathematical Logic and Hilbert\u2019s \u03b5-Symbol","author":"C. Leisenring","year":"1969","unstructured":"Leisenring, C.: Mathematical Logic and Hilbert\u2019s \u03b5-Symbol. Gordon and Breach Science Publishers, New York (1969)"},{"key":"3_CR15","unstructured":"Leivant, D.: Existential instantiation in a system of natural deduction for intuitionistic arithmetics. Technical report, Stichting Mathematisch Centrum. Note ZW 13\/73"},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01091551","volume":"8","author":"G. Mints","year":"1977","unstructured":"Mints, G.: Heyting predicate calculus with epsilon-symbol. Journal of Soviet Mathematics\u00a08, 317\u2013323 (1977); Preprint provided by the author with an indication that the paper appeared in Selected Papers in Proof Theory","journal-title":"Journal of Soviet Mathematics"},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.2307\/2275811","volume":"61","author":"G. Mints","year":"1996","unstructured":"Mints, G.: Strong termination for the epsilon substitution method. Journal of Symbolic Logic\u00a061(4), 1193\u20131205 (1996)","journal-title":"Journal of Symbolic Logic"},{"key":"3_CR18","unstructured":"Mints, G.: Private communication (2000)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Mitchell, J.C., Plotkin, G.D.: Abstract types have existential type. In: Proceedings of the Twelfth Annual ACM Symposium on Principles of Programming Languages, pp. 37\u201351 (1985)","DOI":"10.1145\/318593.318606"},{"volume-title":"Systems Programming in Modula-3","year":"1991","key":"3_CR20","unstructured":"Nelson, G. (ed.): Systems Programming in Modula-3. Prentice Hall, Englewood Cliffs (1991)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T18:12:37Z","timestamp":1552846357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}