Graph matching in operational semantics and typing

DOI10.1007/3-540-52590-4_49MaRDI QIDQ4027629zbMATH OpenFDO

Authors Kristoffer Høgsbro Holm

Publication date 21 February 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52590-4_49

zbMATH Keywords

graph reduction machinegraph semanticslanguage implementationssemantic descriptions of functional languages

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 7020157
• scientific article; zbMATH DE number 2080217
• A general framework for types in graph rewriting
• scientific article; zbMATH DE number 1953145
• Types as graphs: Continuations in type logical grammar
• Recognizability, hypergraph operations, and logical types
• Dependently-typed formalisation of typed term graphs

Cited in

(9)

• Three syntactic theories for combinatory graph reduction
• scientific article; zbMATH DE number 4030948 (Why is no real title available?)
• Internally typed second-order term graphs
• Graph rewriting semantics for functional programming languages
• scientific article; zbMATH DE number 1761898 (Why is no real title available?)
• scientific article; zbMATH DE number 7020157 (Why is no real title available?)
• The term graph programming system HOPS
• Explicit cyclic substitutions
• Linear matching-time algorithm for the directed graph isomorphism problem

Describes a project that uses

Uses Software

• DACTL

This page was built for publication: Graph matching in operational semantics and typing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027629)