Thomas P. Jensen
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
all 7 in the filters
who talks about the same things
- Amin Timany16 talks
- Lars Birkedal35 talks
- Eric Koskinen13 talks
- Leo Stefanesco6 talks
- Simon Oddershede Gregersen9 talks
- Alejandro Aguirre10 talks
| title | conference | date |
|---|---|---|
| Contextual Equality Saturation | SAS 2025 | 2025-10-13 |
Extends equality saturation so rewriting can occur under local branch assumptions, replacing costly swap laws with contextual rewriting rules that match a… | ||
| Type-directed Program Transformation for Constant-Time Enforcement | PPDP 2023 | 2023-10-22 |
Claims a relaxed information-flow type that distinguishes direct vs indirect flows and proves any program typable under it can be automatically transformed… | ||
| Stable relations and abstract interpretation of higher-order programs | SPLASH 2022 | 2022-12-05 |
Defines a denotational semantics where terms are stable relations (binary relations between substitutions and values) and proves it sound and complete against… | ||
| Stable Relations and Abstract Interpretation of Higher-Order Programs | ICFP 2020 | 2020-08-23 |
Defines a denotational semantics for the untyped call-by-value lambda calculus as stable relations (monotone relations from substitutions to value sets) and… | ||
| Regular Language Type Inference with Term Rewriting | ICFP 2020 | 2020-08-23 |
Claims fully automatic inference of regular-language types for higher-order, tree-processing programs by modeling semantics as term rewriting and types as tree… | ||
| nothing matches | ||