Theory and practice of second-order rewriting: foundation, evolution, and SOL

DOI10.1007/978-3-030-59025-3_1OpenAlexW3085882190MaRDI QIDQ2039930

Makoto Hamana

Publication date: 6 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-59025-3_1

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
• Deterministic second-order patterns
• Polymorphic rewrite rules: confluence, type inference, and instance validation
• Initial Algebra Semantics for Cyclic Sharing Tree Structures
• Algebraic Effects, Linearity, and Quantum Programming Languages
• Polymorphic Abstract Syntax via Grothendieck Construction
• Semantic Labelling for Proving Termination of Combinatory Reduction Systems
• Second-Order Equational Logic (Extended Abstract)
• Second-Order Algebraic Theories
• Substitution, jumps, and algebraic effects
• An Algebraic Presentation of Predicate Logic
• How to prove decidability of equational theories with second-order computation analyser SOL
• Algebraic models of simple type theories
• Instances of Computational Effects: An Algebraic Perspective
• Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
• Programming Languages and Systems
• Term Rewriting and Applications

This page was built for publication: Theory and practice of second-order rewriting: foundation, evolution, and SOL