# Finitary Corecursion for the Infinitary Lambda Calculus

@inproceedings{Milius2015FinitaryCF,
title={Finitary Corecursion for the Infinitary Lambda Calculus},
author={Stefan Milius and Thorsten Wi{\ss}mann},
booktitle={CALCO},
year={2015}
}
• Published in CALCO 2015
• Mathematics, Computer Science
• Kurz et al. have recently shown that infinite $\lambda$-trees with finitely many free variables modulo $\alpha$-equivalence form a final coalgebra for a functor on the category of nominal sets. Here we investigate the rational fixpoint of that functor. We prove that it is formed by all rational $\lambda$-trees, i.e. those $\lambda$-trees which have only finitely many subtrees (up to isomorphism). This yields a corecursion principle that allows the definition of operations such as substitution… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

#### Citations

##### Publications citing this paper.
SHOWING 1-9 OF 9 CITATIONS

## On Rational Fixpoints of Endofunctors on Nominal Sets

VIEW 3 EXCERPTS
CITES BACKGROUND & RESULTS

## Regular Behaviours with Names

• Computer Science, Mathematics
• Applied Categorical Structures
• 2016
VIEW 3 EXCERPTS
CITES BACKGROUND & RESULTS

## A Coalgebraic View on Reachability

• Mathematics
• 2019

## A New Foundation for Finitary Corecursion and Iterative Algebras

• Computer Science, Mathematics
• Inf. Comput.
• 2018
VIEW 1 EXCERPT
CITES BACKGROUND

## On Algebras with Effectful Iteration

• Mathematics, Computer Science
• CMCS
• 2018
VIEW 1 EXCERPT
CITES BACKGROUND

## Proper Functors and Fixed Points for Finite Behaviour

• Stefan Milius
• Computer Science, Mathematics
• Logical Methods in Computer Science
• 2017
VIEW 1 EXCERPT
CITES BACKGROUND

## A New Foundation for Finitary Corecursion - The Locally Finite Fixpoint and Its Properties

• Mathematics, Computer Science
• FoSSaCS
• 2016
VIEW 1 EXCERPT
CITES BACKGROUND

## A Mechanized Theory of Regular Trees in Dependent Type Theory

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES

## Introduction to Coalgebra: Towards Mathematics of States and Observation

• Bart Jacobs
• Computer Science
• Cambridge Tracts in Theoretical Computer Science
• 2016

## The rational fixed point in nominal sets and its application to infinitary lambda-calculus. Project report, available at http://thorsten-wissmann.de/theses/ project-wissmann.pdf

• Thorsten Wißmann
• 2014

## Nominal Coalgebraic Data Types with Applications to Lambda Calculus

• Computer Science, Mathematics
• Logical Methods in Computer Science
• 2013

## Rational Operational Models

• Computer Science
• MFPS
• 2013

## Sound and Complete Axiomatizations of Coalgebraic Language Equivalence

• Computer Science, Mathematics
• TOCL
• 2013

## On the specification of operations on the rational behaviour of systems

• Computer Science, Mathematics
• EXPRESS/SOS
• 2012

## Semantics of Higher-Order Recursion Schemes

• Computer Science, Mathematics
• Logical Methods in Computer Science
• 2011

## A Sound and Complete Calculus for Finite Stream Circuits

• Stefan Milius
• Computer Science
• 2010 25th Annual IEEE Symposium on Logic in Computer Science
• 2010