default search action
Stephanie Weirich
Stephanie C. Weirich
Person information
- affiliation: University of Pennsylvania, Philadelphia, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j25]Li-yao Xia, Laura Israel, Maite Kramarz, Nicholas Coltharp, Koen Claessen, Stephanie Weirich, Yao Li:
Story of Your Lazy Function's Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs. Proc. ACM Program. Lang. 8(ICFP): 30-63 (2024) - [j24]Cassia Torczon
, Emmanuel Suárez Acevedo
Effects and Coeffects in Call-by-Push-Value. Proc. ACM Program. Lang. 8(OOPSLA2): 1108-1134 (2024) - [j23]Yiyun Liu
Internalizing Indistinguishability with Dependent Types. Proc. ACM Program. Lang. 8(POPL): 1298-1325 (2024) - [e6]Stephanie Weirich
Programming Languages and Systems - 33rd European Symposium on Programming, ESOP 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part I. Lecture Notes in Computer Science 14576, Springer 2024, ISBN 978-3-031-57261-6 [contents] - [e5]Stephanie Weirich
Programming Languages and Systems - 33rd European Symposium on Programming, ESOP 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II. Lecture Notes in Computer Science 14577, Springer 2024, ISBN 978-3-031-57266-1 [contents] - [i18]Li-yao Xia, Laura Israel, Maite Kramarz, Nicholas Coltharp, Koen Claessen, Stephanie Weirich, Yao Li:
Story of Your Lazy Function's Life: A Bidirectional Demand Semantics for Mechanized Cost Analysis of Lazy Programs. CoRR abs/2406.14787 (2024) - 2023
- [j22]Yiyun Liu
Dependently-Typed Programming with Logical Equality Reflection. Proc. ACM Program. Lang. 7(ICFP): 649-685 (2023) - [i17]Jonathan Chan, Stephanie Weirich:
Stratified Type Theory. CoRR abs/2309.12164 (2023) - [i16]Emmanuel Suárez Acevedo, Stephanie Weirich:
Making Logical Relations More Relatable (Proof Pearl). CoRR abs/2309.15724 (2023) - [i15]Cassia Torczon, Emmanuel Suárez Acevedo, Shubh Agrawal, Joey Velez-Ginorio, Stephanie Weirich:
Effects and Coeffects in Call-By-Push-Value (Extended Version). CoRR abs/2311.11795 (2023) - 2022
- [j21]Yao Li
Program adverbs and Tlön embeddings. Proc. ACM Program. Lang. 6(ICFP): 312-342 (2022) - [c57]Pritam Choudhury, Harley Eades III
A Dependent Dependency Calculus. ESOP 2022: 403-430 - [i14]Pritam Choudhury, Harley Eades III, Stephanie Weirich:
A Dependent Dependency Calculus (Extended Version). CoRR abs/2201.11040 (2022) - [i13]Stephanie Weirich:
Implementing Dependent Types in pi-forall. CoRR abs/2207.02129 (2022) - [i12]Yao Li, Stephanie Weirich:
Program Adverbs and Tlön Embeddings. CoRR abs/2207.05227 (2022) - 2021
- [j20]Joachim Breitner, Antal Spector-Zabusky
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code. J. Funct. Program. 31: e5 (2021) - [j19]Richard A. Eisenberg
An existential crisis resolved: type inference for first-class existential types. Proc. ACM Program. Lang. 5(ICFP): 1-29 (2021) - [j18]Yao Li
Reasoning about the garden of forking paths. Proc. ACM Program. Lang. 5(ICFP): 1-28 (2021) - [j17]Pritam Choudhury, Harley Eades III, Richard A. Eisenberg
A graded dependent type system with a usage-aware semantics. Proc. ACM Program. Lang. 5(POPL): 1-32 (2021) - [i11]Yao Li, Li-yao Xia, Stephanie Weirich:
Reasoning about the garden of forking paths. CoRR abs/2103.07543 (2021) - [i10]Stephanie Weirich, Benjamin C. Pierce:
ICFP 2020 Post-Conference Report. CoRR abs/2104.01239 (2021) - 2020
- [i9]Pritam Choudhury, Harley Eades III, Richard A. Eisenberg, Stephanie C. Weirich:
A graded dependent type system with a usage-aware semantics (extended version). CoRR abs/2011.04070 (2020)
2010 – 2019
- 2019
- [j16]Stephanie Weirich, Pritam Choudhury, Antoine Voizard, Richard A. Eisenberg
A role for dependent types in Haskell. Proc. ACM Program. Lang. 3(ICFP): 101:1-101:29 (2019) - [c56]Anastasiya Kravchuk-Kirilyuk, Antoine Voizard, Stephanie Weirich
Eta-Equivalence in Core Dependent Haskell. TYPES 2019: 7:1-7:31 - [i8]Stephanie Weirich, Pritam Choudhury, Antoine Voizard, Richard A. Eisenberg:
A Role for Dependent Types in Haskell (Extended version). CoRR abs/1905.13706 (2019) - [i7]Antal Spector-Zabusky, Joachim Breitner, Yao Li
Embracing a mechanized formalization gap. CoRR abs/1910.11724 (2019) - 2018
- [j15]Joachim Breitner, Antal Spector-Zabusky, Yao Li
Ready, set, verify! applying hs-to-coq to real-world Haskell code (experience report). Proc. ACM Program. Lang. 2(ICFP): 89:1-89:16 (2018) - [c55]Antal Spector-Zabusky, Joachim Breitner, Christine Rizkallah
Total Haskell is reasonable Coq. CPP 2018: 14-27 - [i6]Joachim Breitner, Antal Spector-Zabusky, Yao Li, Christine Rizkallah, John Wiegley, Stephanie Weirich:
Ready, Set, Verify! Applying hs-to-coq to real-world Haskell code. CoRR abs/1803.06960 (2018) - 2017
- [j14]Stephanie Weirich, Antoine Voizard, Pedro Henrique Azevedo de Amorim, Richard A. Eisenberg
A specification for dependent types in Haskell. Proc. ACM Program. Lang. 1(ICFP): 31:1-31:29 (2017) - [c54]Stephanie Weirich:
The influence of dependent types (keynote). POPL 2017: 1 - [i5]Antal Spector-Zabusky, Joachim Breitner, Christine Rizkallah, Stephanie Weirich:
Total Haskell is Reasonable Coq. CoRR abs/1711.09286 (2017) - 2016
- [j13]Joachim Breitner, Richard A. Eisenberg
Safe zero-cost coercions for Haskell. J. Funct. Program. 26: e15 (2016) - [c53]Simon Peyton Jones, Stephanie Weirich
A Reflection on Types. A List of Successes That Can Change the World 2016: 292-317 - [c52]Richard A. Eisenberg
Visible Type Application. ESOP 2016: 229-254 - [c51]Steven Keuchel
Needle & Knot: Binder Boilerplate Tied Up. ESOP 2016: 419-445 - [i4]Marco Gaboardi
Language Based Verification Tools for Functional Programs (Dagstuhl Seminar 16131). Dagstuhl Reports 6(3): 59-77 (2016) - 2015
- [c50]Wenrui Meng, Junkil Park, Oleg Sokolsky, Stephanie Weirich, Insup Lee:
Verified ROS-Based Deployment of Platform-Independent Control Systems. NFM 2015: 248-262 - [c49]Vilhelm Sjöberg, Stephanie Weirich
Programming up to Congruence. POPL 2015: 369-382 - [i3]Stephanie Weirich:
How to write a good research paper. PLMW@POPL 2015: 5:1 - [i2]Stephanie Weirich:
How to give a good research talk. PLMW@POPL 2015: 13:1 - 2014
- [c48]Joachim Breitner
Safe zero-cost coercions for Haskell. ICFP 2014: 189-202 - [c47]Stephanie Weirich:
Depending on types. ICFP 2014: 241 - [c46]Chris Casinghino, Vilhelm Sjöberg, Stephanie Weirich
Combining proofs and programs in a dependently typed language. POPL 2014: 33-46 - [c45]Richard A. Eisenberg
Closed type families with overlapping equations. POPL 2014: 671-684 - [p1]Stephanie Weirich:
Type Systems. Computing Handbook, 3rd ed. (1) 2014: 70: 1-39 - 2013
- [c44]Miroslav Pajic
Towards synthesis of platform-aware attack-resilient control systems: extended abstract. HiCoNS 2013: 75-76 - [c43]Stephanie Weirich
System FC with explicit kind equality. ICFP 2013: 275-286 - [e4]Stephanie Weirich:
Proceedings of the 2013 ACM SIGPLAN workshop on Dependently-typed programming, DTP@ICFP 2013, Boston, Massachusetts, USA, September 24, 2013. ACM 2013, ISBN 978-1-4503-2384-0 [contents] - 2012
- [j12]Benjamin C. Pierce, Stephanie Weirich
Preface. J. Autom. Reason. 49(3): 301-302 (2012) - [j11]Michael Greenberg
Contracts made manifest. J. Funct. Program. 22(3): 225-274 (2012) - [j10]Umut A. Acar, James Cheney
Editorial - Special issue dedicated to ICFP 2010. J. Funct. Program. 22(4-5): 379-381 (2012) - [j9]Kathleen Fisher, Ronald Garcia, Stephanie Weirich:
Nourishing the future of the field: the programming language mentoring workshop 2012. ACM SIGPLAN Notices 47(4a): 14-15 (2012) - [c42]Stephanie Weirich:
Dependently-Typed Programming in GHC. FLOPS 2012: 3 - [c41]Richard A. Eisenberg
Dependently typed programming with singletons. Haskell 2012: 117-130 - [c40]Garrin Kimmell, Aaron Stump, Harley D. Eades III, Peng Fu, Tim Sheard, Stephanie Weirich
Equational reasoning about programs with general recursion and call-by-value semantics. PLPV 2012: 15-26 - [c39]Brent A. Yorgey, Stephanie Weirich
Giving Haskell a promotion. TLDI 2012: 53-66 - [c38]Chris Casinghino, Vilhelm Sjöberg, Stephanie Weirich
Step-Indexed Normalization for a Language with General Recursion. MSFP 2012: 25-39 - [c37]Vilhelm Sjöberg, Chris Casinghino, Ki Yung Ahn, Nathan Collins, Harley D. Eades III, Peng Fu, Garrin Kimmell, Tim Sheard, Aaron Stump, Stephanie Weirich
Irrelevance, Heterogeneous Equality, and Call-by-value Dependent Type Systems. MSFP 2012: 112-162 - 2011
- [c36]Stephanie Weirich
Binders unbound. ICFP 2011: 333-345 - [c35]Stephanie Weirich
Generative type abstraction and type-level computation. POPL 2011: 227-240 - [c34]Stephanie Weirich
Combining Proofs and Programs. RTA 2011: 9-9 - [c33]Stephanie Weirich
Combining Proofs and Programs. TLCA 2011: 9 - [e3]Stephanie Weirich, Derek Dreyer:
Proceedings of TLDI 2011: 2011 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Austin, TX, USA, January 25, 2011. ACM 2011, ISBN 978-1-4503-0484-9 [contents] - [i1]Shin-Cheng Mu, Conor McBride, Stephanie Weirich:
Dependently Typed Programming (NII Shonan Meeting 2011-3). NII Shonan Meet. Rep. 2011 (2011) - 2010
- [j8]Dimitrios Vytiniotis, Stephanie Weirich
Parametricity, type equality, and higher-order polymorphism. J. Funct. Program. 20(2): 175-210 (2010) - [c32]Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich:
Termination Casts: A Flexible Approach to Termination with General Recursion. PAR@ITP 2010: 84-100 - [c31]Stephanie Weirich
Arity-generic datatype-generic programming. PLPV 2010: 15-26 - [c30]Limin Jia
Dependent types and program equivalence. POPL 2010: 275-286 - [c29]Michael Greenberg
Contracts made manifest. POPL 2010: 353-364 - [c28]Tim Sheard, Aaron Stump, Stephanie Weirich
Language-based verification will change the world. FoSER 2010: 343-348 - [c27]Stephanie Weirich
Generic Programming with Dependent Types. SSGIP 2010: 217-258 - [c26]Aaron Stump, Vilhelm Sjöberg, Stephanie Weirich:
Termination Casts: A Flexible Approach to Termination with General Recursion. PAR 2010: 76-93 - [e2]Paul Hudak, Stephanie Weirich:
Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, ICFP 2010, Baltimore, Maryland, USA, September 27-29, 2010. ACM 2010, ISBN 978-1-60558-794-3 [contents]
2000 – 2009
- 2009
- [j7]Stephanie Weirich, Chris Casinghino:
Arity-generic datatype-generic programming: (abstract only). ACM SIGPLAN Notices 44(11): 7 (2009) - [c25]Aaron Bohannon, Benjamin C. Pierce, Vilhelm Sjöberg, Stephanie Weirich
Reactive noninterference. CCS 2009: 79-90 - [c24]Stephanie Weirich:
Haskell Symposium Program Chair's Report. Haskell 2009 - [e1]Stephanie Weirich:
Proceedings of the 2nd ACM SIGPLAN Symposium on Haskell, Haskell 2009, Edinburgh, Scotland, UK, 3 September 2009. ACM 2009, ISBN 978-1-60558-508-6 [contents] - 2008
- [j6]Geoffrey Washburn, Stephanie Weirich
Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism. J. Funct. Program. 18(1): 87-140 (2008) - [j5]Daniel S. Dantas, David Walker
AspectML: A polymorphic aspect-oriented functional programming language. ACM Trans. Program. Lang. Syst. 30(3): 14:1-14:60 (2008) - [c23]Dimitrios Vytiniotis, Stephanie Weirich
FPH: first-class polymorphism for Haskell. ICFP 2008: 295-306 - [c22]Brian E. Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, Stephanie Weirich
Engineering formal metatheory. POPL 2008: 3-15 - 2007
- [j4]Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich
Practical type inference for arbitrary-rank types. J. Funct. Program. 17(1): 1-82 (2007) - [c21]Dimitrios Vytiniotis, Stephanie Weirich
Free Theorems and Runtime Type Representations. MFPS 2007: 357-373 - 2006
- [j3]Stephanie Weirich
Type-safe run-time polytypic programming. J. Funct. Program. 16(6): 681-710 (2006) - [c20]Stephanie Weirich:
RepLib: a library for derivable type classes. Haskell 2006: 1-12 - [c19]Geoffrey Washburn, Stephanie Weirich:
Good advice for type-directed programming aspect-oriented programming and extensible generic functions. ICFP-WGP 2006: 33-44 - [c18]Simon L. Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich
Simple unification-based type inference for GADTs. ICFP 2006: 50-61 - [c17]Dimitrios Vytiniotis, Stephanie Weirich
Boxy types: inference for higher-rank types and impredicativity. ICFP 2006: 251-262 - [c16]Brian E. Aydemir, Aaron Bohannon, Stephanie Weirich
Nominal Reasoning Techniques in Coq: (Extended Abstract). LFMTP@FLoC 2006: 69-77 - 2005
- [c15]Daniel S. Dantas, David Walker
PolyAML: a polymorphic aspect-oriented functional programming language. ICFP 2005: 306-319 - [c14]Geoffrey Washburn, Stephanie Weirich
Generalizing Parametricity Using Information-flow. LICS 2005: 62-71 - [c13]Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie Weirich:
An open and shut typecase. TLDI 2005: 13-24 - [c12]Brian E. Aydemir, Aaron Bohannon, Matthew Fairbairn, J. Nathan Foster, Benjamin C. Pierce, Peter Sewell
Mechanized Metatheory for the Masses: The PoplMark Challenge. TPHOLs 2005: 50-65 - [c11]Benjamin C. Pierce, Peter Sewell
It Is Time to Mechanize Programming Language Metatheory. VSTTE 2005: 26-30 - 2004
- [j2]Stephanie Weirich
Type-safe cast. J. Funct. Program. 14(6): 681-695 (2004) - [c10]Stephanie Weirich
A Design for Type-Directed Programming in Java. WOOD 2004: 117-136 - 2003
- [c9]Geoffrey Washburn, Stephanie Weirich:
Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism. ICFP 2003: 249-262 - 2002
- [b1]Stephanie Weirich:
Programming with Types. Cornell University, USA, 2002 - [j1]Karl Crary, Stephanie Weirich
Intensional polymorphism in type-erasure semantics. J. Funct. Program. 12(6): 567-600 (2002) - [c8]Stephanie Weirich:
Higher-Order Intensional Type Analysis. ESOP 2002: 98-114 - 2001
- [c7]Stephanie Weirich:
Encoding Intensional Type Analysis. ESOP 2001: 92-106 - 2000
- [c6]Stephanie Weirich:
Type-safe cast: functional pearl. ICFP 2000: 58-67 - [c5]Karl Crary, Stephanie Weirich:
Resource Bound Certification. POPL 2000: 184-198 - [c4]Michael W. Hicks
Safe and Flexible Dynamic Linking of Native Code. Types in Compilation 2000: 147-176
1990 – 1999
- 1999
- [c3]Karl Crary, Stephanie Weirich:
Flexible Type Analysis. ICFP 1999: 233-248 - 1998
- [c2]Karl Crary, Stephanie Weirich, J. Gregory Morrisett:
Intensional Polymorphism in Type-Erasure Semantics. ICFP 1998: 301-312 - 1996
- [c1]Cormac Flanagan, Matthew Flatt, Shriram Krishnamurthi
Static Debugging: Browsing the Web of Program Invariants. PLDI 1996: 23-32
Coauthor Index
Simon L. Peyton Jones
aka: Simon Peyton Jones
aka: Simon Peyton Jones
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: