Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Curl: a gentle slope language for the Web
World Wide Web Journal - Special issue: scripting languages: automating the Web
Haskell and XML: generic combinators or type-based translation?
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
ACM Transactions on Internet Technology (TOIT)
Revised Report on the Algorithmic Language Scheme
Higher-Order and Symbolic Computation
SXSLT: Manipulation Language for XML
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
XDuce: A statically typed XML processing language
ACM Transactions on Internet Technology (TOIT)
Extending Java for high-level Web service construction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Server side web scripting in Haskell
Journal of Functional Programming
A typed representation for HTML and XML documents in Haskell
Journal of Functional Programming
Implementation and use of the PLT scheme Web server
Higher-Order and Symbolic Computation
Better abstractions for secure server-side scripting
Proceedings of the 17th international conference on World Wide Web
Customizing a functional programming language for web development
Computer Languages, Systems and Structures
MIDI programming in scheme: supported by an Emacs environment
Proceedings of the 7th European Lisp Workshop
| Hi-index | 0.00 |
Functional programming fits well with the use of descriptive markup in HTML and XML. There is also a good fit between S-expressions in Lisp and the XML data set. These similarities are exploited in LAML which is a software package for Scheme. LAML supports exact mirrors of the three variants of XHTML 1.0, SVG 1.0, and a number of more specialized XML languages. The mirrors are all synthesized from document type definitions (DTDs). Each element in a mirror is represented by a named function in Scheme. The mirror functions validate the XML document while it is generated. The validation is based on finite state automata automatically derived from the DTD.