scientific article; zbMATH DE number 7559278

DOI10.4230/LIPIcs.FSCD.2019.12MaRDI QIDQ5089012

Łukasz Czajka, Cynthia Kop

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1904.09859

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polymorphismterminationhigher-order rewritingpermutative conversions

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A syntactic embedding of predicate logic into second-order propositional logic
• Lectures on the Curry-Howard isomorphism
• Polymorphic rewrite rules: confluence, type inference, and instance validation
• Dynamic Dependency Pairs for Algebraic Functional Systems
• Introduction to Bisimulation and Coinduction
• Polymorphic higher-order recursive path orderings
• Short Proofs of Strong Normalization
• Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
• Simple Saturated Sets for Disjunction and Second-Order Existential Quantification
• Termination of rewriting in the Calculus of Constructions
• Definitions by rewriting in the Calculus of Constructions
• Polynomial Interpretations for Higher-Order Rewriting
• Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
• Practical coinduction
• An introduction to (co)algebra and (co)induction

This page was built for publication: