English
Related papers

Related papers: Normalization for multimodal type theory

200 papers

We present guarded dependent type theory, gDTT, an extensional dependent type theory with a `later' modality and clock quantifiers for programming and proving with guarded recursive and coinductive types. The later modality is used to…

Logic in Computer Science · Computer Science 2016-01-08 Aleš Bizjak , Hans Bugge Grathwohl , Ranald Clouston , Rasmus E. Møgelberg , Lars Birkedal

Categorical gluing is a powerful technique for proving meta-theorems of type theories such as canonicity and normalization. Synthetic Tait Computability (STC) provides an abstract treatment of the complex gluing models by internalizing the…

Programming Languages · Computer Science 2025-12-05 Runming Li , Yue Yao , Robert Harper

We present a logically principled foundation for systematizing, in a way that works with any computational effect and evaluation order, SMT constraint generation seen in refinement type systems for functional programming languages. By…

Programming Languages · Computer Science 2023-08-21 Dimitrios J. Economou , Neel Krishnaswami , Jana Dunfield

Topic modelling was mostly dominated by Bayesian graphical models during the last decade. With the rise of transformers in Natural Language Processing, however, several successful models that rely on straightforward clustering approaches in…

Machine Learning · Computer Science 2024-03-07 Arik Reuter , Anton Thielmann , Christoph Weisser , Benjamin Säfken , Thomas Kneib

Modern neural machine translation (NMT) models have achieved competitive performance in standard benchmarks. However, they have recently been shown to suffer limitation in compositional generalization, failing to effectively learn the…

Computation and Language · Computer Science 2022-10-14 Yongjing Yin , Yafu Li , Fandong Meng , Jie Zhou , Yue Zhang

Transformers have achieved state-of-the-art performance in numerous tasks. In this paper, we propose a continuous-time formulation of transformers. Specifically, we consider a dynamical system whose governing equation is parametrized by…

Machine Learning · Computer Science 2025-02-03 Kelvin Kan , Xingjian Li , Stanley Osher

Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its scalability (unlike Damas-Milner type inference, bidirectional typing remains decidable even for very…

Programming Languages · Computer Science 2020-08-25 Jana Dunfield , Neelakantan R. Krishnaswami

Reasoning over multiple modalities, e.g. in Visual Question Answering (VQA), requires an alignment of semantic concepts across domains. Despite the widespread success of end-to-end learning, today's multimodal pipelines by and large…

Computer Vision and Pattern Recognition · Computer Science 2021-09-10 Jan-Martin O. Steitz , Jonas Pfeiffer , Iryna Gurevych , Stefan Roth

Univalent homotopy type theory (HoTT) may be seen as a language for the category of $\infty$-groupoids. It is being developed as a new foundation for mathematics and as an internal language for (elementary) higher toposes. We develop the…

Category Theory · Mathematics 2023-06-22 Egbert Rijke , Michael Shulman , Bas Spitters

The style transfer task in Text-to-Speech refers to the process of transferring style information into text content to generate corresponding speech with a specific style. However, most existing style transfer approaches are either based on…

Audio and Speech Processing · Electrical Eng. & Systems 2024-02-01 Wenhao Guan , Yishuang Li , Tao Li , Hukai Huang , Feng Wang , Jiayan Lin , Lingyan Huang , Lin Li , Qingyang Hong

The Mott-Anderson transition in the disordered charge-transfer model displays several new features in comparison to what is found in the disordered single-band Hubbard model, as recently demonstrated by large-scale computational…

Strongly Correlated Electrons · Physics 2014-05-09 W. S. Oliveira , M. C. O. Aguiar , V. Dobrosavljevic

Although neural machine translation (NMT) models perform well in the general domain, it remains rather challenging to control their generation behavior to satisfy the requirement of different users. Given the expensive training cost and the…

Computation and Language · Computer Science 2024-03-22 Yuzhuang Xu , Shuo Wang , Peng Li , Xuebo Liu , Xiaolong Wang , Weidong Liu , Yang Liu

We develop a technique for normalization for $\infty$-type theories. The normalization property helps us to prove a coherence theorem: the initial model of a given $\infty$-type theory is $0$-truncated. The coherence theorem justifies…

Logic · Mathematics 2022-12-23 Taichi Uemura

We report on a detailed exploration of the properties of conversion (definitional equality) in dependent type theory, with the goal of certifying decision procedures for it. While in that context the property of normalisation has attracted…

Programming Languages · Computer Science 2025-07-23 Meven Lennon-Bertrand

The capability to jointly process multi-modal information is becoming an essential task. However, the limited number of paired multi-modal data and the large computational requirements in multi-modal learning hinder the development. We…

Computation and Language · Computer Science 2025-06-09 Minsu Kim , Jee-weon Jung , Hyeongseop Rha , Soumi Maiti , Siddhant Arora , Xuankai Chang , Shinji Watanabe , Yong Man Ro

This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of…

Logic in Computer Science · Computer Science 2017-10-09 Lars Birkedal , Aleš Bizjak , Ranald Clouston , Hans Bugge Grathwohl , Bas Spitters , Andrea Vezzosi

We present a novel method of computing the beta-normal eta-long form of a simply-typed lambda-term by constructing traversals over a variant abstract syntax tree of the term. In contrast to beta-reduction, which changes the term by…

Programming Languages · Computer Science 2015-11-10 C. -H. Luke Ong

We propose a novel decoding approach for neural machine translation (NMT) based on continuous optimisation. We convert decoding - basically a discrete optimization problem - into a continuous optimization problem. The resulting constrained…

Computation and Language · Computer Science 2017-07-25 Cong Duy Vu Hoang , Gholamreza Haffari , Trevor Cohn

The training of topic models for a multilingual environment is a challenging task, requiring the use of sophisticated algorithms, topic-aligned corpora, and manual evaluation. These difficulties are further exacerbated when the developer…

Computation and Language · Computer Science 2025-09-03 Felix Engl , Andreas Henrich

Investigating the reasoning abilities of transformer models, and discovering new challenging tasks for them, has been a topic of much interest. Recent studies have found these models to be surprisingly strong at performing deductive…

Computation and Language · Computer Science 2021-12-17 Kyle Richardson , Ashish Sabharwal