by Wolfram Kahl
Graph Theoretic Concepts in Computer Science, WG '98
http://ist.unibw-muenchen.de/Publications/Conf/Kahl-1998d.ps.gz
Add To MetaCart
Abstract:
Abstract. Wepresent a typingconcept 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 l-calculi and systems of dependent types. Applications can be found in interactive systems and as typed intermediate representation for example in compilers. 1
Citations
|
993
|
The Z notation: a reference manual
– Spivey
- 1992
|
|
444
|
Lambda calculi with types
– Barendregt
- 1991
|
|
275
|
Functional programming with bananas, lenses, envelopes and barbed wire
– Meijer, Fokkinga, et al.
- 1991
|
|
96
|
Semantics and Pragmatics of the Lambda Calculus
– Wadsworth
- 1971
|
|
25
|
A theory of binding structures and applications to rewriting
– Talcott
- 1993
|
|
15
|
Combinatory Reduction Systems. Mathematisch Centrum
– Klop
- 1980
|
|
8
|
Relational treatment of term graphs with bound variables
– Kahl
- 1998
|
|
8
|
An interactive graphical manipulation system for higher objects based on relational algebra
– Zierer, Schmidt, et al.
- 1986
|
|
5
|
The Higher Object Programming System --- User Manual for HOPS, Fakultt fr Informatik, Universitt der Bundeswehr Mnchen
– Kahl
- 1998
|
|
3
|
ISBN 3-931327-60-4, zugleich Dissertation an der Fakultt fr Informatik, Universitt der Bundeswehr Mnchen
– Verlag, Mnchen
- 1996
|
|
3
|
A fibred approach to rewriting --- how the duality between adding and deleting cooperates with the difference between matching and rewriting
– Kahl
- 1997
|
|
3
|
Relations and Graphs—Discrete Mathematics for Computer Scientists
– Schmidt, Strhlein
- 1993
|
