activity
20142023
most citedSoundly Handling Linearity

8 citations · 22 across the 6 of their papers we have counts for

collaborators

6 papers

cs.PL2023

Generic Programming with Extensible Data Types; Or, Making Ad Hoc Extensible Data Types Less Ad Hoc

Alex Hubers, J. Garrett Morris

We present a novel approach to generic programming over extensible data types. Row types capture the structure of records and variants, and can be used to express record and varian…

cs.PL2023★ 8 cited

Soundly Handling Linearity

Wenhao Tang, Daniel Hillerström, Sam Lindley +1

We propose a novel approach to soundly combining linear types with effect handlers. Linear type systems statically ensure that resources such as file handles are used exactly once.…

cs.LO2019

Towards Races in Linear Logic

Wen Kokke, J. Garrett Morris, Philip Wadler

Process calculi based in logic, such as DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races. HCP is a reformulation…

cs.PL2017★ 4 cited

Constrained Type Families

J. Garrett Morris, Richard Eisenberg

We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either req…

cs.PL2016★ 5 cited

A Simple Semantics for Haskell Overloading

J. Garrett Morris

As originally proposed, type classes provide overloading and ad-hoc definition, but can still be understood (and implemented) in terms of strictly parametric calculi. This is not t…

cs.PL2014★ 5 cited

Sessions as Propositions

Sam Lindley, J. Garrett Morris

Recently, Wadler presented a continuation-passing translation from a session-typed functional language, GV, to a process calculus based on classical linear logic, CP. However, this…