MTP: A Meaning-Typed Language Abstraction for AI-Integrated Programming
Not on the map. Why?
Abstract (arXiv)
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 byLLM.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 17 of its 65 references that are in the map. First posted on arXiv 14 May 2024.
Builds on
17 of 65 references.
References · 17
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
- 2023SGLang: Efficient Execution of Structured Language Model Programscited by 1,107
- 2022DeepSpeed Inference: Enabling Efficient Inference of Transformer Models at Unprecedented Scalecited by 403
- 2023SpecInfer: Accelerating Generative Large Language Model Serving with Tree-based Speculative Inference and Verificationcited by 359
- 2023GPTScore: Evaluate as You Desirecited by 357
- 2020Ansor: Generating High-Performance Tensor Programs for Deep Learningcited by 199
- 2022Prompting Is Programming: A Query Language for Large Language Modelscited by 110
- 2023OliVe: Accelerating Large Language Models via Hardware-friendly Outlier-Victim Pair Quantizationcited by 83
- 2023SpotServe: Serving Generative Large Language Models on Preemptible Instancescited by 83
- 2018Glow: Graph Lowering Compiler Techniques for Neural Networkscited by 73
- 2023Scallop: A Language for Neurosymbolic Programmingcited by 63
5 more
- 2021DNNFusion: Accelerating Deep Neural Networks Execution with Advanced Operator Fusioncited by 56
- 2024ExeGPT: Constraint-Aware Resource Scheduling for LLM Inferencecited by 43
- 2021CoSA: Scheduling by Constrained Optimization for Spatial Acceleratorscited by 22
- 2022DREAM: A Dynamic Scheduler for Dynamic Real-time Multi-model ML Workloadscited by 8
- 2023The Jaseci Programming Paradigm and Runtime Stack: Building Scale-out Production Applications Easy and Fastcited by 4
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.