English
Related papers

Related papers: Simple Type Theory with Undefinedness, Quotation, …

200 papers

In Martin-L\"of's Intensional Type Theory, identity type is a heavily used and studied concept. The reason for that is the fact that it's responsible for the recently discovered connection between Type Theory and Homotopy Theory. The main…

Logic in Computer Science · Computer Science 2015-02-17 Arthur Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

I present and defend a new ontology for quantum theories (or ``interpretations'' of quantum theory) called Generative Quantum Theory (GQT). GQT postulates different sets of features, and the combination of these different features can help…

Quantum Physics · Physics 2024-08-09 Francisco Pipa

The introduction of the Segment Anything Model (SAM) has paved the way for numerous semantic segmentation applications. For several tasks, quantifying the uncertainty of SAM is of particular interest. However, the ambiguous nature of the…

Computer Vision and Pattern Recognition · Computer Science 2025-07-30 Timo Kaiser , Thomas Norrenbrock , Bodo Rosenhahn

Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable.…

Logic in Computer Science · Computer Science 2017-10-31 Simon Huber

Model explanations can be valuable for interpreting and debugging predictive models. We study a specific kind called Concept Explanations, where the goal is to interpret a model using human-understandable concepts. Although popular for…

Machine Learning · Computer Science 2024-04-08 Vihari Piratla , Juyeon Heo , Katherine M. Collins , Sukriti Singh , Adrian Weller

We present a method to simplify expressions in the context of an equational theory. The basic ideas and concepts of the method have been presented previously elsewhere but here we tackle the difficult task of making it efficient in…

Logic in Computer Science · Computer Science 2020-03-16 Baudouin Le Charlier

Quantum Shannon theory is loosely defined as a collection of coding theorems, such as classical and quantum source compression, noisy channel coding theorems, entanglement distillation, etc., which characterize asymptotic properties of…

Quantum Physics · Physics 2008-10-03 I. Devetak , A. W. Harrow , A. Winter

Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…

Logic in Computer Science · Computer Science 2015-03-17 Christoph Benzmueller

Uncertainty quantification (UQ) methods for Large Language Models (LLMs) encompass a variety of approaches, with two major types being particularly prominent: information-based, which focus on model confidence expressed as token…

Computation and Language · Computer Science 2025-12-10 Roman Vashurin , Maiya Goloburda , Albina Ilina , Aleksandr Rubashevskii , Preslav Nakov , Artem Shelmanov , Maxim Panov

This paper provides a tutorial about uncertainty quantification (UQ) for those who have no background but are interested in learning more in this area. It exploits many very simple examples, which are understandable to undergraduates, to…

Dynamical Systems · Mathematics 2025-10-07 Nan Chen , Stephen Wiggins , Marios Andreou

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…

Programming Languages · Computer Science 2015-07-01 William Lovas , Frank Pfenning

Large Language Models (LLMs) have demonstrated remarkable capabilities across various tasks due to large training datasets and powerful transformer architecture. However, the reliability of responses from LLMs remains a question.…

Computation and Language · Computer Science 2025-02-26 Tiejin Chen , Xiaoou Liu , Longchao Da , Jia Chen , Vagelis Papalexakis , Hua Wei

Understanding the meaning of a text is a fundamental challenge of natural language understanding (NLU) and from its early days, it has received significant attention through question answering (QA) tasks. We introduce a general…

Artificial Intelligence · Computer Science 2020-09-23 Kinjal Basu , Sarat Chandra Varanasi , Farhad Shakerin , Gopal Gupta

Accurately quantifying a large language model's (LLM) predictive uncertainty is crucial for judging the reliability of its answers. While most existing research focuses on short, directly answerable questions with closed-form outputs (e.g.,…

Computation and Language · Computer Science 2025-08-08 Yinghao Li , Rushi Qiang , Lama Moukheiber , Chao Zhang

A careful study of the classical/quantum connection with the aid of coherent states offers new insights into various technical problems. This analysis includes both canonical as well as closely related affine quantization procedures. The…

High Energy Physics - Theory · Physics 2015-06-12 John R. Klauder

In this paper, we outline the prototype of an automated inference tool, called QUIP, which provides a uniform implementation for several nonmonotonic reasoning formalisms. The theoretical basis of QUIP is derived from well-known results…

Artificial Intelligence · Computer Science 2007-05-23 Uwe Egly , Thomas Eiter , Hans Tompits , Stefan Woltran

If Uncertainty Quantification (UQ) is crucial to achieve trustworthy Machine Learning (ML), most UQ methods suffer from disparate and inconsistent evaluation protocols. We claim this inconsistency results from the unclear requirements the…

Machine Learning · Computer Science 2022-07-28 Victor Bouvier , Simona Maggio , Alexandre Abraham , Léo Dreyfus-Schmidt

A new approach to the theory of polynomial solutions of q - difference equations is proposed. The approach is based on the representation theory of simple Lie algebras and their q - deformations and is presented here for U_q(sl(n)). First a…

q-alg · Mathematics 2016-09-08 V. K. Dobrev , P. Truini , L. C. Biedenharn

This is an introductory textbook to univalent mathematics and homotopy type theory, a mathematical foundation that takes advantage of the structural nature of mathematical definitions and constructions. It is common in mathematical practice…

Logic · Mathematics 2022-12-22 Egbert Rijke

We introduce a modification of standard Martin-Lof type theory in which we eliminate definitional equality and replace all computation rules by propositional equalities. We show that type checking for such a system can be done in quadratic…

Logic in Computer Science · Computer Science 2021-02-02 Benno van den Berg , Martijn den Besten