English
Related papers

Related papers: Dynamic Type Inference for Gradual Hindley--Milner…

200 papers

Large Language Models (LLMs) have demonstrated remarkable fluency and versatility across a wide range of NLP tasks, yet they remain prone to factual inaccuracies and hallucinations. This limitation poses significant risks in high-stakes…

Artificial Intelligence · Computer Science 2026-04-24 Vipula Rawte , Ryan Rossi , Franck Dernoncourt , Nedim Lipka

Diffusion Language Models (DLMs) are rapidly emerging as a powerful and promising alternative to the dominant autoregressive (AR) paradigm. By generating tokens in parallel through an iterative denoising process, DLMs possess inherent…

Computation and Language · Computer Science 2025-12-08 Tianyi Li , Mingda Chen , Bowei Guo , Zhiqiang Shen

In the theory of programming languages, type inference is the process of inferring the type of an expression automatically, often making use of information from the context in which the expression appears. Such mechanisms turn out to be…

Logic in Computer Science · Computer Science 2012-05-10 Jeremy Avigad

The open-endedness of large language models (LLMs) combined with their impressive capabilities may lead to new safety issues when being exploited for malicious use. While recent studies primarily focus on probing toxic outputs that can be…

Computation and Language · Computer Science 2023-11-30 Jiaxin Wen , Pei Ke , Hao Sun , Zhexin Zhang , Chengfei Li , Jinfeng Bai , Minlie Huang

Text infilling is defined as a task for filling in the missing part of a sentence or paragraph, which is suitable for many real-world natural language generation scenarios. However, given a well-trained sequential generative model,…

Computation and Language · Computer Science 2019-11-20 Dayiheng Liu , Jie Fu , Pengfei Liu , Jiancheng Lv

There has been growing interest in automatically predicting missing type annotations in programs written in Python and JavaScript. While prior methods have achieved impressive accuracy when predicting the most common types, they often…

Software Engineering · Computer Science 2023-03-20 Jiayi Wei , Greg Durrett , Isil Dillig

Large pretrained language models have shown surprising in-context learning (ICL) ability. With a few demonstration input-label pairs, they can predict the label for an unseen input without parameter updates. Despite the great success in…

Computation and Language · Computer Science 2023-05-16 Damai Dai , Yutao Sun , Li Dong , Yaru Hao , Shuming Ma , Zhifang Sui , Furu Wei

Syntactic Transformer language models aim to achieve better generalization through simultaneously modeling syntax trees and sentences. While prior work has been focusing on adding constituency-based structures to Transformers, we introduce…

Computation and Language · Computer Science 2024-07-25 Yida Zhao , Chao Lou , Kewei Tu

A key challenge when statically typing so-called dynamic languages is the ubiquity of value-based overloading, where a given function can dynamically reflect upon and behave according to the types of its arguments. Thus, to establish basic…

Programming Languages · Computer Science 2015-05-01 Panagiotis Vekris , Benjamin Cosman , Ranjit Jhala

Text-video retrieval is a critical multi-modal task to find the most relevant video for a text query. Although pretrained models like CLIP have demonstrated impressive potential in this area, the rising cost of fully finetuning these models…

Computer Vision and Pattern Recognition · Computer Science 2024-01-22 Xiangpeng Yang , Linchao Zhu , Xiaohan Wang , Yi Yang

We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a termination analyzer tries to prove that a given class of…

Programming Languages · Computer Science 2007-05-23 Fred Mesnard , Roberto Bagnara

Diffusion language models promise parallel generation, yet still lag behind autoregressive (AR) models in quality. We stem this gap to a failure of introspective consistency: AR models agree with their own generations, while DLMs often do…

Large language models (LLM), such as Google's Minerva and OpenAI's GPT families, are becoming increasingly capable of solving mathematical quantitative reasoning problems. However, they still make unjustified logical and computational…

Artificial Intelligence · Computer Science 2024-03-28 Jin Peng Zhou , Charles Staats , Wenda Li , Christian Szegedy , Kilian Q. Weinberger , Yuhuai Wu

Large language models (LMs) are capable of in-context learning from a few demonstrations (example-label pairs) to solve new tasks during inference. Despite the intuitive importance of high-quality demonstrations, previous work has observed…

Machine Learning · Computer Science 2025-05-20 Junyi Tao , Xiaoyin Chen , Nelson F. Liu

In a previous work Baillot and Terui introduced Dual light affine logic (DLAL) as a variant of Light linear logic suitable for guaranteeing complexity properties on lambda calculus terms: all typable terms can be evaluated in polynomial…

Logic in Computer Science · Computer Science 2015-07-01 Vincent Atassi , Patrick Baillot , Kazushige Terui

Recent studies have introduced a new class of generative models for synthesizing implicit neural representations (INRs) that capture arbitrary continuous signals in various domains. These models opened the door for domain-agnostic…

Machine Learning · Computer Science 2024-03-21 Dogyun Park , Sihyeon Kim , Sojin Lee , Hyunwoo J. Kim

Effective incident response (IR) is critical for mitigating cyber threats, yet security teams are overwhelmed by alert fatigue, high false-positive rates, and the vast volume of unstructured Cyber Threat Intelligence (CTI) documents. While…

Cryptography and Security · Computer Science 2025-08-15 Amine Tellache , Abdelaziz Amara Korba , Amdjed Mokhtari , Horea Moldovan , Yacine Ghamri-Doudane

We study the problem of generating plans for given natural language planning task requests. On one hand, LLMs excel at natural language processing but do not perform well on planning. On the other hand, classical planning tools excel at…

Computation and Language · Computer Science 2024-07-02 Sudhir Agarwal , Anu Sreepathy

Interpretable text representations should expose coordinates that are not only predictive, but also meaningful enough for independent auditors to apply. Existing discriminative representations often use anonymous embedding directions, while…

Computation and Language · Computer Science 2026-05-21 Tong Wang , Yiqing Xu , Leo Yang Yang

Type-and-effect systems help the programmer to organize data and computational effects in a program. While for traditional type systems expressive variants with sophisticated inference algorithms have been developed and widely used in…

Programming Languages · Computer Science 2025-10-24 Patrycja Balik , Szymon Jędras , Piotr Polesiuk