English
Related papers

Related papers: Parametricity for Nested Types and GADTs

200 papers

We are born with the ability to learn concepts by comparing diverse observations. This helps us to understand the new world in a compositional manner and facilitates extrapolation, as objects naturally consist of multiple concepts. In this…

Machine Learning · Computer Science 2025-10-02 Yujia Zheng , Shaoan Xie , Kun Zhang

A new method of deriving comparative statics information using generalized compensated derivatives is presented which yields constraint-free semidefiniteness results for any differentiable, constrained optimization problem. More generally,…

Optimization and Control · Mathematics 2013-10-29 M. Hossein Partovi , Michael R. Caputo

A grammar logic refers to an extension to the multi-modal logic K in which the modal axioms are generated from a formal grammar. We consider a proof theory, in nested sequent calculus, of grammar logics with converse, i.e., every modal…

Logic in Computer Science · Computer Science 2012-04-12 Alwen Tiu , Egor Ianovski , Rajeev Gore

As gradual typing becomes increasingly popular in languages like Python and TypeScript, there is a growing need to infer type annotations automatically. While type annotations help with tasks like code completion and static error catching,…

Programming Languages · Computer Science 2020-05-06 Jiayi Wei , Maruth Goyal , Greg Durrett , Isil Dillig

It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…

Logic in Computer Science · Computer Science 2023-09-28 Jonathan Sterling

We present a new strictification method for type-theoretic structures that are only weakly stable under substitution. Given weakly stable structures over some model of type theory, we construct equivalent strictly stable structures by…

Logic in Computer Science · Computer Science 2022-11-28 Rafaël Bocquet

Nested relations, built up from atomic types via product and set types, form a rich data model. Over the last decades the nested relational calculus, NRC, has emerged as a standard language for defining transformations on nested…

Logic in Computer Science · Computer Science 2023-03-24 Michael Benedikt , Cécilia Pradic

We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…

Computer Science and Game Theory · Computer Science 2017-01-11 Ulrich Berger

In the usual Bayesian setting, a full probabilistic model is required to link the data and parameters, and the form of this model and the inference and prediction mechanisms are specified via de Finetti's representation. In general, such a…

Methodology · Statistics 2026-01-21 Yu Luo , David A. Stephens , Daniel J. Graham , Emma J. McCoy

We characterize those intersection-type theories which yield complete intersection-type assignment systems for lambda-calculi, with respect to the three canonical set-theoretical semantics for intersection-types: the inference semantics,…

Logic in Computer Science · Computer Science 2007-05-23 M. Dezani-Ciancaglini , F. Honsell , F. Alessi

Modelling semantic similarity plays a fundamental role in lexical semantic applications. A natural way of calculating semantic similarity is to access handcrafted semantic networks, but similarity prediction can also be anticipated in a…

Computation and Language · Computer Science 2022-10-03 Dongqiang Yang , Yanqin Yin

Despite recent advances in representation learning in hypercomplex (HC) space, this subject is still vastly unexplored in the context of graphs. Motivated by the complex and quaternion algebras, which have been found in several contexts to…

Machine Learning · Computer Science 2022-02-22 Tuan Le , Marco Bertolini , Frank Noé , Djork-Arné Clevert

In this paper, we extend the classical arithmetic defined over the set of natural numbers N, to the set of all finite directed connected multigraphs having a pair of distinct distinguished vertices. Specifically, we introduce a model F on…

Combinatorics · Mathematics 2009-09-29 Bilal Khan , Kiran R. Bhutani , Delaram Kahrobaei

Languages may encode similar meanings using different sentence structures. This makes it a challenge to provide a single set of formal rules that can derive meanings from sentences in many languages at once. To overcome the challenge, we…

Computation and Language · Computer Science 2024-03-05 Laurestine Bradford , Timothy John O'Donnell , Siva Reddy

We present an extension of the second-order logic AF2 with iso-style inductive and coinductive definitions specifically designed to extract programs from proofs a la Krivine-Parigot by means of primitive (co)recursion principles. Our logic…

Logic in Computer Science · Computer Science 2012-03-29 Favio Ezequiel Miranda-Perea , Lourdes del Carmen González-Huesca

In this paper, we are revisiting pattern mining and especially itemset mining, which allows one to analyze binary datasets in searching for interesting and meaningful association rules and respective itemsets in an unsupervised way. While a…

Databases · Computer Science 2021-03-31 Tatiana Makhalova , Aleksey Buzmakov , Sergei O. Kuznetsov , Amedeo Napoli

[PhD thesis of FCP.] Nowadays, genetics studies large amounts of very diverse variables. Mathematical statistics has evolved in parallel to its applications, with much recent interest high-dimensional settings. In the genetics of human…

Methodology · Statistics 2024-07-30 Fernando Castro-Prado

This paper provides a nonparametric analysis for several classes of models, with cases such as classical measurement error, regression with errors in variables, factor models and other models that may be represented in a form involving…

Methodology · Statistics 2012-09-10 Victoria Zinde-Walsh

As originally proposed, type classes provide overloading and ad-hoc definition, but can still be understood (and implemented) in terms of strictly parametric calculi. This is not true of subsequent extensions of type classes. Functional…

Programming Languages · Computer Science 2016-12-28 J. Garrett Morris

We show that contrary to appearances, Multimodal Type Theory (MTT) over a 2-category M can be interpreted in any M-shaped diagram of categories having, and functors preserving, M-sized limits, without the need for extra left adjoints. This…

Category Theory · Mathematics 2024-02-14 Michael Shulman