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}
}
  • Stefan Milius, Thorsten Wißmann
  • 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

    Regular Behaviours with Names

    VIEW 3 EXCERPTS
    CITES BACKGROUND & RESULTS

    A New Foundation for Finitary Corecursion and Iterative Algebras

    VIEW 1 EXCERPT
    CITES BACKGROUND

    On Algebras with Effectful Iteration

    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

    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

    Semantics of Higher-Order Recursion Schemes

    A Sound and Complete Calculus for Finite Stream Circuits

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