当前期刊: Mathematical Structures in Computer Science Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Indexed type theories
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-05-22
    Valery Isaev

    In this paper, we define indexed type theories which are related to indexed (∞-)categories in the same way as (homotopy) type theories are related to (∞-)categories. We define several standard constructions for such theories including finite (co)limits, arbitrary (co)products, exponents, object classifiers, and orthogonal factorization systems. We also prove that these constructions are equivalent

    更新日期:2020-05-22
  • Rewriting with generalized nominal unification
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-05-22
    Yunus Kutz; Manfred Schmidt-Schauß

    We consider matching, rewriting, critical pairs and the Knuth–Bendix confluence test on rewrite rules in a nominal setting extended by atom-variables. We utilize atom-variables instead of atoms to formulate and rewrite rules on constrained expressions, which is an improvement of expressiveness over previous approaches. Nominal unification and nominal matching are correspondingly extended. Rewriting

    更新日期:2020-05-22
  • Higher-order pattern generalization modulo equational theories
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-05-20
    David M. Cerna; Temur Kutsia

    We consider anti-unification for simply typed lambda terms in theories defined by associativity, commutativity, identity (unit element) axioms and their combinations and develop a sound and complete algorithm which takes two lambda terms and computes their equational generalizations in the form of higher-order patterns. The problem is finitary: the minimal complete set of such generalizations contains

    更新日期:2020-05-20
  • Denotational semantics for guarded dependent type theory
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-05-08
    Aleš Bizjak; Rasmus Ejlers Møgelberg

    We present a new model of guarded dependent type theory (GDTT), a type theory with guarded recursion and multiple clocks in which one can program with and reason about coinductive types. Productivity of recursively defined coinductive programs and proofs is encoded in types using guarded recursion and can therefore be checked modularly, unlike the syntactic checks implemented in modern proof assistants

    更新日期:2020-05-08
  • Open Petri nets
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-04-07
    John C. Baez; Jade Master

    The reachability semantics for Petri nets can be studied using open Petri nets. For us, an “open” Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the outputs of one to the inputs of another. Open Petri nets can be treated as morphisms of a category Open(Petri), which becomes symmetric monoidal under disjoint union

    更新日期:2020-04-07
  • SMT-based verification of data-aware processes: a model-theoretic approach
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-04-03
    Diego Calvanese; Silvio Ghilardi; Alessandro Gianola; Marco Montali; Andrey Rivkin

    In recent times, satisfiability modulo theories (SMT) techniques gained increasing attention and obtained remarkable success in model-checking infinite-state systems. Still, we believe that whenever more expressivity is needed in order to specify the systems to be verified, more and more support is needed from mathematical logic and model theory. This is the case of the applications considered in this

    更新日期:2020-04-03
  • Witness algebra and anyon braiding
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-03-16
    Andreas Blass; Yuri Gurevich

    Topological quantum computation employs two-dimensional quasiparticles called anyons. The generally accepted mathematical basis for the theory of anyons is the framework of modular tensor categories. That framework involves a substantial amount of category theory and is, as a result, considered rather difficult to understand. Is the complexity of the present framework necessary? The computations of

    更新日期:2020-03-16
  • Computing knowledge in equational extensions of subterm convergent theories
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-03-02
    Serdar Erbatur; Andrew M. Marshall; Christophe Ringeissen

    We study decision procedures for two knowledge problems critical to the verification of security protocols, namely the intruder deduction and the static equivalence problems. These problems can be related to particular forms of context matching and context unification. Both problems are defined with respect to an equational theory and are known to be decidable when the equational theory is given by

    更新日期:2020-03-02
  • Free Heyting algebra endomorphisms: Ruitenburg’s Theorem and beyond
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2020-01-21
    Silvio Ghilardi; Luigi Santocanale

    Ruitenburg’s Theorem says that every endomorphism f of a finitely generated free Heyting algebra is ultimately periodic if f fixes all the generators but one. More precisely, there is N ≥ 0 such that fN+2 = fN, thus the period equals 2. We give a semantic proof of this theorem, using duality techniques and bounded bisimulation ranks. By the same techniques, we tackle investigation of arbitrary endomorphisms

    更新日期:2020-01-21
  • Homotopy type-theoretic interpretations of constructive set theories
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2019-11-29
    Cesare Gallozzi

    We introduce a family of (k, h)-interpretations for 2 ≤ k ≤ ∞ and 1 ≤ h ≤ ∞ of constructive set theory into type theory, in which sets and formulas are interpreted as types of homotopy level k and h, respectively. Depending on the values of the parameters k and h, we are able to interpret different theories, like Aczel’s CZF and Myhill’s CST. We also define a proposition-as-hproposition interpretation

    更新日期:2019-11-29
  • Extensions of unificationmodulo ACUI
    Math. Struct. Comput. Sci. (IF 0.592) Pub Date : 2019-11-11
    Franz Baader; Pavlos Marantidis; Antoine Mottet; Alexander Okhotin

    The theory ACUI of an associative, commutative, and idempotent binary function symbol + with unit 0 was one of the first equational theories for which the complexity of testing solvability of unification problems was investigated in detail. In this paper, we investigate two extensions of ACUI. On one hand, we consider approximate ACUI-unification, where we use appropriate measures to express how close

    更新日期:2019-11-11
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
如何通过Nature平台传播科研成果
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
中洪博元
ACS材料视界
x-mol收录
南开大学
朱守非
廖良生
南方科技大学
西湖大学
伊利诺伊大学香槟分校
徐明华
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug