The discriminating power of multiplicities in the \(\lambda\)-calculus

DOI10.1006/inco.1996.0037zbMath0853.68128OpenAlexW2031709122MaRDI QIDQ1917097

Cosimo Laneve, Gérard Boudol

Publication date: 12 December 1996

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0037

zbMATH Keywords

\(\lambda\)-calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Related Items (8)

Infinitary lambda calculus and discrimination of Berarducci trees. ⋮ Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Algebraic interpretation of lambda calculus with resources ⋮ Unnamed Item ⋮ Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion ⋮ From Böhm's Theorem to Observational Equivalences ⋮ Intersection types for \(\lambda\)-trees ⋮ Discrimination by parallel observers: the algorithm.

This page was built for publication: The discriminating power of multiplicities in the \(\lambda\)-calculus