How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and All That / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traced Premonoidal Categories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational types from a logical perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associated type synonyms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associated types with class / rank
 
Normal rank
Property / cites work
 
Property / cites work: All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical foundations of CafeOBJ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-Order Equational Logic (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-Order Algebraic Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algebra of Directed Acyclic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully abstract model for the \(\pi\)-calculus. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Just do it / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming Languages and Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantic Labelling for Proving Termination of Combinatory Reduction Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic Abstract Syntax via Grothendieck Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Normalising Cyclic Data Computation by Iteration Categories of Second-Order Algebraic Theories. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic rewrite rules: confluence, type inference, and instance validation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical linear logic of implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On MacLane's conditions for coherence of natural associativities, commutativities, etc / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5581665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions-as-constructors Higher-order Unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensional Rewriting with Sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed Lambda Calculi and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5655527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-order rewrite systems and their confluence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Tomorrow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of computation and monads / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Terminating and Confluent Linear Lambda Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reflection on call-by-value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free-algebra models for the \(\pi \)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algebraic Presentation of Predicate Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instances of Computational Effects: An Algebraic Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Effects, Linearity, and Quantum Programming Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comprehending monads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Based Program Synthesis and Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic second-order patterns / rank
 
Normal rank

Revision as of 18:48, 22 July 2024

scientific article; zbMATH DE number 7203387
Language Label Description Also known as
English
How to prove decidability of equational theories with second-order computation analyser SOL
scientific article; zbMATH DE number 7203387

    Statements

    How to prove decidability of equational theories with second-order computation analyser SOL (English)
    0 references
    0 references
    26 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references