English
Related papers

Related papers: I-Types of System F

200 papers

We prove that a Hausdorff space $X$ is very $\mathrm I$-favorable if and only if $X$ is the almost limit space of a $\sigma$-complete inverse system consisting of (not necessarily Hausdorff) second countable spaces and surjective d-open…

General Topology · Mathematics 2010-11-17 A. Kucharski , Sz. Plewik , V. Valov

System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…

Logic in Computer Science · Computer Science 2023-09-19 Alejandro Díaz-Caro , Gilles Dowek

Let A be an nxn (entrywise) positive matrix and let f(t)=det(I-t A). We prove that there always exists a positive integer N such that 1-f(t)^{1/N} has positive coefficients.

Spectral Theory · Mathematics 2013-07-18 Thomas J. Laffey , Raphael Loewy , Helena Šmigoc

System I is a recently introduced simply-typed lambda calculus with pairs where isomorphic types are considered equal. In this work we propose a variant of System I with the type Top, and present a complete formalization of this calculus in…

Logic in Computer Science · Computer Science 2026-03-26 Agustín Séttimo , Cristian Sottile , Cecilia Manzino

Let $\G$ be a unimodular type I second countable locally compact group and $\wG$ its unitary dual. Motivated by a recent pseudo-differential calculus, we develop a positive Berezin-type quantization with operator-valued symbols defined on…

Representation Theory · Mathematics 2015-12-07 Marius Mantoiu

We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.

Logic · Mathematics 2020-03-12 Lars Kristiansen , Juvenal Murwanashyaka

An infinite iterated function system (IIFS) is a countable collection of contraction maps on a compact metric space. In this paper we study the conditions under which the attractor of a such system admits a parameterization by a continuous…

Metric Geometry · Mathematics 2024-04-09 Eve Shaw , Vyron Vellis

Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable stratification of the type and effect system entails the…

Logic in Computer Science · Computer Science 2010-07-01 Roberto Amadio

We give an approach to open quantum systems based on formal deformation quantization. It is shown that classical open systems of a certain type can be systematically quantized into quantum open systems preserving the complete positivity of…

Mathematical Physics · Physics 2015-05-13 Florian Becher , Nikolai Neumaier , Stefan Waldmann

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

Logic in Computer Science · Computer Science 2018-01-23 David McAllester

In this paper, we extend the system AF2 in order to have the subject reduction for the $\beta\eta$-reduction. We prove that the types with positive quantifiers are complete for models that are stable by weak-head expansion.

Logic · Mathematics 2009-05-05 Samir Farkh , Karim Nour

A fragment of second-order lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be non-interleaved and stratified, i.e., the types are assigned levels, and a…

Logic in Computer Science · Computer Science 2007-05-23 Klaus Aehlig , Jan Johannsen

We study a type checking algorithm that is able to type check a nontrivial subclass of functional programs that use features such as higher-rank, impredicative and second-order types. The only place the algorithm requires type annotation is…

Logic in Computer Science · Computer Science 2017-11-15 Peng Fu

We present an extension of System F with call-by-name exceptions. The type system is enriched with two syntactic constructs: a union type for programs whose execution may raise an exception at top level, and a corruption type for programs…

Programming Languages · Computer Science 2015-07-01 Sylvain Lebresne

We present the design, implementation, and foundation of a verifier for higher-order functional programs with generics and recursive data types. Our system supports proving safety and termination using preconditions, postconditions and…

Logic in Computer Science · Computer Science 2020-03-25 Jad Hamza , Nicolas Voirol , Viktor Kunčak

Quantifier-elimination or model-completeness of the affine part of some classical first order theories are proved.

Logic · Mathematics 2025-09-10 Seyed-Mohammad Bagheri

Complementing and extending the Inventiones work of Benson, Grodal, Henke [Group cohomology and control of p-fusion, Invent. Math. 197 (2014), 491--507] we give criteria for a space to have cohomology (strongly) F-isomorphic in the sense of…

Algebraic Topology · Mathematics 2019-01-18 Nora Seeliger

In this paper, we prove that singularities of $F$-injective type are Du Bois. This extends the correspondence between singularities associated to the minimal model program and singularities defined by the action of Frobenius in positive…

Algebraic Geometry · Mathematics 2009-04-28 Karl Schwede

Let $G$ be some generalized $\pi$-soluble groups and ${\cal F}$ be a Fitting set of $G$. In this paper, we prove the existence and conjugacy of ${\cal F}$-injectors of $G$, and give a description of the structure of the injectors.

Group Theory · Mathematics 2017-02-14 Nanying Yang , Wenbin Guo , N. T. Vorobev

This paper introduces an expressive class of quotient-inductive types, called QW-types. We show that in dependent type theory with uniqueness of identity proofs, even the infinitary case of QW-types can be encoded using the combination of…

Logic in Computer Science · Computer Science 2022-03-15 Marcelo Fiore , Andrew M. Pitts , S. C. Steenkamp