English
Related papers

Related papers: Cocon: Computation in Contextual Type Theory

200 papers

Chain-of-thought (CoT) decoding enables language models to improve reasoning performance at the cost of high generation latency in decoding. Recent proposals have explored variants of contemplation tokens, a term we introduce that refers to…

Computation and Language · Computer Science 2024-12-18 Jeffrey Cheng , Benjamin Van Durme

While Chain-of-Thought (CoT) prompting has significantly advanced the reasoning capabilities of Multimodal Large Language Models (MLLMs), relying solely on linear text sequences remains a bottleneck for complex tasks. We observe that even…

Computation and Language · Computer Science 2026-02-12 Lingzhuang Sun , Yuxia Zhu , Ruitong Liu , Hao Liang , Zheng Sun , Caijun Jia , Honghao He , Yuchen Wu , Siyuan Li , Jingxuan Wei , Xiangxiang Zhang , Bihui Yu , Wentao Zhang

Contextual type theory distinguishes between bound variables and meta-variables to write potentially incomplete terms in the presence of binders. It has found good use as a framework for concise explanations of higher-order unification,…

Logic in Computer Science · Computer Science 2011-11-02 Mathieu Boespflug , Brigitte Pientka

This text summarizes and expands the content of a general audience talk given in 2018 at the University of Mainz. Motivated by recent developments in dependent type theory and infinity category theory, it presents a history of ideas around…

History and Overview · Mathematics 2026-04-21 Stefan Müller-Stach

Scaling language models to larger and deeper sizes has led to significant boosts in performance. Even though the size of these models limits their application in compute-constrained environments, the race to continually develop ever larger…

Computation and Language · Computer Science 2024-08-16 Amirkeivan Mohtashami , Matteo Pagliardini , Martin Jaggi

Chain-of-thought (CoT) reasoning has enabled transformer-based language models to excel at complex mathematics and multi-step planning. However, in standard decoder-only architectures, these reasoning steps are externalized in natural…

Computation and Language · Computer Science 2025-09-30 Wenquan Lu , Yuechuan Yang , Kyle Lee , Yanshu Li , Enqi Liu

We present three projects concerned with applications of proof assistants in the area of programming language theory and mathematics. The first project is about a certified compilation technique for a domain-specific programming language…

Programming Languages · Computer Science 2018-11-29 Danil Annenkov

Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in…

Logic in Computer Science · Computer Science 2015-07-30 Nicolas Guenot , Daniel Gustafsson

Large language models (LLMs) have shown impressive performance on complex reasoning by leveraging chain-of-thought (CoT) prompting to generate intermediate reasoning chains as the rationale to infer the answer. However, existing CoT studies…

Computation and Language · Computer Science 2024-05-21 Zhuosheng Zhang , Aston Zhang , Mu Li , Hai Zhao , George Karypis , Alex Smola

Large language models have shown remarkable reasoning abilities and scaling laws suggest that large parameter count, especially along the depth axis, is the primary driver. In this work, we make a stronger claim -- many reasoning problems…

Computation and Language · Computer Science 2025-02-25 Nikunj Saunshi , Nishanth Dikkala , Zhiyuan Li , Sanjiv Kumar , Sashank J. Reddi

We extend resource-bounded type theory to Martin-Lof type theory (MLTT) with dependent types, enabling size-indexed cost bounds for programs over inductive families. We introduce a resource-indexed universe hierarchy U_r where r is an…

Logic in Computer Science · Computer Science 2026-01-19 Mirco A. Mannucci , Corey Thuro

Recently, inference-time scaling of chain-of-thought (CoT) has been demonstrated as a promising approach for addressing multi-modal reasoning tasks. While existing studies have predominantly centered on text-based thinking, the integration…

Computation and Language · Computer Science 2025-05-27 Yujie Lin , Ante Wang , Moye Chen , Jingyao Liu , Hao Liu , Jinsong Su , Xinyan Xiao

Computational content encoded into constructive type theory proofs can be used to make computing experiments over concrete data structures. In this paper, we explore this possibility when working in Coq with chain complexes of infinite type…

Logic in Computer Science · Computer Science 2010-04-29 César Domínguez , Julio Rubio

The modal logic S4 can be used via a Curry-Howard style correspondence to obtain a lambda-calculus. Modal (boxed) types are intuitively interpreted as `closed syntax of the calculus'. This lambda-calculus is called modal type theory ---…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch Gabbay , Aleksandar Nanevski

Abstract reasoning, the ability to reason from the abstract essence of a problem, serves as a key to generalization in human reasoning. However, eliciting language models to perform reasoning with abstraction remains unexplored. This paper…

Computation and Language · Computer Science 2024-09-27 Ruixin Hong , Hongming Zhang , Xiaoman Pan , Dong Yu , Changshui Zhang

Recent large language models support inputs of up to 10 million tokens, yet they perform poorly on long-context tasks that require complex reasoning. Such tasks can be solved using only a subset of the input -- a proxy context -- rather…

Computation and Language · Computer Science 2026-05-25 Miao Li , Irina Saparina , Alexander Gurung , Mirella Lapata

In this paper, we propose a novel learning paradigm, termed Chain-of-Model (CoM), which incorporates the causal relationship into the hidden states of each layer as a chain style, thereby introducing great scaling efficiency in model…

Generating intermediate steps, or Chain of Thought (CoT), is an effective way to significantly improve language models' (LM) multi-step reasoning capability. However, the CoT lengths can grow rapidly with the problem complexity, easily…

Computation and Language · Computer Science 2023-06-13 Soochan Lee , Gunhee Kim

We introduce a novel, logic-independent framework for the study of sequent-style proof systems, which covers a number of proof-theoretic formalisms and concrete proof systems that appear in the literature. In particular, we introduce a…

Logic in Computer Science · Computer Science 2025-12-22 Tim S. Lyon , Piotr Ostropolski-Nalewaja

Large Language Models (LLMs) excel at reasoning and planning when trained on chainof-thought (CoT) data, where the step-by-step thought process is explicitly outlined by text tokens. However, this results in lengthy inputs where many words…

Computation and Language · Computer Science 2025-09-03 DiJia Su , Hanlin Zhu , Yingchen Xu , Jiantao Jiao , Yuandong Tian , Qinqing Zheng