English
Related papers

Related papers: An Overview of Nominal-Typing versus Structural-Ty…

200 papers

Formal semantics provides rigorous, mathematically precise definitions of programming languages, with which we can argue about program behaviour and program equivalence by formal means; in particular, we can describe and verify our…

Programming Languages · Computer Science 2020-11-23 Péter Bereczky , Dániel Horpácsi , Simon Thompson

The main goal of concept-oriented programming (COP) is describing how objects are represented and accessed. It makes references (object locations) first-class elements of the program responsible for many important functions which are…

Software Engineering · Computer Science 2014-09-16 Alexandr Savinov

Bidirectional typechecking, in which terms either synthesize a type or are checked against a known type, has become popular for its applicability to a variety of type systems, its error reporting, and its ease of implementation. Following…

Programming Languages · Computer Science 2020-09-22 Jana Dunfield , Neelakantan R. Krishnaswami

Nonlinear optical properties (NLOPs) play a major role in photonics, electro-optics and optoelectronics, and other fields of modern optics. The design of new NLO molecules and materials has benefited from the development of computational…

Chemical Physics · Physics 2019-09-04 Sebastian P. Sitkiewicz , Mauricio Rodriguez-Mayorga , Josep M. Luis , Eduard Matito

One central mystery of neural NLP is what neural models "know" about their subject matter. When a neural machine translation system learns to translate from one language to another, does it learn the syntax or semantics of the languages?…

Computation and Language · Computer Science 2017-08-01 Chaitanya Malaviya , Graham Neubig , Patrick Littell

We propose an abstract notion of a type theory to unify the semantics of various type theories including Martin-L\"{o}f type theory, two-level type theory and cubical type theory. We establish basic results in the semantics of type theory:…

Category Theory · Mathematics 2023-08-10 Taichi Uemura

The notions of null-sets and nullity are present in all discourses of mathematics. They are based on the dual-pair of notions of "almost-every" and "almost none". A notion of nullity corresponds to a choice of subsets that one interprets as…

Category Theory · Mathematics 2025-12-19 Suddhasattwa Das

Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…

Logic in Computer Science · Computer Science 2022-11-04 Christian Williams , Michael Stay

For each type of number, structures that differ by arbitrary scaling factors and are isomorphic to one another are described. The scaling of number values in one structure, relative to the values in another structure, must be compensated…

Rings and Algebras · Mathematics 2013-12-06 Paul Benioff

Dynamically typed object-oriented languages enable programmers to write elegant, reusable and extensible programs. However, with the current methodology for program verification, the absence of static type information creates significant…

Programming Languages · Computer Science 2015-01-13 Björn Engelmann , Ernst-Rüdiger Olderog , Nils Erik Flick

General-purpose language models are trained to produce varied natural language outputs, but for some tasks, like annotation or classification, we need more specific output formats. LLM systems increasingly support structured output, which…

Computation and Language · Computer Science 2025-08-04 Sil Hamilton , David Mimno

We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…

Logic in Computer Science · Computer Science 2025-05-01 Alexander Baumgartner , Temur Kutsia , Jordi Levy , Mateu Villaret

Dependently typed programming languages have become increasingly relevant in recent years. They have been adopted in industrial strength programming languages and have been extremely successful as the basis for theorem provers. There are…

Programming Languages · Computer Science 2024-04-09 Christophe Scholliers

Let p/q be a rational number. Numeration in base p/q is defined by a function that evaluates each finite word over A_p={0,1,...,p-1} to some rational number. We let N_p/q denote the image of this evaluation function. In particular, N_p/q…

Logic in Computer Science · Computer Science 2023-06-22 Victor Marsault

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

Currently, there is a gap between the tools used by probability theorists and those used in formal reasoning about probabilistic programs. On the one hand, a probability theorist decomposes probabilistic state along the simple and natural…

Programming Languages · Computer Science 2024-05-30 John M. Li , Jon Aytac , Philip Johnson-Freyd , Amal Ahmed , Steven Holtzen

Modal logics have proved useful for many reasoning tasks in symbolic artificial intelligence (AI), such as belief revision, spatial reasoning, among others. On the other hand, mathematical morphology (MM) is a theory for non-linear analysis…

Artificial Intelligence · Computer Science 2023-03-10 Marc Aiguier , Isabelle Bloch , Salim Nibouche , Ramon Pino Perez

This article deals with OLAP systems based on multidimensional model. The conceptual model we provide, represents data through a constellation (multi-facts) composed of several multi-hierarchy dimensions. In this model, data are displayed…

Databases · Computer Science 2010-05-20 Franck Ravat , Olivier Teste , Gilles Zurfluh

Session types allow communication protocols to be specified type-theoretically so that protocol implementations can be verified by static type checking. We extend previous work on session types for distributed object-oriented languages in…

Programming Languages · Computer Science 2017-01-11 Simon J. Gay , Nils Gesbert , António Ravara , Vasco T. Vasconcelos

A real number is a rule that, when provided with a rational interval, answers Yes or No depending on if the real number ought to be considered to be in the given interval. Since the goal is to define the real numbers, this can only motivate…

General Mathematics · Mathematics 2023-05-18 James Taylor