Publications of Stephanie Weirichhttps://researchr.org/profile/stephanieweirich/publicationsPublications of Stephanie Weirich28/03/2024 19:10Free Theorems and Runtime Type Representationshttps://researchr.org/publication/VytiniotisW07Dimitrios Vytiniotis, Stephanie Weirich. Free Theorems and Runtime Type Representations. Electronic Notes in Theoretical Computer Science, 173:357-373, 2007. [doi]https://researchr.org/publication/VytiniotisW0726/08/2009 4:41A Design for Type-Directed Programming in Javahttps://researchr.org/publication/WeirichH05Stephanie Weirich, Liang Huang. A Design for Type-Directed Programming in Java. Electronic Notes in Theoretical Computer Science, 138(2):117-136, 2005. [doi]https://researchr.org/publication/WeirichH0526/08/2009 16:02Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphismhttps://researchr.org/publication/WashburnW03Geoffrey Washburn, Stephanie Weirich. Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism. In Colin Runciman, Olin Shivers, editors, Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, Uppsala, Sweden, August 25-29, 2003. pages 249-262, ACM, 2003. [doi]https://researchr.org/publication/WashburnW0327/08/2009 1:14Type-safe cast: functional pearlhttps://researchr.org/publication/Weirich00Stephanie Weirich. Type-safe cast: functional pearl. In ICFP. pages 58-67, 2000. [doi]https://researchr.org/publication/Weirich0027/08/2009 1:14It Is Time to Mechanize Programming Language Metatheoryhttps://researchr.org/publication/PierceSWZ05Benjamin C. Pierce, Peter Sewell, Stephanie Weirich, Steve Zdancewic. It Is Time to Mechanize Programming Language Metatheory. In Bertrand Meyer, Jim Woodcock, editors, Verified Software: Theories, Tools, Experiments, First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions. Volume 4171 of Lecture Notes in Computer Science, pages 26-30, Springer, 2005. [doi]https://researchr.org/publication/PierceSWZ0527/08/2009 3:03Generalizing Parametricity Using Information-flowhttps://researchr.org/publication/WashburnW05Geoffrey Washburn, Stephanie Weirich. Generalizing Parametricity Using Information-flow. In 20th IEEE Symposium on Logic in Computer Science (LICS 2005), 26-29 June 2005, Chicago, IL, USA, Proceedings. pages 62-71, IEEE Computer Society, 2005. [doi]https://researchr.org/publication/WashburnW0527/08/2009 19:06Practical type inference for arbitrary-rank typeshttps://researchr.org/publication/JonesVWS07Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, Mark Shields. Practical type inference for arbitrary-rank types. Journal of Functional Programming, 17(1):1-82, 2007. [doi]https://researchr.org/publication/JonesVWS0728/08/2009 23:24Static Debugging: Browsing the Web of Program Invariantshttps://researchr.org/publication/FlanaganFKWF96Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi, Stephanie Weirich, Matthias Felleisen. Static Debugging: Browsing the Web of Program Invariants. In PLDI. pages 23-32, 1996. https://researchr.org/publication/FlanaganFKWF9629/08/2009 3:26Boxy types: inference for higher-rank types and impredicativityhttps://researchr.org/publication/VytiniotisWJ06Dimitrios Vytiniotis, Stephanie Weirich, Simon L. Peyton Jones. Boxy types: inference for higher-rank types and impredicativity. In John H. Reppy, Julia L. Lawall, editors, Proceedings of the 11th ACM SIGPLAN International Conference on Functional Programming, ICFP 2006, Portland, Oregon, USA, September 16-21, 2006. pages 251-262, ACM, 2006. [doi]https://researchr.org/publication/VytiniotisWJ0630/08/2009 13:33Mechanized Metatheory for the Masses: The PoplMark Challengehttps://researchr.org/publication/AydemirBFFPSVWWZ05Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell, Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich, Steve Zdancewic. Mechanized Metatheory for the Masses: The PoplMark Challenge. In Joe Hurd, Thomas F. Melham, editors, Theorem Proving in Higher Order Logics, 18th International Conference, TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings. Volume 3603 of Lecture Notes in Computer Science, pages 50-65, Springer, 2005. [doi]https://researchr.org/publication/AydemirBFFPSVWWZ0531/08/2009 1:16