scientific article; zbMATH DE number 7199590
From MaRDI portal
Publication:5109521
Publication date: 12 May 2020
Full work available at URL: https://arxiv.org/abs/1808.05481
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Unnamed Item, Enhancing expressivity of checked corecursive streams, Checked corecursive streams: expressivity and completeness, Unnamed Item, Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinitary combinatory reduction systems
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Coinductive big-step operational semantics
- Applications of infinitary lambda calculus
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Universal coalgebra: A theory of systems
- Hammer for Coq: automation for dependent type theory
- Confluence of the coinductive \(\lambda\)-calculus
- Highlights in infinitary rewriting and lambda calculus
- Nominal Coalgebraic Data Types with Applications to Lambda Calculus
- An Alpha-Corecursion Principle for the Infinitary Lambda Calculus
- A Semantic Approach to Illative Combinatory Logic
- Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
- Introduction to Bisimulation and Coinduction
- On streams that are finitely red
- Infinitary Combinatory Reduction Systems: Confluence
- A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
- Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
- A Coinductive Confluence Proof for Infinitary Lambda-Calculus
- Confluence of nearly orthogonal infinitary term rewriting systems
- Practical coinduction
- PARTIAL ORDER INFINITARY TERM REWRITING AND BÖHM TREES
- Computer Science Logic
- An introduction to (co)algebra and (co)induction
- Partial Order Infinitary Term Rewriting
- Processes, Terms and Cycles: Steps on the Road to Infinity
