{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:30Z","timestamp":1751983650028},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665403"},{"type":"electronic","value":"9783540481645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10704567_23","type":"book-chapter","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T18:27:08Z","timestamp":1167330428000},"page":"378-395","source":"Crossref","is-referenced-by-count":20,"title":["A Semantic Account of Type-Directed Partial Evaluation"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Filinski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0037100","volume-title":"Typed Lambda Calculi and Applications","author":"U. Berger","year":"1993","unstructured":"Berger, U.: Program extraction from normalization proofs. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 91\u2013106. Springer, Heidelberg (1993)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Berger, U., Schwichtenberg, H.: An inverse of the evaluation functional for typed \u03bb-calculus. In: Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, Amsterdam, The Netherlands, July 1991, pp. 203\u2013211 (1991)","DOI":"10.1109\/LICS.1991.151645"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0960129596002150","volume":"7","author":"T. Coquand","year":"1997","unstructured":"Coquand, T., Dybjer, P.: Intuitionistic model constructions and nor- malization proofs. Mathematical Structures in Computer Science\u00a07, 75\u201394 (1997)","journal-title":"Mathematical Structures in Computer Science"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Danvy, O.: Type-directed partial evaluation. In: 23rd ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, January 1996, pp. 242\u2013257 (1996)","DOI":"10.1145\/237721.237784"},{"key":"23_CR5","unstructured":"Danvy, O.: Online type-directed partial evaluation. In: Sato, M., Toyama, Y. (eds.) Proceedings of the Third Fuji International Symposium on Functional and Logic Programming, Kyoto, Japan, April 1998, pp. 271\u2013295 (1998)"},{"key":"23_CR6","unstructured":"Danvy, O.: Type-directed partial evaluation. Lecture Notes BRICS LN-98-3, Department of Computer Science, University of Aarhus, Aarhus, Denmark (December 1998); To appear in LNCS"},{"key":"23_CR7","unstructured":"Danvy, O., Dybjer, P. (eds.): Preliminary Proceedings of the APPSEM Workshop on Normalization by Evaluation, Chalmers, Sweeden (May 1998) BRICS Note NS-98-1"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-61756-6_85","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"O. Danvy","year":"1996","unstructured":"Danvy, O., Vestergaard, R.: Semantics-based compiling: A case study in type-directed partial evaluation. In: Kuchen, H., Swierstra, S.D. (eds.) PLILP 1996. LNCS, vol.\u00a01140, pp. 182\u2013197. Springer, Heidelberg (1996)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Davies, R., Pfenning, F.: A modal analysis of staged computation. In: 23rd ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, January 1996, pp. 258\u2013270 (1996)","DOI":"10.1145\/237721.237788"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing monads. In: Proceedings of the 21st ACM SIGPLAN- SIGACT Symposium on Principles of Programming Languages, Portland, Oregon, January 1994, pp. 446\u2013457 (1994)","DOI":"10.1145\/174675.178047"},{"key":"23_CR11","first-page":"122","volume-title":"Proceedings of the IEEE International Conference on Computer Languages","author":"L. William","year":"1998","unstructured":"William, L.: Modular compilers based on monad transformers. In: Proceedings of the IEEE International Conference on Computer Languages, Chicago, Illinois, pp. 122\u2013131. IEEE Computer Society, Los Alamitos (1998)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-49366-2_15","volume-title":"Advances in Computing Science - ASIAN\u201998","author":"S. Helsen","year":"1998","unstructured":"Helsen, S., Thiemann, P.: Two flavors of offline partial evaluation. In: Hsiang, J., Ohori, A. (eds.) ASIAN 1998. LNCS, vol.\u00a01538, pp. 188\u2013205. Springer, Heidelberg (1998)"},{"key":"23_CR13","unstructured":"Holst, C.K., Launchbury, J.: Handwriting cogen to avoid problems with static typing. In: Draft Proceedings, Fourth Annual Glasgow Workshop on Functional Programming, Skye, Scotland, pp. 210\u2013218 (1991)"},{"key":"23_CR14","volume-title":"Prentice Hall International Series in Computer Science","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. In: Prentice Hall International Series in Computer Science, Prentice-Hall, Englewood Cliffs (1993)"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/LICS.1989.39155","volume-title":"Proceedings of the Fourth Annual Symposium on Logic in Computer Science","author":"E. Moggi","year":"1989","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science, Pacific Grove, California, pp. 14\u201323. IEEE, Los Alamitos (1989)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49099-X_13","volume-title":"Programming Languages and Systems","author":"E. Moggi","year":"1999","unstructured":"Moggi, E., Taha, W., Benaissa, Z.E.-A., Sheard, T.: An idealized MetaML: Simpler and more expressive. In: Swierstra, S.D. (ed.) ESOP 1999. LNCS, vol.\u00a01576, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G.D. Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theoretical Computer Science\u00a05(3), 223\u2013255 (1977)","journal-title":"Theoretical Computer Science"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Yang, Z.: Encoding types in ML-like languages. In: International Conference on Functional Programming, Baltimore, Maryland, September 1998, pp. 289\u2013300 (1998)","DOI":"10.1145\/289423.289458"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10704567_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T21:56:42Z","timestamp":1552859802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10704567_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665403","9783540481645"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/10704567_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}