Polymorphic higher-order termination
From MaRDI portal
Publication:5089012
DOI10.4230/LIPICS.FSCD.2019.12MaRDI QIDQ5089012FDOQ5089012
Authors: Łukasz Czajka, Cynthia Kop 
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1904.09859
Recommendations
Cites Work
- Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
- Title not available (Why is that?)
- Lectures on the Curry-Howard isomorphism
- Title not available (Why is that?)
- Polynomial interpretations for higher-order rewriting
- Title not available (Why is that?)
- Introduction to bisimulation and coinduction
- Title not available (Why is that?)
- An introduction to (co)algebra and (co)induction
- Polymorphic higher-order recursive path orderings
- Title not available (Why is that?)
- A syntactic embedding of predicate logic into second-order propositional logic
- Short Proofs of Strong Normalization
- Simple Saturated Sets for Disjunction and Second-Order Existential Quantification
- Title not available (Why is that?)
- Definitions by rewriting in the Calculus of Constructions
- Termination of rewriting in the Calculus of Constructions
- Polymorphic rewrite rules: confluence, type inference, and instance validation
- Practical coinduction
- Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
- Dynamic dependency pairs for algebraic functional systems
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Polymorphic higher-order termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089012)
