Jay A. McCarthy

According to our database, Jay A. McCarthy authored at least 16 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Rhombus: A New Spin on Macros without All the Parentheses.

Matthew Flatt, Taylor Allred, Nia Angle, Stephen De Gabrielle, Robert Bruce Findler, Jack Firth, Kiran Gopinathan, Ben Greenman, Siddhartha Kasivajhula, Alex Knauth, Jay A. McCarthy, Sam Phillips, Sorawee Porncharoenwase, Jens Axel Søgaard, Sam Tobin-Hochstadt

Proc. ACM Program. Lang., October, 2023

2018

A Coq library for internal verification of running-times.

Jay A. McCarthy, Burke Fetscher, Max S. New, Daniel Feltey, Robert Bruce Findler

Sci. Comput. Program., 2018

A programmable programming language.

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi, Eli Barzilay, Jay A. McCarthy, Sam Tobin-Hochstadt

Commun. ACM, 2018

2017

Fair enumeration combinators.

Max S. New, Burke Fetscher, Robert Bruce Findler, Jay A. McCarthy

J. Funct. Program., 2017

2015

The Racket Manifesto.

Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi, Eli Barzilay, Jay A. McCarthy, Sam Tobin-Hochstadt

Proceedings of the 1st Summit on Advances in Programming Languages, 2015

2013

Teaching garbage collection without implementing compiler or interpreters.

Gregory H. Cooper, Arjun Guha, Shriram Krishnamurthi, Jay A. McCarthy, Robert Bruce Findler

Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

2012

Run your research: on the effectiveness of lightweight mechanization.

Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay A. McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, Robert Bruce Findler

Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

2011

A Semantics for Context-Sensitive Reduction Semantics.

Casey Klein, Jay A. McCarthy, Steven Jaconette, Robert Bruce Findler

Proceedings of the Programming Languages and Systems - 9th Asian Symposium, 2011

2010

The two-state solution: native and serializable continuations accord.

Jay A. McCarthy

Proceedings of the 25th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2010

2009

"Static Analyses of Cryptographic Protocols.

Jay A. McCarthy

PhD thesis, 2009

Trusted Multiplexing of Cryptographic Protocols.

Jay A. McCarthy, Shriram Krishnamurthi

Proceedings of the Formal Aspects in Security and Trust, 6th International Workshop, 2009

Automatically RESTful web applications: marking modular serializable continuations.

Jay A. McCarthy

Proceedings of the Proceeding of the 14th ACM SIGPLAN international conference on Functional programming, 2009

2008

Cryptographic Protocol Explication and End-Point Projection.

Jay A. McCarthy, Shriram Krishnamurthi

Proceedings of the Computer Security, 2008

Minimal backups of cryptographic protocol runs.

Jay A. McCarthy, Shriram Krishnamurthi

Proceedings of the 6th ACM Workshop on Formal Methods in Security Engineering, 2008

2007

Implementation and use of the PLT scheme Web server.

Shriram Krishnamurthi, Peter Walton Hopkins, Jay A. McCarthy, Paul T. Graunke, Greg Pettyjohn, Matthias Felleisen

High. Order Symb. Comput., 2007

Compiling cryptographic protocols for deployment on the web.

Jay A. McCarthy, Shriram Krishnamurthi, Joshua D. Guttman, John D. Ramsdell

Proceedings of the 16th International Conference on World Wide Web, 2007