Untyped Recursion Schemes and Infinite Intersection Types

DOI10.1007/978-3-642-12032-9_24MaRDI QIDQ3557861zbMATH OpenOpenAlexFDO

Authors Takeshi Tsukada, Naoki Kobayashi

Publication date 27 April 2010

Published in Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12032-9_24

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Infinite intersection and union types for the lazy lambda calculus
• Intersection types for unboundedness problems
• Infinite intersection types
• Partial elements and recursion via dominances in univalent type theory
• scientific article; zbMATH DE number 2140436
• scientific article; zbMATH DE number 1047956
• On type inference in the intersection type discipline
• Nested general recursion and partiality in type theory
• scientific article; zbMATH DE number 179038
• Infinite products of recursive equivalence types

Cited in

(5)

• A type system describing unboundedness
• scientific article; zbMATH DE number 3983152 (Why is no real title available?)
• Functional programs as compressed data
• Higher order symbolic execution for contract verification and refutation
• Infinite products of recursive equivalence types

This page was built for publication: Untyped Recursion Schemes and Infinite Intersection Types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557861)