Home
Scholarly Works
Internally Typed Second-Order Term Graphs
Conference

Internally Typed Second-Order Term Graphs

Abstract

We present a typing concept for second-order term graphsthat doesnot consider the types as an external add-on, but as an integral part of the term graph structure. This allows a homogeneous treatment of term-graph representations of many kinds of typing systems, including second-order λ-calculi and systems of dependent types. Applications can be found in interactive systems and as typed intermediate representation for example in compilers.

Authors

Kahl W

Series

Lecture Notes in Computer Science

Volume

1517

Pagination

pp. 149-163

Publisher

Springer Nature

Publication Date

January 1, 1998

DOI

10.1007/10692760_13

Conference proceedings

Lecture Notes in Computer Science

ISSN

0302-9743

Labels

View published work (Non-McMaster Users)

Contact the Experts team