Abstract
In this chapter we develop a higher-order extension of acyclic sharing theories, i.e. an extension with lambda abstractions and applications. There has been considerable research on such settings, notably higher-order graph rewriting theory, also called lambda graph rewriting systems, which are led by a practical demand for efficient implementation techniques for functional programming languages.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London Limited
About this chapter
Cite this chapter
Hasegawa, M. (1999). Higher-Order Extension. In: Models of Sharing Graphs. Distinguished Dissertations. Springer, London. https://doi.org/10.1007/978-1-4471-0865-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0865-8_4
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1221-1
Online ISBN: 978-1-4471-0865-8
eBook Packages: Springer Book Archive