Maximal sharing in the Lambda calculus with letrec
From MaRDI portal
Publication:2819667
DOI10.1145/2628136.2628148zbMath1345.68053arXiv1401.1460OpenAlexW2045750550MaRDI QIDQ2819667
Publication date: 29 September 2016
Published in: Proceedings of the 19th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.1460
unfolding semanticshigher-order term graphslambda calculus with letrecmaximal sharingsubterm sharing
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items