|
1 | 1 | - description: This line of work explores the theoretical aspects of the <i>merge operator</i> and develops novel notions such as <i>disjoint intersection types</i>, <i>disjoint polymorphism</i>, <i>nested composition</i>, <i>disjoint switches</i>, <i>type difference</i>, <i>dependent merges</i>, and <i>type-directed operational semantics</i>.
|
2 | 2 | papers:
|
| 3 | + - title: A Case for First-Class Environments |
| 4 | + conf: OOPSLA'24 |
| 5 | + link: https://i.cs.hku.hk/~bruno/papers/oopsla24_first.pdf |
3 | 6 | - title: Dependent Merges and First-Class Environments
|
4 | 7 | conf: ECOOP'23
|
5 | 8 | link: https://i.cs.hku.hk/~bruno/papers/ecoop23.pdf
|
|
38 | 41 | link: https://i.cs.hku.hk/~bruno/papers/icfp2016.pdf
|
39 | 42 | - description: <i>Compositional Programming</i>, based on calculi with the merge operator and first-class traits, is a new statically-typed programming paradigm that addresses challenges like the Expression Problem and improves the modularity and extensibility of domain-specific languages.
|
40 | 43 | papers:
|
| 44 | + - title: Imperative Compositional Programming |
| 45 | + conf: OOPSLA'24 |
| 46 | + link: https://i.cs.hku.hk/~bruno/papers/oopsla24_imperative.pdf |
41 | 47 | - title: Compositional Embeddings of Domain-Specific Languages
|
42 | 48 | conf: OOPSLA'22
|
43 | 49 | link: https://i.cs.hku.hk/~bruno/papers/oopsla22extended.pdf
|
|
52 | 58 | link: https://i.cs.hku.hk/~bruno/papers/traits.pdf
|
53 | 59 | - description: Our work proposes a new formalization of <i>iso-recursive subtyping</i> and investigates its integration with various language features.
|
54 | 60 | papers:
|
| 61 | + - title: Full Iso-Recursive Types |
| 62 | + conf: OOPSLA'24 |
| 63 | + link: https://i.cs.hku.hk/~bruno/papers/oopsla24_full.pdf |
55 | 64 | - title: Recursive Subtyping for All
|
56 | 65 | conf: POPL'23
|
57 | 66 | link: https://i.cs.hku.hk/~bruno/papers/popl23recursive_extended.pdf
|
|
91 | 100 | link: https://i.cs.hku.hk/~bruno/papers/oopsla17.pdf
|
92 | 101 | - description: Our work presents a generalized definition of consistent subtyping in gradually-typed calculi with implicit polymorphism and applies type-directed operational semantics to <i>gradual typing</i>.
|
93 | 102 | papers:
|
| 103 | + - title: Merging Gradual Typing |
| 104 | + conf: OOPSLA'24 |
| 105 | + link: https://i.cs.hku.hk/~bruno/papers/oopsla24_gradual.pdf |
94 | 106 | - title: Type-Directed Operational Semantics for Gradual Typing
|
95 | 107 | conf: JFP
|
96 | 108 | link: https://i.cs.hku.hk/~bruno/papers/jfp24.pdf
|
97 | 109 | - title: Pragmatic Gradual Polymorphism with References
|
98 | 110 | conf: ESOP'23
|
99 | 111 | link: https://i.cs.hku.hk/~bruno/papers/esop23.pdf
|
100 |
| - - title: Type-Directed Operational Semantics for Gradual Typing |
101 |
| - conf: ECOOP'21 |
102 |
| - link: https://i.cs.hku.hk/~bruno/papers/ecoop2021.pdf |
103 | 112 | - title: Consistent Subtyping for All
|
104 | 113 | conf: TOPLAS
|
105 | 114 | link: https://i.cs.hku.hk/~bruno/papers/consistentTOPLAS.pdf
|
|
0 commit comments