scientific article; zbMATH DE number 7168147
From MaRDI portal
Publication:5216302
Publication date: 17 February 2020
Full work available at URL: https://arxiv.org/abs/1808.05059
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
productivityfunctional programmingprogramming language semanticsinfinitary rewritingcoinductive types
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lazy productivity via termination
- Infinitary combinatory reduction systems
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Productivity of stream definitions
- Infinitary lambda calculus
- Transfinite reductions in orthogonal term rewriting systems
- A lattice-theoretical fixpoint theorem and its applications
- Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
- Introduction to Bisimulation and Coinduction
- Representations of Stream Processors Using Nested Fixed Points
- Infinitary Combinatory Reduction Systems: Confluence
- Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Type-based termination of recursive definitions
- Subclasses of presburger arithmetic and the weak EXP hierarchy
- Infinitary lambda calculi and böhm models
- Pure type systems with corecursion on streams
- A Coinductive Confluence Proof for Infinitary Lambda-Calculus
- Wellfounded recursion with copatterns
- Confluence of nearly orthogonal infinitary term rewriting systems
- Practical coinduction
- Well-founded recursion with copatterns and sized types
- Computer Science Logic
- An introduction to (co)algebra and (co)induction
- Data-Oblivious Stream Productivity
This page was built for publication:
