Zhenjiang Hu
where else to find them
what they talk about
all 6 in the filters
where they keep going back
all 8 in the filters
on a stage with
all 22 in the filters
who talks about the same things
- Ruifeng Xie5 talks
- Yingfei Xiong9 talks
- Ruyi Ji8 talks
- Yizhou Zhang13 talks
- Işıl Dillig21 talks
- Xing Zhang3 talks
| title | conference | date |
|---|---|---|
| Inferring Typing Rules for Contextual Sugars | PEPM 2026 | 2026-01-11 |
Algorithm infers typing rules for a class of contextual sugars by fusing sugaring rules with core-language typing and by performing early typing of templates… | ||
| Compositions for Free: Reasoning about Effectful Lenses | HOPE 2025 | 2025-10-12 |
Presents a construction that composes two different monads into a free polymonad so effects run in two staged layers and most roundtrip laws become theorems… | ||
| Effectful Lenses: There and Back with Different Monads | ICFP 2025 | 2025-10-12 |
Framework introduces effectful lenses that allow different monads in the two directions, using the lenses with complements encoding plus user-specified… | ||
| Biparsers: Exact Printing for Data Synchronisation | POPL 2025 | 2025-01-19 |
Claims a first biparser framework that achieves exact-printing with non-injective parsers by treating parser/printer pairs as monadic lenses, proving… | ||
| Semantics Lifting for Syntactic Sugar | OOPSLA 2024 | 2024-10-20 |
Presents an algorithm that derives host-independent evaluation rules from host semantics and desugaring rules and implements it as Osazone, a tool that lifts… | ||
| Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis | PLDI 2024 | 2024-06-24 |
Superfusion uses inductive program synthesis to remove intermediate collections by synthesizing a small compression function that maps packed structures to… | ||
| Fusing Direct Manipulations into Functional Programs | POPL 2024 | 2024-01-14 |
Operation-based system defines a small composable Delta language DM for edits (add, mul, tuple, list-fold, constraints) and a fusion algorithm that propagates… | ||
| Design Datalog Templates for Synthesizing Bidirectional Programs from Tabular E... | LOPSTR 2023 | 2023-10-23 |
Designs Datalog templates that let ProIn plus Z3 synthesize paired get/put programs from one tabular example and a supplied schema with functional… | ||
| Bidirectional Object-Oriented Programming: Towards Programmatic and Direct Mani... | OOPSLA 2023 | 2023-10-23 |
Claims a first bidirectional object‑oriented language, BFJ, with a new backward semantics that handles ambiguous class‑hierarchy updates and mutable references… | ||
| Improving Oracle-Guided Inductive Synthesis by Efficient Question Selection | OOPSLA 2023 | 2023-10-23 |
Proposes LearnSy, a question selector that models complex operator behavior as simple random events and computes the expected number of program pairs that… | ||
| A Counterexample-Guided Debugger for Non-Recursive Datalog | SPLASH 2022 | 2022-12-05 |
Prototype debugs non-recursive Datalog by (1) a property language for pre/postconditions, (2) a counterexample generator that encodes rule evaluation… | ||
| Generalizable Synthesis Through Unification | OOPSLA 2021 | 2021-10-17 |
Defines an Occam solver with PAC-style guarantees and proves Eusolver fails that criterion, then builds PolyGen, an Occam STUN solver that decomposes CLIA… | ||
| Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example | OOPSLA 2020 | 2020-11-15 |
MaxFlash combines dynamic programming (PROSE-style witness functions and caching) with structural probability from Euphony, using a topdown prediction model to… | ||
| nothing matches | ||