Hypergraph Representation of Lambda-Terms

Alimujiang Yasen, Kazunori Ueda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Substitution in the calculus is a subtle operation. In a formal description, Barendregt's variable convention isassumed to avoid variable capture, but such an assumption is notwell suited for implementation on computers. We introduce graphrepresentation and manipulation of Terms, in which bound andfree variables are encoded by using hyperlinks with differentattributes. A graph type called hlground is generalized to identifythe scope of a term n in substitution m[x:= n], which enablesbound variables and free variables to have suitable behaviorduring the substitution. Our representation of the Terms arereadable and the definition of substitution in this technique isfree from any side conditions on the freeness and freshness of variables.

Original languageEnglish
Title of host publicationProceedings - 10th International Symposium on Theoretical Aspects of Software Engineering, TASE 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages113-116
Number of pages4
ISBN (Electronic)9781509017638
DOIs
Publication statusPublished - 2016 Aug 10
Event10th International Symposium on Theoretical Aspects of Software Engineering, TASE 2016 - Shanghai, China
Duration: 2016 Jul 172016 Jul 19

Publication series

NameProceedings - 10th International Symposium on Theoretical Aspects of Software Engineering, TASE 2016

Other

Other10th International Symposium on Theoretical Aspects of Software Engineering, TASE 2016
CountryChina
CityShanghai
Period16/7/1716/7/19

Keywords

  • Graph types
  • Hypergraphs
  • Substitution
  • Terms

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Software

Fingerprint Dive into the research topics of 'Hypergraph Representation of Lambda-Terms'. Together they form a unique fingerprint.

Cite this