Dynamic rebinding for marshalling and update, with destruct-time

DOI10.1145/944705.944715zbMATH Open1315.68047OpenAlexW2105399292MaRDI QIDQ5261269FDOQ5261269

Authors:

Publication date: 2 July 2015

Published in: Proceedings of the eighth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/944705.944715

Recommendations

• Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
• Extending the lambda-calculus with unbind and rebind
• Type safe incremental rebinding
• A lambda-calculus for dynamic binding
• Trustworthy Global Computing

zbMATH Keywords

programming languageslambda calculusdynamic bindingdistributed programmingdynamic updateserialisationmarshalling

Mathematics Subject Classification ID

Distributed systems (68M14) Functional programming and lambda calculus (68N18)

Cited In (10)

• A Framework for Type Safe Exchange of Mobile Code
• Trustworthy Global Computing
• Constrained polymorphic types for a calculus with name variables
• Dynamic rebinding for marshalling and update, via redex-time and destruct-time reduction
• Incremental rebinding with name polymorphism
• Typing unmarshalling without marshalling types
• Type safe incremental rebinding
• A parametric calculus for mobile open code
• ReCaml: execution state as the cornerstone of reconfigurations
• Extending the lambda-calculus with unbind and rebind

This page was built for publication: Dynamic rebinding for marshalling and update, with destruct-time \(\lambda\)

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