default search action
Jay McCarthy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j4]Kimball Germane
, Jay McCarthy:
Newly-single and loving it: improving higher-order must-alias analysis with heap fragments. Proc. ACM Program. Lang. 5(ICFP): 1-28 (2021)
2010 – 2019
- 2019
- [j3]Radha Nakade, Eric Mercer
Model-checking task-parallel programs for data-race. Innov. Syst. Softw. Eng. 15(3-4): 289-306 (2019) - [c10]Kimball Germane
Demand Control-Flow Analysis. VMCAI 2019: 226-246 - 2018
- [j2]Jurriaan Hage, Jay McCarthy:
Special issue on Trends in Functional Programming 2013/14. Comput. Lang. Syst. Struct. 52: 63-64 (2018) - [c9]Radha Nakade, Eric Mercer
Model-Checking Task Parallel Programs for Data-Race. NFM 2018: 367-382 - [e4]Matteo Cimini, Jay McCarthy:
Proceedings of the 30th Symposium on Implementation and Application of Functional Languages, IFL 2018, Lowell, MA, USA, September 5-7, 2018. ACM 2018, ISBN 978-1-4503-7143-8 [contents] - 2016
- [c8]Jay McCarthy:
Bithoven: Gödel encoding of chamber music and functional 8-bit audio synthesis. FARM@ICFP 2016: 1-7 - [c7]Helen H. Hu, Cecily Heiner, Jay McCarthy:
Deploying Exploring Computer Science Statewide. SIGCSE 2016: 72-77 - [e3]Johan Jeuring, Jay McCarthy:
Proceedings of the 4th and 5th International Workshop on Trends in Functional Programming in Education, TFPIE 2016, Sophia-Antipolis, France, and University of Maryland, College Park, MD, USA, June 2, 2015, and June 7, 2016. EPTCS 230, 2016 [contents] - 2015
- [c6]Neil Toronto, Jay McCarthy, David Van Horn:
Running Probabilistic Programs Backwards. ESOP 2015: 53-79 - [e2]Jurriaan Hage, Jay McCarthy:
Trends in Functional Programming - 15th International Symposium, TFP 2014, Soesterberg, The Netherlands, May 26-28, 2014. Revised Selected Papers. Lecture Notes in Computer Science 8843, Springer 2015, ISBN 978-3-319-14674-4 [contents] - 2014
- [j1]Neil Toronto, Jay McCarthy:
Practically Accurate Floating-Point Math. Comput. Sci. Eng. 16(4): 80-95 (2014) - [e1]Jay McCarthy:
Trends in Functional Programming - 14th International Symposium, TFP 2013, Provo, UT, USA, May 14-16, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8322, Springer 2014, ISBN 978-3-642-45339-7 [contents] - [i1]Neil Toronto, Jay McCarthy, David Van Horn:
Running Probabilistic Programs Backwards. CoRR abs/1412.4053 (2014) - 2013
- [c5]Yu Huang, Eric Mercer, Jay McCarthy:
Proving MCAPI executions are correct using SMT. ASE 2013: 26-36 - 2012
- [c4]Neil Toronto, Jay McCarthy:
Computing in Cantor's Paradise with λ ZFC. FLOPS 2012: 290-306 - [c3]Everett Morse, Nick Vrvilo, Eric Mercer, Jay McCarthy:
Modeling Asynchronous Message Passing for C Programs. VMCAI 2012: 332-347 - 2011
- [c2]Tim Disney, Cormac Flanagan, Jay McCarthy:
Temporal higher-order contracts. ICFP 2011: 176-188 - 2010
- [c1]Neil Toronto, Jay McCarthy:
From Bayesian Notation to Pure Racket via Discrete Measure-Theoretic Probability in λ ZFC. IFL 2010: 89-104
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-04-25 05:56 CEST 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: