Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi

DOI10.1016/j.ic.2009.11.003zbMath1187.68129OpenAlexW1967481987MaRDI QIDQ964003

Matthias Mann, Manfred Schmidt-Schauss

Publication date: 14 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.ic.2009.11.003

zbMATH Keywords

bisimulationlambda calculuscontextual equivalencecall-by-needhigher-order programming languagesnon-deterministic lambda calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec

Uses Software

• Fudgets

Cites Work

• On generic context lemmas for higher-order calculi with sharing
• Fully abstract models of typed \(\lambda\)-calculi
• Bisimilarity as a theory of functional programming
• Erratic Fudgets: A semantic theory for an embedded coordination language
• Proving congruence of bisimulation in functional programming languages
• Counterexamples to applicative simulation and extensionality in non-deterministic call-by-need lambda-calculi with letrec
• An operational semantics for parallel lazy evaluation
• A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
• Safety of Nöcker's strictness analysis
• The call-by-need lambda calculus
• The call-by-need lambda calculus
• A non-deterministic call-by-need lambda calculus
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi