English
Related papers

Related papers: Nominal Coalgebraic Data Types with Applications t…

200 papers

We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the part of the language emulating linear operators and vectors, i.e. it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2012-08-01 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron

We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…

Logic in Computer Science · Computer Science 2023-12-21 Delia Kesner , Shane Ó Conchúir

We propose three kinds of explicit formulas for the elliptic lambda function by the elliptic modular function. Further, we derive incredible cubic identities as a corollary of our explicit formulas and evaluate some singular values of the…

Number Theory · Mathematics 2020-07-03 Genki Shibukawa

In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…

Rings and Algebras · Mathematics 2020-01-03 H. Ahmed , U. Bekbaev , I. Rakhimov

The purpose of these notes is to collect in one place some facts on the category of finite totally ordered sets and some related categories. More specifically, we collect some results on them which will be useful for the study of iteratedly…

Category Theory · Mathematics 2025-12-29 Takuo Matsuoka

In this paper, we consider graded associative conformal algebras. The class of these objects includes pseudo-algebras over non-cocommutative Hopf algebras of regular functions on some linear algebraic groups. In particular, an associative…

Quantum Algebra · Mathematics 2015-09-17 Pavel Kolesnikov

Developing and maintaining software commonly requires (1) adding new data type constructors to existing applications, but also (2) adding new functions that work on existing data. Most programming languages have native support for defining…

Programming Languages · Computer Science 2023-09-27 Cas van der Rest , Casper Bach Poulsen

A characterization of the maximal abelian sub-algebras of matrix algebras that are normalized by the canonical representation of a finite Heisenberg group is given. Examples are constructed using a classification result for finite…

Representation Theory · Mathematics 2010-02-19 Amritanshu Prasad , M. K. Vemuri

The lambda calculus with constructors is an extension of the lambda calculus with variadic constructors. It decomposes the pattern-matching a la ML into a case analysis on constants and a commutation rule between case and application…

Logic in Computer Science · Computer Science 2012-03-06 Barbara Petit

We introduce a new representation of non-idempotent intersection types, using \textbf{sequences} (families indexed with natural numbers) instead of lists or multisets. This allows scaling up \textbf{intersection type} theory to the…

Logic in Computer Science · Computer Science 2021-12-16 Pierre Vial

In this paper we determine the representation type of some algebras of infinite matrices continuously controlled at infinity by a compact metrizable space. We explicitly classify their finitely presented modules in the finite and tame…

Representation Theory · Mathematics 2007-05-23 Fernando Muro

The aim of this paper is to show that even if the natural algebraic semantic for modal (normal) logic is modal algebra, the more general class of subordination algebras (roughly speaking, the non symmetric contact algebras) is adequate too…

Logic · Mathematics 2020-06-17 Laurent De Rudder , Georges Hansoul , Valentine Stetenfeld

Finding a denotational semantics for higher order quantum computation is a long-standing problem in the semantics of quantum programming languages. Most past approaches to this problem fell short in one way or another, either limiting the…

Logic in Computer Science · Computer Science 2013-11-12 Michele Pagani , Peter Selinger , Benoît Valiron

We introduce a nabla, a delta, and a symmetric fractional calculus on arbitrary nonempty closed subsets of the real numbers. These fractional calculi provide a study of differentiation and integration of noninteger order on discrete,…

Classical Analysis and ODEs · Mathematics 2015-12-31 Nadia Benkhettou , Artur M. C. Brito da Cruz , Delfim F. M. Torres

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…

Logic · Mathematics 2007-05-23 Benno van den Berg , Federico De Marchi

We construct a diffeomorphism invariant (Colombeau-type) differential algebra canonically containing the space of distributions in the sense of L. Schwartz. Employing differential calculus in infinite dimensional (convenient) vector spaces,…

Functional Analysis · Mathematics 2007-05-23 Eva Farkas , Michael Grosser , Michael Kunzinger , Roland Steinbauer

We present techniques that allow to decide that the dimension of some pointed Hopf algebras associated with non-abelian groups is infinite. These results are consequences of arXiv:0803.2430v1. We illustrate each technique with applications.

Quantum Algebra · Mathematics 2010-06-29 N. Andruskiewitsch , F. Fantino

We use high girth, high chromatic number hypergraphs to show that there are finite models of the equational theory of the semiring of nonnegative integers whose equational theory has no finite axiomatisation, and show this also holds if…

Logic · Mathematics 2026-02-12 Tumadhir Alsulami , Marcel Jackson

An algebra $L$ over a field $\Bbb F$, in which product is denoted by $[\,,\,]$, is said to be \textit{ Lie type algebra} if for all elements $a,b,c\in L$ there exist $\alpha, \beta\in \Bbb F$ such that $\alpha\neq 0$ and $[[a,b],c]=\alpha…

Rings and Algebras · Mathematics 2014-11-04 N. Yu. Makarenko

Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi involving named bound variables (as opposed to de-Bruijn indices). In…

Logic in Computer Science · Computer Science 2015-07-01 Christian Urban , Cezary Kaliszyk