default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJ. Garrett Morris
Person information
- affiliation: University of Iowa, Iowa City, IA, USA
- affiliation (former): University of Kansas, Lawrence, KS, USA
- affiliation (former): University of Edinburgh, UK
- affiliation (former): Portland State University, Portland, OR, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Wenhao Tang
, Daniel Hillerström, Sam Lindley, J. Garrett Morris:
Soundly Handling Linearity. Proc. ACM Program. Lang. 8(POPL): 1600-1628 (2024)- [e1]Niki Vazou, J. Garrett Morris:
Proceedings of the 17th ACM SIGPLAN International Haskell Symposium, Haskell 2024, Milan, Italy, September 6-7, 2024. ACM 2024, ISBN 979-8-4007-1102-2 [contents] - [i9]Alex Hubers, Apoorv Ingle, Andrew Marmaduke, J. Garrett Morris:
Extensible Recursive Functions, Algebraically. CoRR abs/2410.11742 (2024) - 2023
- [j10]Simon Fowler, Wen Kokke, Ornela Dardha, Sam Lindley, J. Garrett Morris:
Separating Sessions Smoothly. Log. Methods Comput. Sci. 19(3) (2023) - [j9]Alex Hubers, J. Garrett Morris:
Generic Programming with Extensible Data Types: Or, Making Ad Hoc Extensible Data Types Less Ad Hoc. Proc. ACM Program. Lang. 7(ICFP): 356-384 (2023) - [j8]Pedro Abreu, Benjamin Delaware, Alex Hubers, Christa Jenkins, J. Garrett Morris, Aaron Stump:
A Type-Based Approach to Divide-and-Conquer Recursion in Coq. Proc. ACM Program. Lang. 7(POPL): 61-90 (2023) - [i8]Alex Hubers, J. Garrett Morris:
Generic Programming with Extensible Data Types; Or, Making Ad Hoc Extensible Data Types Less Ad Hoc. CoRR abs/2307.08759 (2023) - [i7]Wenhao Tang, Daniel Hillerström, Sam Lindley, J. Garrett Morris:
Soundly Handling Linearity. CoRR abs/2307.09383 (2023) - 2022
- [c14]Apoorv Ingle, Alex Hubers, J. Garrett Morris:
Partial type constructors in practice. Haskell 2022: 95-107 - 2021
- [c13]Simon Fowler, Wen Kokke, Ornela Dardha, Sam Lindley, J. Garrett Morris:
Separating Sessions Smoothly. CONCUR 2021: 36:1-36:18 - [i6]Simon Fowler, Wen Kokke, Ornela Dardha, Sam Lindley, J. Garrett Morris:
Separating Sessions Smoothly. CoRR abs/2105.08996 (2021) - 2020
- [j7]Wen Kokke, J. Garrett Morris, Philip Wadler:
Towards Races in Linear Logic. Log. Methods Comput. Sci. 16(4) (2020) - [j6]Mark P. Jones, J. Garrett Morris, Richard A. Eisenberg:
Partial type constructors: or, making ad hoc datatypes less ad hoc. Proc. ACM Program. Lang. 4(POPL): 40:1-40:28 (2020)
2010 – 2019
- 2019
- [j5]J. Garrett Morris, James McKinna:
Abstracting extensible data types: or, rows by any other name. Proc. ACM Program. Lang. 3(POPL): 12:1-12:28 (2019) - [j4]Simon Fowler, Sam Lindley, J. Garrett Morris, Sára Decova:
Exceptional asynchronous session types: session types without tiers. Proc. ACM Program. Lang. 3(POPL): 28:1-28:29 (2019) - [c12]Wen Kokke, J. Garrett Morris, Philip Wadler:
Towards Races in Linear Logic. COORDINATION 2019: 37-53 - [i5]Wen Kokke, J. Garrett Morris, Philip Wadler:
Towards Races in Linear Logic. CoRR abs/1909.13376 (2019) - 2018
- [j3]Jack Williams, J. Garrett Morris, Philip Wadler:
The root cause of blame: contracts for intersection and union types. Proc. ACM Program. Lang. 2(OOPSLA): 134:1-134:29 (2018) - 2017
- [j2]Jack Williams, J. Garrett Morris, Philip Wadler, Jakub Zalewski:
Mixed Messages: Measuring Conformance and Non-Interference in TypeScript (Artifact). Dagstuhl Artifacts Ser. 3(2): 08:1-08:2 (2017) - [j1]J. Garrett Morris, Richard A. Eisenberg:
Constrained type families. Proc. ACM Program. Lang. 1(ICFP): 42:1-42:28 (2017) - [c11]Jack Williams, J. Garrett Morris, Philip Wadler, Jakub Zalewski:
Mixed Messages: Measuring Conformance and Non-Interference in TypeScript. ECOOP 2017: 28:1-28:29 - [i4]J. Garrett Morris, Richard A. Eisenberg:
Constrained Type Families. CoRR abs/1706.09715 (2017) - 2016
- [c10]Robert Atkey, Sam Lindley, J. Garrett Morris:
Conflation Confers Concurrency. A List of Successes That Can Change the World 2016: 32-55 - [c9]Sam Lindley, J. Garrett Morris:
Embedding session types in Haskell. Haskell 2016: 133-145 - [c8]Sam Lindley, J. Garrett Morris:
Talking bananas: structural recursion for session types. ICFP 2016: 434-447 - [c7]J. Garrett Morris:
The best of both worlds: linear functional programming without compromise. ICFP 2016: 448-461 - [i3]J. Garrett Morris:
The Best of Both Worlds: Linear Functional Programming without Compromise. CoRR abs/1612.06633 (2016) - [i2]J. Garrett Morris:
A Simple Semantics for Haskell Overloading. CoRR abs/1612.08199 (2016) - [i1]J. Garrett Morris:
Variations on Variants. CoRR abs/1612.08203 (2016) - 2015
- [c6]Sam Lindley, J. Garrett Morris:
A Semantics for Propositions as Sessions. ESOP 2015: 560-584 - [c5]J. Garrett Morris:
Variations on variants. Haskell 2015: 71-81 - 2014
- [c4]J. Garrett Morris:
A simple semantics for Haskell overloading. Haskell 2014: 107-118 - [c3]Sam Lindley, J. Garrett Morris:
Sessions as Propositions. PLACES 2014: 9-16 - 2010
- [c2]J. Garrett Morris:
Experience report: using hackage to inform language design. Haskell 2010: 61-66 - [c1]J. Garrett Morris, Mark P. Jones:
Instance chains: type class programming without overlapping instances. ICFP 2010: 375-386
Coauthor Index
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-11-25 23:43 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:
