Higher-Order Extension

  • Masahito Hasegawa
Part of the Distinguished Dissertations book series (DISTDISS)


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.


Monoidal Category Additional Axiom Sharing Theory Sharing Structure Symmetric Monoidal Category 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 1999

Authors and Affiliations

  • Masahito Hasegawa
    • 1
  1. 1.Research Institute for Mathematical SciencesKyoto UniversityKyotoJapan

Personalised recommendations