Lazy Lambda calculus: Theories, models and local structure characterization

DOI10.1007/3-540-55719-9_98zbMath1425.68055OpenAlexW51747038MaRDI QIDQ5204341

No author found.

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_98

zbMATH Keywords

functional programminglambda calculusproof systemapplicative structuregraph function

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Discrimination by parallel observers: the algorithm.

Cites Work

• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• \(\mathbb{T}^\omega\) as a universal domain
• Algebras and combinators
• Full abstraction in the lazy lambda calculus
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Data Types as Lattices

This page was built for publication: Lazy Lambda calculus: Theories, models and local structure characterization