SPLASH 2025
Sun 12 - Sat 18 October 2025 Singapore
co-located with ICFP/SPLASH 2025

This program is tentative and subject to change.

Fri 17 Oct 2025 14:00 - 14:15 at Orchid West - Type 1

Software development is shifting from traditional programming to AI-integrated applications that leverage generative AI and large language models (LLMs) during runtime. However, integrating LLMs remains complex, requiring developers to manually craft prompts and process outputs. Existing tools attempt to assist with prompt engineering, but often introduce additional complexity. This paper presents Meaning-Typed Programming (MTP), a novel paradigm that abstracts LLM integration through intuitive language-level constructs. By leveraging the inherent semantic richness of code, MTP automates prompt generation and response handling without additional developer effort. We introduce the (1) by operator for seamless LLM invocation, (2) MT-IR, a meaning-based intermediate representation for semantic extraction, and (3) MT-Runtime, an automated system for managing LLM interactions. We implement MTP in Jac, a programming language that supersets Python, and find that MTP significantly reduces coding complexity while maintaining accuracy and efficiency. MTP significantly reduces development complexity, lines of code modifications needed, and costs while improving run-time performance and maintaining or exceeding the accuracy of existing approaches. Our user study shows that developers using MTP completed tasks 3.2x faster with 45% fewer lines of code compared to existing frameworks. Moreover, MTP demonstrates resilience even when up to 50% of naming conventions are degraded, demonstrating robustness to suboptimal code. MTP is developed as part of the Jaseci open-source project, and is available under the module by LLM.

This program is tentative and subject to change.

Fri 17 Oct

Displayed time zone: Perth change

13:45 - 15:30
13:45
15m
Talk
A Lightweight Type-and-Effect System for Invalidation Safety: Tracking Permanent and Temporary Invalidation With Constraint-Based Subtype Inference
OOPSLA
Cunyuan Gao HKUST, Lionel Parreaux HKUST (The Hong Kong University of Science and Technology)
14:00
15m
Talk
MTP: A Meaning-Typed Language Abstraction for AI-Integrated Programming
OOPSLA
Jayanaka Dantanarayana University of Michigan, Yiping Kang University of Michigan, Kugesan Sivasothynathan Jaseci Labs, Christopher Clarke University of Michigan, Baichuan Li University of Michigan, Savini Kashmira University of Michigan, Krisztian Flautner University of Michigan, Lingjia Tang University of Michigan, Jason Mars University of Michigan
14:15
15m
Talk
Modeling Reachability Types with Logical Relations -- Semantic Type Soundness, Termination, Effect Safety, and Equational Theory
OOPSLA
Yuyan Bao Augusta University, Songlin Jia Purdue University, USA, Guannan Wei Tufts University, Oliver Bračevac EPFL, LAMP, Tiark Rompf Purdue University
14:30
15m
Talk
Qualified Types with Boolean Algebras
OOPSLA
Edward Lee University of Waterloo; University of Toronto Scarborough, Jonathan Lindegaard Starup , Ondřej Lhoták University of Waterloo, Magnus Madsen Aarhus University
14:45
15m
Talk
RestPi: Path-Sensitive Type Inference for REST APIs
OOPSLA
Mark W. Aldrich Tufts University, Kyla H. Levin University of Massachusetts Amherst, USA, Michael Coblenz University of California, San Diego, Jeffrey S. Foster Tufts University
15:00
15m
Talk
Type-Outference with Label-Listeners: Foundations for Decidable Type-Consistency for Nominal Object-Oriented Generics
OOPSLA
Ross Tate Independent Researcher and Consultant
DOI Pre-print
15:15
15m
Talk
Type-Preserving Flat Closure Optimization
OOPSLA
Adam Geller Computer Science, University of British Columbia, Sean Bocirnea University of British Columbia, Chester Gould University of British Columbia, Paulette Koronkevich University of British Columbia, William J. Bowman University of British Columbia
DOI