We are a group of programming language researchers who study topics about functional language design, type theory, compilers and program analysis.
The University of Hong Kong
Calculi about disjoint intersection types enable an highly modular and compositional programming style that addresses the Expression Problem naturally, and allows for a much more dynamic form of inheritance.
Those works present a novel modular programming style.
This work presents a generalized definition of consistent subtyping that works for polymorphic types.
Consistent Subtyping for All TOPLAS
Those works propose a unified syntax that accounts for types and terms which still preserves decidable type-checking.
This paper provides the first mechanized formalization of type inference for higher-ranked polymorphism.
This work proposes a solution of challenge of kind inference for datatype declarations for Haskell98 and modern Haskell.
Kind Inference for Datatypes POPL 20
A new iso-recursive subtyping formulation which takes advantage over other designs on both theoretical side and implementation side.
Revisiting Iso-Recursive Subtyping OOPSLA 20
This paper presents a variant of bi-directional type checking where the type information flows from arguments to functions.
Let Arguments go First ESOP 18
This paper proposes a novel methodology for designing subtyping relations that exploits duality between intersection types and union types.
Type-directed operational semantics(TDOS) is a variant of small-step operational semantics. In TDOS, type annotations become operationally relevant and can affect the result of a program.
Bruno C. d. S. Oliveira Associate Professor
Xuejing (Snow) Huang PhD student
Yaoda Zhou PhD student
Baber Rehman PhD student
Mingqi (Alvin) Xue PhD student
Yaozhu Sun PhD student
Wenjia Ye PhD student
Xu Xue MPhil student
Chen Cui PhD student
Jinhao Tan PhD student
Shengyi Jiang PhD student
Flow-sensitive typing for isomorphic expressions
Sep 24, 2021
Flow typing or occurrence typing specializes the type of an expression in a type-case analysis. It has been implemented in some modern programming languages including Ceylon, Typescript, Flow and Racket...
Simplifying Type Inference
Sep 17, 2021
To extend the formalization of type inference with various practical features, including bounded quantification and union and intersection types, a minimal, unified and scalable metatheory is firstly needed. In this...
On the Deduction Theorem and Subtyping Relations
Aug 31, 2021
Union Types with Disjoint Switches
Aug 17, 2021
Union types allow expressing terms with alternative types, and are nowadays a common feature in many modern programming languages. This work investigates a formulation of union types, inspired by the...
Distributing Intersection and Union Types with Splits and Duality
Aug 10, 2021
A practice talk for ICFP.