Typing streams in the Λμ-calculus

DOI10.1145/1805950.1805958zbMATH Open1351.68065OpenAlexW2076577093MaRDI QIDQ2946616

Alexis Saurin

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1805950.1805958

zbMATH Keywords

confluencetype systemdelimited controlBöhm theoremstreams\(\Lambda\mu\)-calculusclassical \(\lambda\)-calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (9)

Parsimonious Types and Non-uniform Computation ⋮ Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ Call-by-name extensionality and confluence ⋮ Confluence proofs of lambda-mu-calculi by Z theorem ⋮ Flow-sensitive type systems and the ambient calculus ⋮ Imperative streams—a monadic combinator library for synchronous programming ⋮ The approximation theorem for the Λμ-calculus ⋮ Strong reduction of combinatory calculus with streams ⋮ Type-Based Productivity of Stream Definitions in the Calculus of Constructions

This page was built for publication: Typing streams in the Λμ-calculus

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