{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T23:10:43Z","timestamp":1765667443014,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T00:00:00Z","timestamp":1697932800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,22]]},"DOI":"10.1145\/3610612.3610623","type":"proceedings-article","created":{"date-parts":[[2023,10,16]],"date-time":"2023-10-16T23:13:48Z","timestamp":1697498028000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Strongly-Typed Multi-View Stack-Based Computations"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3688-0957","authenticated-orcid":false,"given":"Pieter","family":"Koopman","sequence":"first","affiliation":[{"name":"Radboud University, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4015-4878","authenticated-orcid":false,"given":"Mart","family":"Lubbers","sequence":"additional","affiliation":[{"name":"Radboud University, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"volume-title":"Proceedings of the 2nd Java Virtual Machine Research and Technology Symposium. USENIX Association, USA.","key":"e_1_3_2_1_1_1","unstructured":"2002. Proceedings of the 2nd Java Virtual Machine Research and Technology Symposium. USENIX Association, USA. 2002. Proceedings of the 2nd Java Virtual Machine Research and Technology Symposium. USENIX Association, USA."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680900728X"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. ACM Program. Lang. 2, POPL, Article 16 (dec","author":"Bach\u00a0Poulsen Casper","year":"2017","unstructured":"Casper Bach\u00a0Poulsen , Arjen Rouvoet , Andrew Tolmach , Robbert Krebbers , and Eelco Visser . 2017 . Intrinsically-Typed Definitional Interpreters for Imperative Languages . Proc. ACM Program. Lang. 2, POPL, Article 16 (dec 2017), 34\u00a0pages. https:\/\/doi.org\/10.1145\/3158104 10.1145\/3158104 Casper Bach\u00a0Poulsen, Arjen Rouvoet, Andrew Tolmach, Robbert Krebbers, and Eelco Visser. 2017. Intrinsically-Typed Definitional Interpreters for Imperative Languages. Proc. ACM Program. Lang. 2, POPL, Article 16 (dec 2017), 34\u00a0pages. https:\/\/doi.org\/10.1145\/3158104"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","first-page":"e14","DOI":"10.1017\/S0956796815000180","article-title":"Calculating correct compilers","volume":"25","author":"Bahr Patrick","year":"2015","unstructured":"Patrick Bahr and Graham Hutton . 2015 . Calculating correct compilers . Journal of Functional Programming 25 (2015), e14 . https:\/\/doi.org\/10.1017\/S0956796815000180 10.1017\/S0956796815000180 Patrick Bahr and Graham Hutton. 2015. Calculating correct compilers. Journal of Functional Programming 25 (2015), e14. https:\/\/doi.org\/10.1017\/S0956796815000180","journal-title":"Journal of Functional Programming"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2008.12.006"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411226"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc Joint CS\/CE Winter Meeting, Chalmers Univerity","author":"Hallgren Thomas","year":"2001","unstructured":"Thomas Hallgren . 2001 . Fun with functional dependencies . In Proc Joint CS\/CE Winter Meeting, Chalmers Univerity , Varberg, Sweden. Thomas Hallgren. 2001. Fun with functional dependencies. In Proc Joint CS\/CE Winter Meeting, Chalmers Univerity, Varberg, Sweden."},{"key":"e_1_3_2_1_10_1","first-page":"29","article-title":"The Principal Type-Scheme of an Object in Combinatory","volume":"146","author":"Hindley R.","year":"1969","unstructured":"R. Hindley . 1969 . The Principal Type-Scheme of an Object in Combinatory Logic. Trans. Amer. Math. Soc. 146 (1969), 29 \u2013 60 . http:\/\/www.jstor.org\/stable\/1995158 R. Hindley. 1969. The Principal Type-Scheme of an Object in Combinatory Logic. Trans. Amer. Math. Soc. 146 (1969), 29\u201360. http:\/\/www.jstor.org\/stable\/1995158","journal-title":"Logic. Trans. Amer. Math. Soc."},{"volume-title":"Godel","author":"Hofstadter R.","key":"e_1_3_2_1_11_1","unstructured":"Douglas\u00a0 R. Hofstadter . 1979. Godel , Escher, Bach : An Eternal Golden Braid. Basic Books , Inc., USA. Douglas\u00a0R. Hofstadter. 1979. Godel, Escher, Bach: An Eternal Golden Braid. Basic Books, Inc., USA."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(86)90059-1","article-title":"A novel representation of lists and its application to the function \u201creverse","volume":"22","author":"John\u00a0Muir Hughes R.","year":"1986","unstructured":"R. John\u00a0Muir Hughes . 1986 . A novel representation of lists and its application to the function \u201creverse \u201d. Inform. Process. Lett. 22 , 3 (1986), 141 \u2013 144 . https:\/\/doi.org\/10.1016\/0020-0190(86)90059-1 10.1016\/0020-0190(86)90059-1 R.John\u00a0Muir Hughes. 1986. A novel representation of lists and its application to the function \u201creverse\u201d. Inform. Process. Lett. 22, 3 (1986), 141\u2013144. https:\/\/doi.org\/10.1016\/0020-0190(86)90059-1","journal-title":"Inform. Process. Lett."},{"key":"e_1_3_2_1_13_1","first-page":"4","article-title":"Efficient Compilation of Lazy Evaluation","volume":"39","author":"Johnsson Thomas","year":"2004","unstructured":"Thomas Johnsson . 2004 . Efficient Compilation of Lazy Evaluation . SIGPLAN Not. 39 , 4 (apr 2004), 125\u2013138. https:\/\/doi.org\/10.1145\/989393.989409 10.1145\/989393.989409 Thomas Johnsson. 2004. Efficient Compilation of Lazy Evaluation. SIGPLAN Not. 39, 4 (apr 2004), 125\u2013138. https:\/\/doi.org\/10.1145\/989393.989409","journal-title":"SIGPLAN Not."},{"key":"e_1_3_2_1_14_1","first-page":"2","article-title":"Language and Program Design for Functional Dependencies","volume":"44","author":"Jones P.","year":"2008","unstructured":"Mark\u00a0 P. Jones and Iavor\u00a0 S. Diatchki . 2008 . Language and Program Design for Functional Dependencies . SIGPLAN Not. 44 , 2 (sep 2008), 87\u201398. https:\/\/doi.org\/10.1145\/1543134.1411298 10.1145\/1543134.1411298 Mark\u00a0P. Jones and Iavor\u00a0S. Diatchki. 2008. Language and Program Design for Functional Dependencies. SIGPLAN Not. 44, 2 (sep 2008), 87\u201398. https:\/\/doi.org\/10.1145\/1543134.1411298","journal-title":"SIGPLAN Not."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation","author":"Keijzer Maarten","year":"2013","unstructured":"Maarten Keijzer . 2013 . Push-Forth: A Light-Weight, Strongly-Typed, Stack-Based Genetic Programming Language . In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation ( Amsterdam, The Netherlands) (GECCO \u201913 Companion). Association for Computing Machinery, New York, NY, USA, 1635\u20131640. https:\/\/doi.org\/10.1145\/2464576.2482742 10.1145\/2464576.2482742 Maarten Keijzer. 2013. Push-Forth: A Light-Weight, Strongly-Typed, Stack-Based Genetic Programming Language. In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation (Amsterdam, The Netherlands) (GECCO \u201913 Companion). Association for Computing Machinery, New York, NY, USA, 1635\u20131640. https:\/\/doi.org\/10.1145\/2464576.2482742"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017472.1017488"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250502"},{"key":"e_1_3_2_1_18_1","first-page":"5","article-title":"Polymorphic Type Inference and Abstract Data Types","volume":"16","author":"L\u00e4ufer Konstantin","year":"1994","unstructured":"Konstantin L\u00e4ufer and Martin Odersky . 1994 . Polymorphic Type Inference and Abstract Data Types . ACM Trans. Program. Lang. Syst. 16 , 5 (sep 1994), 1411\u20131430. https:\/\/doi.org\/10.1145\/186025.186031 10.1145\/186025.186031 Konstantin L\u00e4ufer and Martin Odersky. 1994. Polymorphic Type Inference and Abstract Data Types. ACM Trans. Program. Lang. Syst. 16, 5 (sep 1994), 1411\u20131430. https:\/\/doi.org\/10.1145\/186025.186031","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 2nd Conference on Domain-Specific Languages","author":"Leijen Daan","year":"2000","unstructured":"Daan Leijen and Erik Meijer . 2000 . Domain Specific Embedded Compilers . In Proceedings of the 2nd Conference on Domain-Specific Languages ( Austin, Texas, USA) (DSL \u201999). Association for Computing Machinery, New York, NY, USA, 109\u2013122. https:\/\/doi.org\/10.1145\/33 1960.331977 10.1145\/331960.331977 Daan Leijen and Erik Meijer. 2000. Domain Specific Embedded Compilers. In Proceedings of the 2nd Conference on Domain-Specific Languages (Austin, Texas, USA) (DSL \u201999). Association for Computing Machinery, New York, NY, USA, 109\u2013122. https:\/\/doi.org\/10.1145\/331960.331977"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-009-9155-4"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3412932.3412936"},{"key":"e_1_3_2_1_22_1","series-title":"May 2011","volume-title":"Haskell 2010 language report. Available online http:\/\/www. haskell. org\/","author":"Simon Marlow","year":"2010","unstructured":"Simon Marlow 2010. Haskell 2010 language report. Available online http:\/\/www. haskell. org\/ ( May 2011 ) ( 2010 ). Simon Marlow 2010. Haskell 2010 language report. Available online http:\/\/www. haskell. org\/(May 2011) (2010)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004355"},{"key":"e_1_3_2_1_24_1","volume-title":"A type-correct, stack-safe, provably correct, expression compiler in Epigram. J. Funct. Program. Submitted","author":"McKinna James","year":"2006","unstructured":"James McKinna and Joel Wright . 2006. A type-correct, stack-safe, provably correct, expression compiler in Epigram. J. Funct. Program. Submitted ( 2006 ). James McKinna and Joel Wright. 2006. A type-correct, stack-safe, provably correct, expression compiler in Epigram. J. Funct. Program. Submitted (2006)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796801004178"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/319301.319345"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of 2001 Haskell Workshop. 101\u2013120","author":"Neubauer Matthias","year":"2001","unstructured":"Matthias Neubauer , Peter Thiemann , Martin Gasbichler , and Michael Sperber . 2001 . A functional notation for functional dependencies . In Proceedings of 2001 Haskell Workshop. 101\u2013120 . Matthias Neubauer, Peter Thiemann, Martin Gasbichler, and Michael Sperber. 2001. A functional notation for functional dependencies. In Proceedings of 2001 Haskell Workshop. 101\u2013120."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796806006034"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/53990.54010"},{"key":"e_1_3_2_1_32_1","volume-title":"Clean Language Report. https:\/\/wiki.clean.cs.ru.nl\/download\/html_report\/CleanRep.2.2_1.htm [Online","author":"Plasmeijer Rinus","year":"2022","unstructured":"Rinus Plasmeijer , Marko van Eekelen , and John van Groningen . 2012. Clean Language Report. https:\/\/wiki.clean.cs.ru.nl\/download\/html_report\/CleanRep.2.2_1.htm [Online ; accessed 5- December - 2022 ]. Rinus Plasmeijer, Marko van Eekelen, and John van Groningen. 2012. Clean Language Report. https:\/\/wiki.clean.cs.ru.nl\/download\/html_report\/CleanRep.2.2_1.htm [Online; accessed 5-December-2022]."},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. ACM Program. Lang. 4, ICFP, Article 89 (aug","author":"Serrano Alejandro","year":"2020","unstructured":"Alejandro Serrano , Jurriaan Hage , Simon Peyton\u00a0Jones , and Dimitrios Vytiniotis . 2020 . A Quick Look at Impredicativity . Proc. ACM Program. Lang. 4, ICFP, Article 89 (aug 2020), 29\u00a0pages. https:\/\/doi.org\/10.1145\/3408971 10.1145\/3408971 Alejandro Serrano, Jurriaan Hage, Simon Peyton\u00a0Jones, and Dimitrios Vytiniotis. 2020. A Quick Look at Impredicativity. Proc. ACM Program. Lang. 4, ICFP, Article 89 (aug 2020), 29\u00a0pages. https:\/\/doi.org\/10.1145\/3408971"},{"volume-title":"The female of a pair of recurrences.https:\/\/oeis.org\/A005378. [Online","year":"2023","key":"e_1_3_2_1_34_1","unstructured":"Slone. 2023. The female of a pair of recurrences.https:\/\/oeis.org\/A005378. [Online ; accessed 23- May - 2023 ]. Slone. 2023. The female of a pair of recurrences.https:\/\/oeis.org\/A005378. [Online; accessed 23-May-2023]."},{"key":"e_1_3_2_1_35_1","volume-title":"ACM SIGPLAN\u201996 Conference on Programming Language Design and Implementation (PLDI\u201996)","author":"Stone A.","year":"1996","unstructured":"Christopher\u00a0 A. Stone , David Tarditi , Greg Morrisett , Perry Cheng , Peter Lee , and Robert Harper . 1996 . The TIL\/ML Compiler: Performance and Safety through Types . In ACM SIGPLAN\u201996 Conference on Programming Language Design and Implementation (PLDI\u201996) . Christopher\u00a0A. Stone, David Tarditi, Greg Morrisett, Perry Cheng, Peter Lee, and Robert Harper. 1996. The TIL\/ML Compiler: Performance and Safety through Types. In ACM SIGPLAN\u201996 Conference on Programming Language Design and Implementation (PLDI\u201996)."},{"key":"e_1_3_2_1_36_1","first-page":"4","article-title":"More Dependent Types for Distributed Arrays","volume":"23","author":"Swierstra Wouter","year":"2010","unstructured":"Wouter Swierstra . 2010 . More Dependent Types for Distributed Arrays . Higher Order Symbol. Comput. 23 , 4 (nov 2010), 489\u2013506. https:\/\/doi.org\/10.1007\/s10990-011-9075-y 10.1007\/s10990-011-9075-y Wouter Swierstra. 2010. More Dependent Types for Distributed Arrays. Higher Order Symbol. Comput. 23, 4 (nov 2010), 489\u2013506. https:\/\/doi.org\/10.1007\/s10990-011-9075-y","journal-title":"Higher Order Symbol. Comput."},{"volume-title":"Inside the Java 2 Virtual Machine (2 ed.)","author":"Venners Bill","key":"e_1_3_2_1_37_1","unstructured":"Bill Venners . 2000. Inside the Java 2 Virtual Machine (2 ed.) . McGraw-Hill Companies . Bill Venners. 2000. Inside the Java 2 Virtual Machine (2 ed.). McGraw-Hill Companies."},{"key":"e_1_3_2_1_38_1","volume-title":"International Conference on Functional Programming (ICFP\u201906)","author":"Vytiniotis Dimitrios","year":"2006","unstructured":"Dimitrios Vytiniotis , Stephanie Weirich , and Simon Peyton\u00a0Jones . 2006 . Simple unification-based type inference for GADTs . In International Conference on Functional Programming (ICFP\u201906) . ACM SIGPLAN. https:\/\/www.microsoft.com\/en-us\/research\/publication\/simple-unification-based-type-inference-for-gadts\/2016 ACM SIGPLAN Most Influential ICFP Paper Award. Dimitrios Vytiniotis, Stephanie Weirich, and Simon Peyton\u00a0Jones. 2006. Simple unification-based type inference for GADTs. In International Conference on Functional Programming (ICFP\u201906). ACM SIGPLAN. https:\/\/www.microsoft.com\/en-us\/research\/publication\/simple-unification-based-type-inference-for-gadts\/2016 ACM SIGPLAN Most Influential ICFP Paper Award."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/91556.91592"},{"key":"e_1_3_2_1_40_1","volume-title":"The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Hofstadter_sequence&oldid=1115357514. [Online","author":"Wikipedia","year":"2023","unstructured":"Wikipedia contributors. 2022. Hofstadter sequence \u2014 Wikipedia , The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Hofstadter_sequence&oldid=1115357514. [Online ; accessed 23- May - 2023 ]. Wikipedia contributors. 2022. Hofstadter sequence \u2014 Wikipedia, The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Hofstadter_sequence&oldid=1115357514. [Online; accessed 23-May-2023]."}],"event":{"name":"PPDP 2023: International Symposium on Principles and Practice of Declarative Programming","acronym":"PPDP 2023","location":"Lisboa Portugal"},"container-title":["International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3610612.3610623","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:00Z","timestamp":1750178160000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3610612.3610623"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,22]]},"references-count":38,"alternative-id":["10.1145\/3610612.3610623","10.1145\/3610612"],"URL":"https:\/\/doi.org\/10.1145\/3610612.3610623","relation":{},"subject":[],"published":{"date-parts":[[2023,10,22]]},"assertion":[{"value":"2023-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}