English
Related papers

Related papers: Expansion for Universal Quantifiers

200 papers

We present the system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…

Logic in Computer Science · Computer Science 2023-06-22 Matthias Weber

The inclusion of universal quantification and a form of implication in goals in logic programming is considered. These additions provide a logical basis for scoping but they also raise new implementation problems. When universal and…

Programming Languages · Computer Science 2007-05-23 Gopalan Nadathur , Bharat Jayaraman , Keehang Kwon

Abbreviation expansion is a strategy used to speed up communication by limiting the amount of typing and using a language model to suggest expansions. Here we look at personalizing a Large Language Model's (LLM) suggestions based on prior…

Computation and Language · Computer Science 2023-12-25 Katrin Tomanek , Shanqing Cai , Subhashini Venugopalan

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

Explicit formulas expressing the solution to non-autonomous differential equations are of great importance in many application domains such as control theory or numerical operator splitting. In particular, intrinsic formulas allowing to…

Classical Analysis and ODEs · Mathematics 2023-03-13 Karine Beauchard , Jérémy Le Borgne , Frédéric Marbach

Python's typing system has evolved pragmatically into a powerful but theoretically fragmented system, with scattered specifications. This paper proposes a formalization to address this fragmentation. The central contribution is a formal…

Programming Languages · Computer Science 2025-09-17 Andrei Nacu , Dorel Lucanu

In this paper, we present a general realizability semantics for the simply typed $\lambda\mu$-calculus. Then, based on this semantics, we derive both weak and strong normalization results for two versions of the $\lambda\mu$-calculus…

Logic · Mathematics 2025-05-14 Peter Battyanyi , Karim Nour

We extend the semantics and type system of a lambda calculus equipped with common constructs to be "resource-aware". That is, the semantics keeps track of the usage of resources, and is stuck, besides in case of type errors, if either a…

Programming Languages · Computer Science 2026-03-24 Riccardo Bianchini , Francesco Dagnino , Paola Giannini , Elena Zucca

Fine-grained entity typing is the task of assigning fine-grained semantic types to entity mentions. We propose a neural architecture which learns a distributional semantic representation that leverages a greater amount of semantic context…

Computation and Language · Computer Science 2018-04-24 Sheng Zhang , Kevin Duh , Benjamin Van Durme

This paper introduces a weighted generalized inverse framework for Fourier extensions, designed to suppress spurious oscillations in the extended region while maintaining high approximation accuracy on the original interval. By formulating…

Numerical Analysis · Mathematics 2026-01-13 Zhenyu Zhao , Yanfei Wang , Anatoly G. Yagola , Xusheng Li

We introduce a new class of extensions of terms that consists in navigation strategies and insertion of contexts. We introduce an operation of combination on this class which is associative, admits a neutral element and so that each…

Logic in Computer Science · Computer Science 2019-04-25 Walid Belkhir , Nicolas Ratier , Duy Duc Nguyen Michel Lenczner

In interactive theorem provers (ITPs), extensible syntax is not only crucial to lower the cognitive burden of manipulating complex mathematical objects, but plays a critical role in developing reusable abstractions in libraries. Most ITPs…

Programming Languages · Computer Science 2023-06-22 Sebastian Ullrich , Leonardo de Moura

The vocabulary mismatch problem is one of the important challenges facing traditional keyword-based Information Retrieval Systems. The aim of query expansion (QE) is to reduce this query-document mismatch by adding related or synonymous…

Information Retrieval · Computer Science 2015-09-21 Dipasree Pal , Mandar Mitra , Samar Bhattacharya

In the pure Calculus of Constructions (CC) one can define data types and function over these, and there is a powerful higher order logic to reason over these functions and data types. This is due to the combination of impredicativity and…

Logic in Computer Science · Computer Science 2026-03-05 Herman Geuvers

Modern information retrieval must reconcile short, ambiguous queries with increasingly diverse and dynamic corpora. Query expansion (QE) remains a core technique for mitigating vocabulary mismatch, but its design space has been reshaped by…

Information Retrieval · Computer Science 2026-05-08 Minghan Li , Xinxuan Lv , Junjie Zou , Tongna Chen , Chao Zhang , Suchao An , Ercong Nie , Guodong Zhou

This article presents a bidirectional type system for the Calculus of Inductive Constructions (CIC). It introduces a new judgement intermediate between the usual inference and checking, dubbed constrained inference, to handle the presence…

Programming Languages · Computer Science 2021-04-20 Meven Lennon-Bertrand

In this paper we study possibilities of interpolation and symbol elimination in extensions of a theory $\mathcal{T}_0$ with additional function symbols whose properties are axiomatised using a set of clauses. We analyze situations in which…

Logic in Computer Science · Computer Science 2023-06-22 Viorica Sofronie-Stokkermans

We extend the recently introduced setting of coherent differentiation for taking into account not only differentiation, but also Taylor expansion in categories which are not necessarily (left)additive. The main idea consists in extending…

Logic in Computer Science · Computer Science 2025-04-16 Thomas Ehrhard , Aymeric Walch

Most of theoretical physics is based on the mathematics of functions of a real or a complex variable; yet we frequently are drawn to try extending our reach to include quaternions. The non-commutativity of the quaternion algebra poses…

Functional Analysis · Mathematics 2009-11-13 Charles Schwartz

We study two classes of extension problems, and their interconnections: (i) Extension of positive definite (p.d.) continuous functions defined on subsets in locally compact groups $G$; (ii) In case of Lie groups, representations of the…

Functional Analysis · Mathematics 2015-07-10 Palle Jorgensen , Steen Pedersen , Feng Tian
‹ Prev 1 8 9 10 Next ›