20 results for “Knowledge of sequent calculus”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
A novel intersection type system for a λ-calculus with algebraic effects and handlers is introduced.
A novel calculus is introduced that models first-class environments and function application using standard record types.
This paper studies the use of logical principles to design well-behaved term syntaxes for sequent calculus in effectful computation.
This paper proves several properties about Extended Frege proof systems and circuit equivalence.
This paper presents the theory of Eigenius, a store of typed knowledge over constructive institutions.
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.
This paper studies modalities in the linear lambda calculus using endofunctors in monoidal closed categories.
This paper resolves the expressiveness conundrum between Iris and Indirection Theory by showing that Indirection Theory can be as expressive as Iris.
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…
One clear sentence describing what this paper does
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.
This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.
The paper shows that the λ-calculus can be made to automatically perform dynamic programming without the need for memoization or recursion constructs.
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…
This paper develops distributive laws for parallel composition in a rely/guarantee style theory for reasoning about concurrent programs.
This paper constructs and proves the adequacy of powerdomains in synthetic domain theory for nondeterministic denotational models.
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.