ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Knowledge of sequent calculus”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LOcs.PLTheoreticalRecentJun 8, 2026

When Types Intersect and Effects Get Handled

Ugo Dal Lago, Taro Sekiyama, Stefano Catozi

A novel intersection type system for a λ-calculus with algebraic effects and handlers is introduced.

View →
cs.PLTheoreticalRecentOct 20, 2026

Record Types Everywhere

Matthew Toohey, Ara Jamalzadeh, Ningning Xie

A novel calculus is introduced that models first-class environments and function application using standard record types.

View →
cs.LOcs.PLTheoreticalRecentJun 12, 2026

Syntax and semantics of focalisation with relative monads and comonads

Éléonore Mangel, Paul-André Melliès, Guillaume Munch-Maccagnoni

This paper studies the use of logical principles to design well-behaved term syntaxes for sequent calculus in effectful computation.

View →
math.LOcs.CCTheoreticalRecentJun 11, 2026

Extended Frege proofs, circuits and rewriting

Jan Krajicek

This paper proves several properties about Extended Frege proof systems and circuit equivalence.

View →
cs.LOcs.AIcs.DBTheoreticalRecentNov 5, 2026

Typed Knowledge over Constructive Institutions

Hans-Martin Will

This paper presents the theory of Eigenius, a store of typed knowledge over constructive institutions.

View →
cs.LOcs.PLTheoreticalRecentJul 22, 2026

Linearising Explicit Substitutions using Intersection Types

Ana Jorge Almeida, Sandra Alves, Mário Florido

The paper introduces a new term expansion for a calculus with explicit substitutions, allowing the relation of a lambda-calculus with explicit substitutions to Boudol's resource aware lambda-calculus.

View →
cs.PLTheoreticalRecentOct 16, 2026

Arbitrary Functors as Modalities in a Linear Calculus

Jean-Philippe Bernardy, Andreas Abel

This paper studies modalities in the linear lambda calculus using endofunctors in monoidal closed categories.

View →
cs.PLTheoreticalRecentOct 30, 2026

Iris on Indirection Theory: Lightweight Higher-order Ghost State

Darius Foo, Viet-Anh Nguyen, Wei-Ngan Chin

This paper resolves the expressiveness conundrum between Iris and Indirection Theory by showing that Indirection Theory can be as expressive as Iris.

View →
cs.LOcs.CCRecentMay 29, 2026

Aspects of Coherence in Dependence Logic

Timon Barlag, Nicolas Fröhlich, Miika Hannula, Phokion G. Kolaitis +3 more

The paper establishes that for quantifier-free dependence logic formulas, the property of k-coherence is equivalent to first-order rewritability, and analyzes the computational complexity of checking…

View →
cs.LOcs.CCmath.LOEmpiricalRecentJun 9, 2026

Quantified propositional calculi and narrow implicit proofs

Pavel Pudlák, Neil Thapen

One clear sentence describing what this paper does

View →
cs.LOcs.PLEmpiricalRecentJun 23, 2026

Verifiable Auto-Formalization of Mathematics Using a Relaxed Natural Formal Language

Zhicheng Hui, Lihan Xie, Xingzhi Qi, Zhehao Li +2 more

The paper introduces Relaxed Natural Formal Language (Relaxed NFL) as an intermediate target for auto-formalization to bridge the gap between informal mathematical writing and formal proof languages.

View →
cs.PLTheoreticalRecentJun 19, 2026

Correct and Complete Symbolic Execution for Free

Erik Voogd, Einar Broch Johnsen, Åsmund Aqissiaq Arild Kløvstad, Jurriaan Rot +1 more

This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.

View →
cs.PLcs.LOTheoreticalRecentJun 22, 2026

Cyclic Graphs and Memoization in Pure $λ$-Calculus

Bo Yang

The paper shows that the λ-calculus can be made to automatically perform dynamic programming without the need for memoization or recursion constructs.

View →
cs.PLcs.CCcs.DBRecentJun 1, 2026

From Time to Space: The Impact of Linearity in Higher-Order Datalog

Angelos Charalambidis, Babis Kostopoulos, Panos Rondogiannis

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

View →
cs.PLcs.LOTheoreticalRecentJul 20, 2026

Distributive Laws for Parallel Composition in Rely-Guarantee Concurrency

Ian J. Hayes, Larissa A. Meinicke

This paper develops distributive laws for parallel composition in a rely/guarantee style theory for reasoning about concurrent programs.

View →
cs.PLTheoreticalRecentJun 20, 2026

Powerdomains and nondeterminism in synthetic domain theory

Yue Niu, Taro Sekiyama

This paper constructs and proves the adequacy of powerdomains in synthetic domain theory for nondeterministic denotational models.

View →
cs.PLcs.LOTheoreticalRecentJul 20, 2026

The Because-Calculus: Separating Production, Existence, and Interpretation in Computation

Oscar Perez Mora

This paper introduces the because-calculus, a calculus that structurally separates registration and attestation using dual effect rows and level-indexed typing, and proves the Conflation Theorem.

View →