scientific article; zbMATH DE number 7566074
From MaRDI portal
Publication:5094148
Publication date: 2 August 2022
Full work available at URL: https://arxiv.org/abs/1912.03434
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haskell\(\lambda\)-calculusterminationfunctional programming languagetheorymodularityalgebrasecond-order algebraic theory
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Call-by-push-value: Decomposing call-by-value and call-by-name
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility
- Counterexamples to termination for the direct sum of term rewriting systems
- Polymorphic rewriting conserves algebraic strong normalization
- Modularity of simple termination of term rewriting systems with shared constructors
- Generalized sufficient conditions for modular termination of rewriting
- On the modularity of termination of term rewriting systems
- Modular proofs for completeness of hierarchical term rewriting systems
- Polymorphic rewrite rules: confluence, type inference, and instance validation
- Modular termination proofs for rewriting using dependency pairs
- Termination of term rewriting using dependency pairs
- Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names
- Algebraic Effects, Linearity, and Quantum Programming Languages
- Handling Algebraic Effects
- Associated type synonyms
- Normal Higher-Order Termination
- Harnessing First Order Termination Provers Using Higher Order Dependency Pairs
- The computability path ordering
- Polymorphic higher-order recursive path orderings
- Semantic Labelling for Proving Termination of Combinatory Reduction Systems
- Second-Order Equational Logic (Extended Abstract)
- Second-Order Algebraic Theories
- A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
- Modularity of strong normalization in the algebraic-λ-cube
- Termination for direct sums of left-linear complete term rewriting systems
- Substitution, jumps, and algebraic effects
- Transforming termination by self-labelling
- Definitions by rewriting in the Calculus of Constructions
- An Algebraic Presentation of Predicate Logic
- Termination of constructor systems
- How to prove decidability of equational theories with second-order computation analyser SOL
- Handlers in action
- Instances of Computational Effects: An Algebraic Perspective
- Multiversal Polymorphic Algebraic Theories: Syntax, Semantics, Translations, and Equational Logic
- Associated types with class
- Programming Languages and Systems
- On the Church-Rosser property for the direct sum of term rewriting systems
- Term Rewriting and Applications
- Termination by absence of infinite chains of dependency pairs
- Inductive-data-type systems
This page was built for publication:
