A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo)

The human ability to think about thinking ("theory of mind") is a fundamental object of study in many disciplines. In recent decades, researchers across these disciplines have converged on a rich computational paradigm for modeling theory of mind, grounded in recursive probabilistic reasoning. However, practitioners often find programming in this paradigm challenging: first, because thinking-about-thinking is confusing for programmers, and second, because models are slow to run. This paper presents memo, a new domain-specific probabilistic programming language that overcomes these challenges: first, by providing specialized syntax and semantics for theory of mind, and second, by taking a unique approach to inference that scales well on modern hardware via array programming. memo enables practitioners to write dramatically faster models with much less code, and has already been adopted by several research groups.

Authors

Institutions

Publication Details

Journal
Proceedings of the ACM on Programming Languages
Published
2025-10-09
DOI
https://doi.org/10.1145/3763078
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo)

Kartik Chandra, Jonathan Ragan‐Kelley, Tianqiao Chen, Joshua B. Tenenbaum
Proceedings of the ACM on Programming Languages
Logic, Reasoning, and Knowledge
article

A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo)

Kartik Chandra, Jonathan Ragan‐Kelley, Tianqiao Chen, Joshua B. Tenenbaum
article en

Abstract

The human ability to think about thinking ("theory of mind") is a fundamental object of study in many disciplines. In recent decades, researchers across these disciplines have converged on a rich computational paradigm for modeling theory of mind, grounded in recursive probabilistic reasoning. However, practitioners often find programming in this paradigm challenging: first, because thinking-about-thinking is confusing for programmers, and second, because models are slow to run. This paper presents memo, a new domain-specific probabilistic programming language that overcomes these challenges: first, by providing specialized syntax and semantics for theory of mind, and second, by taking a unique approach to inference that scales well on modern hardware via array programming. memo enables practitioners to write dramatically faster models with much less code, and has already been adopted by several research groups.

Proceedings of the ACM on Programming LanguagesVol. 9(OOPSLA2)
Massachusetts Institute of Technology (US)
Openalex Percentile: Top 85%
Logic, Reasoning, and Knowledge
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Domain-Specific Probabilistic Programming Language for Reasoning about Reasoning (Or: A Memo on memo) — Kartik Chandra, Jonathan Ragan‐Kelley, et al. · Proceedings of the ACM on Programming Languages (2025) | TGRS Research Map | TGRS