English
Related papers

Related papers: Bootstrapping Inductive and Coinductive Types in H…

200 papers

This paper studies emulation of induction by coinduction in a call-by-name language with control operators. Since it is known that call-by-name programming languages with control operators cannot have general initial algebras, interaction…

Logic in Computer Science · Computer Science 2013-09-06 Yoshihiko Kakutani , Daisuke Kimura

Higher inductive types are inductive types that include nontrivial higher-dimensional structure, represented as identifications that are not reflexivity. While work proceeds on type theories with a computational interpretation of univalence…

Programming Languages · Computer Science 2018-08-28 Paventhan Vivekanandan

Generative retrieval uses differentiable search indexes to directly generate relevant document identifiers in response to a query. Recent studies have highlighted the potential of a strong generative retrieval model, trained with carefully…

Information Retrieval · Computer Science 2024-07-17 Yubao Tang , Ruqing Zhang , Jiafeng Guo , Maarten de Rijke , Yixing Fan , Xueqi Cheng

This review article highlights state-of-the-art data-driven techniques to discover, encode, surrogate, or emulate constitutive laws that describe the path-independent and path-dependent response of solids. Our objective is to provide an…

Computational Engineering, Finance, and Science · Computer Science 2024-05-07 Jan Niklas Fuhg , Govinda Anantha Padmanabha , Nikolaos Bouklas , Bahador Bahmani , WaiChing Sun , Nikolaos N. Vlassis , Moritz Flaschel , Pietro Carrara , Laura De Lorenzis

Coinduction occurs in two guises in Horn clause logic: in proofs of self-referencing properties and relations, and in proofs involving construction of (possibly irregular) infinite data. Both instances of coinductive reasoning appeared in…

Logic in Computer Science · Computer Science 2018-09-14 Ekaterina Komendantskaya Dr , Yue Li

We study the category pro-SSet of pro-simplicial sets, which arises in etale homotopy theory, shape theory, and pro-finite completion. We establish a model structure on pro-SSet so that it is possible to do homotopy theory in this category.…

Algebraic Topology · Mathematics 2007-05-23 Daniel C. Isaksen

Deep data types are those that are constructed from other data types, including, possibly, themselves. In this case, they are said to be truly nested. Deep induction is an extension of structural induction that traverses all of the…

Logic in Computer Science · Computer Science 2021-12-08 Patricia Johann , Enrico Ghiorzi

We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…

Logic in Computer Science · Computer Science 2018-04-24 Ştefan Ciobâcă , Dorel Lucanu

We propose a route toward realizing fractionalized topological phases of matter (i.e. with intrinsic topological order) by literally building on un-fractionalized phases. Our approach employs a Kondo lattice model in which a gapped…

Strongly Correlated Electrons · Physics 2017-10-20 Timothy H. Hsieh , Yuan-Ming Lu , Andreas W. W. Ludwig

In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…

Category Theory · Mathematics 2023-06-22 Valery Isaev

Statistical multispecies models of multiarea marine ecosystems use a variety of data sources to estimate parameters using composite or weighted likelihood functions with associated weighting issues and questions on how to obtain variance…

Applications · Statistics 2012-02-16 Lorna Taylor , Verena M. Trenkel , Vojtech Kupca , Gunnar Stefansson

Homotopy type theory is a new branch of mathematics, based on a recently discovered connection between homotopy theory and type theory, which brings new ideas into the very foundation of mathematics. On the one hand, Voevodsky's subtle and…

Logic · Mathematics 2013-08-06 The Univalent Foundations Program

This paper analyses the use of bootstrap methods to test for parameter change in linear models estimated via Two Stage Least Squares (2SLS). Two types of test are considered: one where the null hypothesis is of no change and the alternative…

Econometrics · Economics 2020-02-03 Otilia Boldea , Adriana Cornea-Madeira , Alastair R. Hall

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

This thesis introduces a new unsupervised learning framework, called Alignment-Based Learning, which is based on the alignment of sentences and Harris's (1951) notion of substitutability. Instances of the framework can be applied to an…

Machine Learning · Computer Science 2007-05-23 Menno M. van Zaanen

A well-known problem in the theory of dependent types is how to handle so-called nested data types. These data types are difficult to program and to reason about in total dependently typed languages such as Agda and Coq. In particular, it…

Logic in Computer Science · Computer Science 2023-06-21 Peng Fu , Peter Selinger

We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…

Algebraic Topology · Mathematics 2024-11-27 Jonas Stelzig

The form-factor bootstrap approach is applied to the perturbed minimal models $M_{2,2n+3}$ in the direction of the primary field $\phi_{1,3}$. These theories are integrable and contain $n$ massive scalar particles, whose $S$--matrix is…

High Energy Physics - Theory · Physics 2009-10-28 A. Koubek

We propose a range of deep lexical acquisition methods which make use of morphological, syntactic and ontological language resources to model word similarity and bootstrap from a seed lexicon. The different methods are deployed in learning…

Computation and Language · Computer Science 2007-09-18 Timothy Baldwin

We present the first definition of strictly associative and unital $\infty$-category. Our proposal takes the form of a type theory whose terms describe the operations of such structures, and whose definitional equality relation enforces…

Category Theory · Mathematics 2024-07-08 Eric Finster , Alex Rice , Jamie Vicary