The Denotational Semantics of a Functional Tree-Manipulation Language

The programming language TXL combines features of functional languages with a pattern-matching and failure-handling paradigm, designed for expressing tree-manipulation algorithms. The semantic problems, caused by the interaction of evaluation and pattern matching, are solved by choosing a suitable denotation for patterns and failure. There is no need for general continuations.

[1]  Jan van Leeuwen,et al.  Formal models and semantics , 1990 .

[2]  James R. Cordy,et al.  Practical metaprogramming , 1992, CASCON.

[3]  James R. Cordy,et al.  TXL: A Rapid Prototyping System for Programming Language Dialects , 1991, Comput. Lang..

[4]  James R. Cordy,et al.  Specification and automatic prototype implementation of polymorphic objects in Turing using the TXL dialect processor , 1990, Proceedings. 1990 International Conference on Computer Languages.

[5]  Leon Sterling,et al.  The Art of Prolog , 1987, IEEE Expert.

[6]  Yuri Gurevich,et al.  The Semantics of the C Programming Language , 1992, CSL.

[7]  David A. Gudeman,et al.  Denotational semantics of a goal-directed language , 1992, TOPL.

[8]  Robert D. Tennent,et al.  Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.

[9]  Peter D. Mosses,et al.  Denotational semantics , 1995, LICS 1995.