Untyped Recursion Schemes and Infinite Intersection Types

DOI10.1007/978-3-642-12032-9_24zbMath1284.68139OpenAlexW1854521429MaRDI QIDQ3557861

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)

Related Items (2)

Higher order symbolic execution for contract verification and refutation ⋮ Functional programs as compressed data

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