{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:06:51Z","timestamp":1725566811280},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540235804"},{"type":"electronic","value":"9783540301752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30175-2_8","type":"book-chapter","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T19:34:58Z","timestamp":1285270498000},"page":"136-167","source":"Crossref","is-referenced-by-count":16,"title":["Meta-programming with Typed Object-Language Representations"],"prefix":"10.1007","author":[{"given":"Emir","family":"Pa\u0161ali\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Linger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Cheney, J., Hinze, R.: First class phantom types. Technical Report CUCIS TR2003-1901, Cornell University (2003), http:\/\/techreports.library.cornell.edu:8081\/Dienst\/UI\/1.0\/Display\/cul.cis\/TR2003-1901","key":"8_CR1"},{"doi-asserted-by":"crossref","unstructured":"Sheard, T., Benaissa, Z., Pa\u0161ali\u0107, E.: DSL implementation using staging and monads. In: Second Conference on Domain-Specific Languages (DSL 1999), Austin, Texas, USEUNIX (1999)","key":"8_CR2","DOI":"10.1145\/331960.331975"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-44978-7_15","volume-title":"Programs as Data Objects","author":"W. Taha","year":"2001","unstructured":"Taha, W., Makholm, H., Hughes, J.: Tag elimination and jones-optimality. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol.\u00a02053, p. 257. Springer, Heidelberg (2001)"},{"key":"8_CR4","volume-title":"The International Conference on Functional Programming (ICFP 2002)","author":"E. Pa\u0161ali\u0107","year":"2002","unstructured":"Pa\u0161ali\u0107, E., Taha, W., Sheard, T.: Tagless staged interpreters for typed languages. In: The International Conference on Functional Programming (ICFP 2002), Pittsburgh, USA, ACM, New York (2002)"},{"key":"8_CR5","first-page":"381","volume":"34","author":"N.G.D. Bruijn","year":"1972","unstructured":"Bruijn, N.G.d.: Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem. Indagaciones Mathematische\u00a034, 381\u2013392 (1972); This also appeared in the Proceedings of the Koninklijke Nederlandse Akademie van Wetenschappen, Amsterdam, series A, 75(5)","journal-title":"Indagaciones Mathematische"},{"doi-asserted-by":"crossref","unstructured":"Baars, A.I., Swierstra, S.D.: Typing dynamic typing. In: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP 2002), Pittsburgh, Pennsylvania, USA, October 4-6 (2002);","key":"#cr-split#-8_CR6.1","DOI":"10.1145\/581478.581494"},{"doi-asserted-by":"crossref","unstructured":"SIGPLAN Notices 37(9), ACM Press (2002)","key":"#cr-split#-8_CR6.2","DOI":"10.1145\/596992.596996"},{"unstructured":"Cheney, J., Hinze, R.: Phantom types (2003), Available from http:\/\/www.informatik.uni-bonn.de\/~ralf\/publications\/Phantom.pdf","key":"8_CR7"},{"key":"8_CR8","series-title":"ACM Sigplan Notices","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/351240.351246","volume-title":"Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP 2000)","author":"S. Weirich","year":"2000","unstructured":"Weirich, S.: Type-safe cast: functional pearl. In: Proceedings of the ACM Sigplan International Conference on Functional Programming (ICFP 2000). ACM Sigplan Notices, vol.\u00a035(9), pp. 58\u201367. ACM Press, New York (2000)"},{"key":"8_CR9","series-title":"International Series of Monographs on Computer Science","volume-title":"Programming in Martin-Lof\u2019s Type Theory","author":"B. Nordstr\u00f6m","year":"1990","unstructured":"Nordstr\u00f6m, B., Peterson, K., Smith, J.M.: Programming in Martin-Lof\u2019s Type Theory. International Series of Monographs on Computer Science, vol.\u00a07. Oxford University Press, New York (1990); Currently available online from first authors homepage"},{"unstructured":"Sheard, T., Pasalic, E., Linger, R.N.: The \u03c9mega implementation. Available on request from the author (2003)","key":"8_CR10"},{"unstructured":"Jones, M.P.: Qualified Types: Theory and Practice. PhD thesis, Oxford University, Also available as Programming Research Group technical report 106 (1992)","key":"8_CR11"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1145\/322186.322198","volume":"27","author":"G. Nelson","year":"1980","unstructured":"Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. Journal of the ACM\u00a027, 356\u2013364 (1980)","journal-title":"Journal of the ACM"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/292540.292560","volume-title":"Conference Record of POPL 99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"H. Xi","year":"1999","unstructured":"Xi, H., Pfenning, F.: Dependent types in practical programming. In: Conference Record of POPL 99: The 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 214\u2013227. ACM, New York (1999)"},{"doi-asserted-by":"crossref","unstructured":"Taha, W., Sheard, T.: MetaML: Multi-stage programming with explicit annotations. Theoretical Computer Science 248 (2000)","key":"8_CR14","DOI":"10.1016\/S0304-3975(00)00053-0"},{"unstructured":"Taha, W., Calcagno, C., Huang, L., Leroy, X.: MetaOCaml: A compiled, type-safe multi-stage programming language (2001), Available from http:\/\/cs-www.cs.yale.edu\/homes\/taha\/MetaOCaml\/","key":"8_CR15"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/636517.636528","volume":"37","author":"T. Sheard","year":"2002","unstructured":"Sheard, T., Jones, S.P.: Template meta-programming for Haskell. ACM SIGPLAN Notices\u00a037, 60\u201375 (2002)","journal-title":"ACM SIGPLAN Notices"},{"key":"8_CR17","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs (1993), Avaiable online from http:\/\/www.dina.dk\/~sestoft"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-44978-7_15","volume-title":"Programs as Data Objects","author":"W. Taha","year":"2001","unstructured":"Taha, W., Makholm, H., Hughes, J.: Tag elimination and Jones-optimality. In: Danvy, O., Filinski, A. (eds.) PADO 2001. LNCS, vol.\u00a02053, pp. 257\u2013275. Springer, Heidelberg (2001)"},{"unstructured":"Huang, L., Taha, W.: A practical implementation of tag elimination (2002) (in preperation)","key":"8_CR19"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/568173.568176","volume-title":"Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIA-PEPM)","author":"T. Sheard","year":"2002","unstructured":"Sheard, T., Linger, N.: Search-based binding time analysis using type-directed pruning. In: Proceedings of the ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation (ASIA-PEPM), pp. 20\u201331. ACM Press, New York (2002)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_22","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"N. Linger","year":"2004","unstructured":"Linger, N., Sheard, T.: Binding-time analysis for metaml via type inference and constraint solving. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, Springer, Heidelberg (2004)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/581690.581698","volume-title":"Proc. of the workshop on Haskell","author":"J. Cheney","year":"2002","unstructured":"Cheney, J., Hinze, R.: A lightweight implementation of generics and dynamics. In: Proc. of the workshop on Haskell, pp. 90\u2013104. ACM Press, New York (2002)"},{"doi-asserted-by":"crossref","unstructured":"Leijen, D., Meijer, E.: Domain-specific embedded compilers. In: Proceedings of the 2nd Conference on Domain-Specific Languages, Berkeley, CA, USENIX Association, pp. 109\u2013122 (1999)","key":"8_CR23","DOI":"10.1145\/331960.331977"},{"key":"8_CR24","series-title":"ACM SIGPLAN Notices","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/604131.604150","volume-title":"Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2003)","author":"H. Xi","year":"2003","unstructured":"Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: Norris, C., Fenwick, J.J.B. (eds.) Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (POPL 2003). ACM SIGPLAN Notices, vol.\u00a038(1), pp. 224\u2013235. ACM Press, New York (2003)"},{"key":"8_CR25","first-page":"194","volume-title":"Proceedings Symposium on Logic in Computer Science","author":"R. Harper","year":"1987","unstructured":"Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. In: Proceedings Symposium on Logic in Computer Science, Washington, pp. 194\u2013204. IEEE Computer Society Press, Los Alamitos (1987); The conference was held at Cornell University, Ithaca, New York"},{"key":"8_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-48660-7_14","volume-title":"Automated Deduction - CADE-16","author":"F. Pfenning","year":"1999","unstructured":"Pfenning, F., Sch\u00fcrmann, C.: System description: Twelf \u2013 A meta-logical framework for deductive systems. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 202\u2013206. Springer, Heidelberg (1999)"},{"unstructured":"Barras, B., Boutin, S., Cornes, C., Courant, J., Filliatre, J., Gim\u00e9nez, E., Herbelin, H., Huet, G., Mu\u00f1oz, C., Murthy, C., Parent, C., Paulin, C., Sa\u00edbi, A., Werner, B.: The Coq Proof Assistant Reference Manual \u2013 Version V6.1. Technical Report 0203, INRIA (1997)","key":"8_CR27"},{"unstructured":"Augustsson, L., Carlsson, M.: An exercise in dependent types: A well-typed interpreter. In: Workshop on Dependent Types in Programming, Gothenburg (1999), Available online from www.cs.chalmers.se\/~augustss\/cayenne\/interp.ps","key":"8_CR28"},{"doi-asserted-by":"crossref","unstructured":"Chen, C., Xi, H.: Meta-Programming through Typeful Code Representation. In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, Uppsala, Sweden, pp. 275\u2013286 (2003)","key":"8_CR29","DOI":"10.1145\/944705.944730"},{"key":"8_CR30","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1145\/242224.242477","volume":"28","author":"P. Hudak","year":"1996","unstructured":"Hudak, P.: Building domain-specific embedded languages. ACM Computing Surveys\u00a028, 196 (1996)","journal-title":"ACM Computing Surveys"},{"key":"8_CR31","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1017\/S0956796898003141","volume":"8","author":"C. Elliott","year":"1998","unstructured":"Elliott, C., Finne, S., de Moor, O.: Compiling embedded languages. Journal of Functional Programming\u00a08, 543\u2013572 (1998)","journal-title":"Journal of Functional Programming"},{"key":"8_CR32","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1145\/641909.641910","volume":"25","author":"M. Rhiger","year":"2003","unstructured":"Rhiger, M.: A foundation for embedded languages. ACM Transactions on Programming Languages and Systems TOPLAS\u00a025, 291\u2013315 (2003)","journal-title":"ACM Transactions on Programming Languages and Systems TOPLAS"},{"key":"8_CR33","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1017\/S0956796800001945","volume":"6","author":"Z.E.A. Benaissa","year":"1996","unstructured":"Benaissa, Z.E.A., Briaud, D., Lescanne, P., Rouyer-Degli, J.: \u03bb\u03bd, a calculus of explicit substitutions which preserves strong normalisation. Journal of Functional Programming\u00a06, 699\u2013722 (1996)","journal-title":"Journal of Functional Programming"},{"unstructured":"Jones, M.P.: The hugs 98 user manual (2000)","key":"8_CR34"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","volume-title":"Generative Programming and Component Engineering (GPCE)","author":"C. Calcagno","year":"2003","unstructured":"Calcagno, C., Taha, W., Huang, L., Leroy, X.: Implementing multi-stage languages using ASTs, gensym, and reflection. In: Czarnecki, K., Pfenning, F., Smaragdakis, Y. (eds.) Generative Programming and Component Engineering (GPCE). LNCS, Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Generative Programming and Component Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30175-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:45:16Z","timestamp":1605761116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30175-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540235804","9783540301752"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30175-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}