English
Related papers

Related papers: Cyclic Shift in the Lambek Calculus

200 papers

As well-known, the concept "hypercyclic" in operator theory is the same as the concept "transitive" in dynamical system. Now the class of hypercyclic operators is well studied. Following the idea of research in hypercyclic operators, we…

Functional Analysis · Mathematics 2009-05-29 Geng Tian , Luoyi Shi , Sen Zhu , Bingzhe Hou

We present a comprehensive study of the behavioral theory of an untyped $\lambda$-calculus extended with the delimited-control operators shift and reset. To that end, we define a contextual equivalence for this calculus, that we then aim to…

Logic in Computer Science · Computer Science 2023-06-22 Dariusz Biernacki , Sergueï Lenglet , Piotr Polesiuk

As a supplement to my talk at the workshop, this extended abstract motivates and summarizes my work with co-authors on problems in two separate areas: first, in the lambda-calculus with letrec, a universal model of computation, and second,…

Logic in Computer Science · Computer Science 2024-10-02 Clemens Grabmayer

A well-known approach to treating syntactic island constraints in the setting of Lambek grammars consists in adding specific bracket modalities to the logic. We adapt this approach to abstract categorial grammars (ACG). Thus we define…

Logic · Mathematics 2020-05-21 Sergey Slavnov

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

Calculi with control operators have been studied to reason about control in programming languages and to interpret the computational content of classical proofs. To make these calculi into a real programming language, one should also…

Logic in Computer Science · Computer Science 2012-10-12 Robbert Krebbers

In this paper, we study logics of bounded distributive residuated lattices with modal operators considering $\Box$ and $\Diamond$ in a noncommutative setting. We introduce relational semantics for such substructural modal logics. We prove…

Logic · Mathematics 2020-06-02 Daniel Rogozin

We consider cyclic $m$-isometries on a complex separable Hilbert space. Such operators are characterized in terms of shifts on abstract spaces of weighted Dirichlet type. Our results resemble those of Agler and Stankus, but our model spaces…

Functional Analysis · Mathematics 2018-12-05 Eskil Rydhe

We describe some connections between three different fields: combinatorics (umbral calculus), functional analysis (linear functionals and operators) and harmonic analysis (convolutions on group-like structures). Systematic usage of…

funct-an · Mathematics 2008-02-03 Vladimir V. Kisil

In this paper a novel calculus system has been established based on the concept of 'werden'. The basis of logic self-contraction of the theories on current calculus was shown. Mistakes and defects in the structure and meaning of the…

General Mathematics · Mathematics 2012-01-13 Xiaoping Ding

Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit…

Logic in Computer Science · Computer Science 2018-10-18 Gabriel Ebner

Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the…

Programming Languages · Computer Science 2010-12-23 Conrad Rau , Manfred Schmidt-Schauß

We present a syntactic cut-elimination procedure for the alternation-free fragment of the modal mu-calculus. Cut reduction is carried out within a cyclic proof system, where proofs are finitely branching but may be non-wellfounded. The…

Logic in Computer Science · Computer Science 2025-10-14 Bahareh Afshari , Johannes Kloibhofer

Bilingual machine-readable dictionaries are knowledge resources useful in many automatic tasks. However, compared to monolingual computational lexicons like WordNet, bilingual dictionaries typically provide a lower amount of structured…

Computation and Language · Computer Science 2014-02-12 Tiziano Flati , Roberto Navigli

A new family of categorial grammars is proposed, defined by enriching basic categorial grammars with a conjunction operation. It is proved that the formalism obtained in this way has the same expressive power as conjunctive grammars, that…

Logic in Computer Science · Computer Science 2024-05-28 Stepan L. Kuznetsov , Alexander Okhotin

The left-corner transformation (Rosenkrantz and Lewis, 1970) is used to remove left recursion from context-free grammars, which is an important step towards making the grammar parsable top-down with simple techniques. This paper generalizes…

Computation and Language · Computer Science 2023-11-29 Andreas Opedal , Eleftheria Tsipidi , Tiago Pimentel , Ryan Cotterell , Tim Vieira

We establish results about algebraic shifting of simplicial complexes and use them to compare different shifting operations. In particular, we show that each shifting operation does not decrease the number of facets, and that the exterior…

Commutative Algebra · Mathematics 2007-05-23 Uwe Nagel , Tim Roemer , Natale Paolo Vinai

This work identifies a class of moves on knots which translate to $m$-equivalences of the associated $p$-fold branched cyclic covers, for a fixed $m$ and any $p$ (with respect to the Goussarov-Habiro filtration.) These moves are applied to…

Geometric Topology · Mathematics 2007-05-23 Andrew Kricker

In this paper, we study the linear dynamical properties of shift operators on some classes of Segal algebras. Moreover, we characterize hypercyclic generalized bilateral shift operators on the standard Hilbert module.

Functional Analysis · Mathematics 2023-06-22 Stefan Ivkovic , Seyyed Mohammad Tabatabaie

Because the stochastic calculus yields rarely random variables with laws defined by explicit closed formulas, probabilistic numerical computations are done most often by simulation. The simulation by the shift, whose field of application is…

Probability · Mathematics 2007-05-23 Nicolas Bouleau
‹ Prev 1 3 4 5 6 7 10 Next ›