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.
Unable to display preview. Download preview PDF.