Fully abstract encodings of -calculus in HOcore through abstract machines

zbMATH Open1452.03041MaRDI QIDQ5144665FDOQ5144665

Authors: Małgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt 

Publication date: 19 January 2021

Full work available at URL: http://dl.acm.org/citation.cfm?id=3330053

Recommendations

• An investigation into functions as processes
• From λ to π; or, Rediscovering continuations
• scientific article; zbMATH DE number 177812
• Typed Lambda Calculi and Applications
• A fully-abstract semantics of \(\lambda\mu\) in the \(\pi\)-calculus

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Classical models of computation (Turing machines, etc.) (68Q04)

Cited In (5)

• Fully abstract encodings of \(\lambda\)-calculus in HOcore through abstract machines
• Typed Lambda Calculi and Applications
• On the interactive power of higher-order processes extended with parameterization
• Title not available (Why is that?)
• Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion

This page was built for publication: Fully abstract encodings of \(\lambda \)-calculus in HOcore through abstract machines

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