Untyped lambda-calculus with input-output

DOI10.1007/3-540-61064-2_46OpenAlexW2104356063MaRDI QIDQ5878918

Mitchell Wand, Jerzy Tiuryn

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_46

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (4)

Program equivalence in a simple language with state ⋮ From Applicative to Environmental Bisimulation ⋮ Preorder-constrained simulations for program refinement with effects ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LCF considered as a programming language
• Fully abstract models of typed \(\lambda\)-calculi
• The lazy lambda calculus in a concurrency scenario
• A variable typed logic of effects
• Proving congruence of bisimulation in functional programming languages

This page was built for publication: Untyped lambda-calculus with input-output