Zobrazeno 1 - 10
of 38
pro vyhledávání: '"MORRIS, J. GARRETT"'
We explore recursive programming with extensible data types. Row types make the structure of data types first class, and can express a variety of type system features from subtyping to modular combination of case branches. Our goal is the modular com
Externí odkaz:
http://arxiv.org/abs/2410.11742
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. Effect handlers provide a modular programming abstraction for impleme
Externí odkaz:
http://arxiv.org/abs/2307.09383
Autor:
Hubers, Alex, Morris, J. Garrett
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 variant subtyping, record extension, and modular composition of case branche
Externí odkaz:
http://arxiv.org/abs/2307.08759
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 3 (July 12, 2023) lmcs:9361
This paper introduces Hypersequent GV (HGV), a modular and extensible core calculus for functional programming with session types that enjoys deadlock freedom, confluence, and strong normalisation. HGV exploits hyper-environments, which are collectio
Externí odkaz:
http://arxiv.org/abs/2105.08996
Publikováno v:
Logical Methods in Computer Science, Volume 16, Issue 4 (December 15, 2020) lmcs:5821
Process calculi based in logic, such as $\pi$DILL and CP, provide a foundation for deadlock-free concurrent programming, but exclude non-determinism and races. HCP is a reformulation of CP which addresses a fundamental shortcoming: the fundamental op
Externí odkaz:
http://arxiv.org/abs/1909.13376
Autor:
Morris, J. Garrett, Eisenberg, Richard
We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type families in H
Externí odkaz:
http://arxiv.org/abs/1706.09715
Autor:
Morris, J. Garrett
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 true of subsequent extensions of type classes. Functional dependencies
Externí odkaz:
http://arxiv.org/abs/1612.08199
Autor:
Morris, J. Garrett
Extensible variants improve the modularity and expressiveness of programming languages: they allow program functionality to be decomposed into independent blocks, and allow seamless extension of existing code with both new cases of existing data type
Externí odkaz:
http://arxiv.org/abs/1612.08203
Autor:
Morris, J. Garrett
We present a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming. Unlike previous combinations of linear typing and functiona
Externí odkaz:
http://arxiv.org/abs/1612.06633
Autor:
Lindley, Sam, Morris, J. Garrett
Publikováno v:
EPTCS 155, 2014, pp. 9-16
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 translation is one-way: CP is more expressive than GV. We propose an
Externí odkaz:
http://arxiv.org/abs/1406.3479