M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation? In Proc. of the 4th International Conference on Functional Programming, 1999.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Static Analysis of XML Transformations in Java - Kirkegaard, Møller, Schwartzbach (2003) (3 citations) (Correct)
....validity is not considered. To attack the problem of statically guaranteeing validity of the transformation output, a number of systems attempt to model XML transformation using pre existing type systems in general purpose programming languages. Examples based on functional languages are HaXml [26] and WASH CGI [27] both embedding DTD into Haskell. In contrast to HaXml, WASH CGI does not support deconstruction of XML values. In return, WASH CGI allows the use of generic combinators, which the type safe approach in HaXml does not. With this approach, type checking of XML transformations ....
M. Wallace and C. Runciman, "Haskell and XML: Generic combinators or type-based translation?" in Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP '99, September 1999.
Generic Haskell: applications - Hinze, Jeuring (2003) (2 citations) (Correct)
....for the language of the book, and the number of chapters it has. All the other elements are not encoded, since they can be inferred from the DTD. Section 3 describes a tool based on this idea, which was first described by Jansson and Jeuring in the context of data conversion [26, 30] We use HaXml [51] to translate a DTD to a data type, and we construct generic functions for separating the contents (the strings) and the shape (the constructors) of a value of a data type, and for encoding the shape of a value of a data type using information about the (number of) constructors of the data type. ....
....Book = Book Book Attrs Title Author Date [Chapter ] data Book Attrs = Book Attrs bookLang : Lang data Lang = English Dutch newtype Title = Title String newtype Author = Author String newtype Date = Date String newtype Chapter = Chapter String. We have used the Haskell library HaXml [51], in particular the functionality in the module DtdToHaskell to obtain a data type from a DTD, together with functions for reading (parsing) and writing (pretty printing) valid XML documents to and from a value of the generated data type. For example, the following value of the above DTD: title ....
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In International Conference on Functional Programming, pages 148--159, 1999.
Static Analysis of XML Transformations in Java - Kirkegaard, Møller.. (2003) (3 citations) (Correct)
....validity is not considered. To attack the problem of statically guaranteeing validity of the transformation output, a number of systems attempt to model XML transformation using pre existing type systems in general purpose programming languages. Examples based on functional languages are HaXml [18] and WASH CGI [19] both embedding DTD into Haskell. In contrast to HaXml, 3 WASH CGI does not support deconstruction of XML values. In return, WASH CGI allows the use of generic combinators, which the type safe approach in HaXml does not. With this approach, type checking of XML transformations ....
M. Wallace and C. Runciman, "Haskell and XML: Generic combinators or type-based translation?" in Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP '99, September 1999.
DeCo: A Declarative Coordination Framework for Scientific.. - Herington, Stotts (2003) (Correct)
....As such it is part of a recent trend toward basing DSELs on Haskell. A good explanation of Haskell s popularity in this role is given by Hudak [8] Examples of other application domains (and representative DSELs) for which Haskell based DSELs have been built include web programming (HaXml [17] and WASH CGI [15] hardware description (Lava [1] and Hawk [9] animation ( 4] and robotics ( 10] Shells and scripting languages share with coordination languages the high level aim of facilitating aggregation of existing computational components, though their style is that of a more ....
M. Wallace and C. Runciman. Haskell and xml: Generic combinators or type-based translation? In P. Lee, editor, Proc. international conference on functional programming 1999.
To Reuse or To Be Reused: Techniques for Component Composition.. - de Jonge (2003) (Correct)
....scheme of ASDL relies on the typedness of the trees. The rate of compression is significantly smaller than for ATERMS [28] Furthermore, pickles have a binary form only. The DTD notation of XML [34] is an alternative formalism in which abstract syntax can be defined. Tools such as HaXML [146] generate code from DTDs. HaXML offers support both for type based and for generic transformations on XML documents, using Haskell as programming language. Other languages are not targeted. Concrete syntax support is not integrated. XML is originally intended as mark up language, not to represent ....
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation? ACM SIGPLAN Notices, 34(9):148--159, September 1999. Proceedings of the International Conference on Functional Programming (ICFP'99), Paris, France.
Typed Combinators for Generic Traversal - Lämmel, Visser (2002) (1 citation) (Correct)
....are not only applicable to software re engineering problems, but generally to all areas of language and document processing where type safe generic traversal is desirable. For example, our strategy combinators can be used for XML processing where, in contrast to the approaches presented in [23], document processors can at once be typed and generic. Generic functional programming Related forms of genericity have been proposed elsewhere. These approaches are not just more complex than ours, but they are even insufficient for a faithful encoding of the combinators we propose. With ....
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type- based translation? ACM SIGPLAN Notices, 34(9):148-159, Sept. 1999. Proceed- ings of ICFP'99.
The Duality of XML Markup and Programming Notation - Nørmark (2003) (1 citation) (Correct)
....and XML applications by use of the Haskell type system is the driving force for most Haskell researchers, who work on XML issues. Thiemann s work is probably the most complete in that regard [19] Meijers work on a language called XM is another example. In the work of Wallace and Runciman [20] the contrast between a generic modelling of XML and a more speci c modelling (in which the DTD gives rise to a number of Haskell type de nitions) is discussed. In imperative programming languages procedures form the natural abstraction mechanism. But a subsumption of XML as procedures is not ....
Malcolm Wallace and Colin Runciman. Haskell and XML: generic combinators or type-based translation? In Proceedings of the fourth ACM SIGPLAN international conference on Functional programming, pages 148-159. ACM Press, 1999. Published in Sigplan Notices vol 34 number 9. 8
This is Scribe! - Serrano, Gallesio (Correct)
....di erent programming languages which appear to be, most of the time, Java, Tcl, and C. A vast e ort has been made to provide most of the functional programming languages with tools for handling XML texts. It exists XML parsers for mostly all functional programming languages. Haskell has HaXml [19], Caml has Px and Tony, and Scheme has SSax [7] In addition to parsers, Scheme has also SXML [6] which is either an abstract syntax tree of an XML document or a concrete representation using S expressions. SXML is suitable for Scheme based XML authoring. It is a term implementation of the XML ....
Wallace, M. and Runciman, C. { Haskell and XML: Generic Combinators or Type-Based Translation? { Int'l Conf. on Functional Programming, Paris, France, 1999.
Extracting Typed Values from XML Data - Connor, Lievens, Manghi, Neely.. (2001) (Correct)
....untyped query languages. In an integrated environment, the convenience of the first would complement the flexibility of the second for data with a varying degree of structural regularity. Other high level bindings between XML and existing programming languages have been recently presented (cf. [31, 16, 22]) They all map some form of data description (usually a DTD or an XML Schema) onto language types that capture directly the semantics intended for the data. For this reason, they operate on fairly regular XML documents and do not provide facilities for extracting regular subsets from arbitrary ....
Malcolm Wallace and Colin Ranciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34-9 of ACM Sigplan Notices, pages 148--159, N.Y.,
An Approach to High-Level Language Bindings to XML - Simeoni, Mangh, Lievens.. (2002) (5 citations) (Correct)
....untyped query languages. In an integrated environment, the convenience of the first would complement the flexibility of the second for data with a varying degree of structural regularity. Other high level bindings between XML and existing programming languages have been recently presented (cf. [13 15]. They all map some form of data description (usually a DTD or an XML Schema) onto language types that capture directly the semantics intended for the data. For this reason, they operate on fairly regular XML documents and do not provide facilities for extracting regular subsets from arbitrary ....
M. Wallace, C. Ranciman, Haskell and XML: Generic combinators or type-based translation?, in: Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP'99), Vol. 34-9 of ACM Sigplan Notices, ACM Press, N.Y., 1999, pp. 148-159.
Generic Programming for XML Tools - Jeuring, Hagg (2002) (3 citations) (Correct)
....the same thing (modulo structure di#erences) for di#erent DTD s. In that sense these tools are very similar to the generic equality function. We claim that many classes of XML tools are generic programs, or would benefit from being viewed as generic programs. We call such tools DTD aware XML tools [38]. 1 Generic Programming for XML Tools. Since DTD aware XML tools are generic programs, it should help to implement such tools as generic programs. Implementing an XML tool as a generic program has several advantages: Development time. Generic programming supports the construction of type ....
.... Book = Book Book Attrs Title Author Date [Chapter] data Book Attrs = Book Attrs bookLang : Lang data Lang = English Dutch newtype Title = Title String newtype Author = Author String newtype Date = Date String newtype Chapter = Chapter String We have used the Haskell library HaXml [38], in particular the functionality in the module DtdToHaskell to obtain a data type from a DTD, together with functions for reading (parsing) and writing (pretty printing) valid XML documents to and from a value of the generated data type. For example, the following value of the above DTD: title ....
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In International Conference on Functional Programming, pages 148--159, 1999.
Typed Combinators for Generic Traversal - Lämmel, Visser (2002) (1 citation) (Correct)
....are not only applicable to software re engineering problems, but generally to all areas of language and document processing where type safe generic traversal is desirable. For example, our strategy combinators can be used for XML processing where, in contrast to the approaches presented in [23], document processors can at once be typed and generic. Generic functional programming Related forms of genericity have been proposed elsewhere. These approaches are not just more complex than ours, but they are even insucient for a faithful encoding of the combinators we propose. With ....
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or typebased translation? ACM SIGPLAN Notices, 34(9):148-159, Sept. 1999. Proceedings of ICFP'99.
A formal semantics of patterns in XSLT - Wadler (2000) (32 citations) (Correct)
....by Bird [Bird] and Paulson [Paulson] The semantics was developed and debugged by transliterating it into the functional language Haskell [Haskell] and a copy of the Haskell program may be had by contacting the author. In related work, Haskell programs for manipulating XML have been developed by Wallace and Runciman [Wallace and Runciman] The same techniques used here can be extended to give a denotational semantics of the entire XPath language, and such a semantics has been written. However, XPath is considerably more powerful than the pattern language of the December 1998 XSLT, and the semantics is ....
....[Paulson] The semantics was developed and debugged by transliterating it into the functional language Haskell [Haskell] and a copy of the Haskell program may be had by contacting the author. In related work, Haskell programs for manipulating XML have been developed by Wallace and Runciman [Wallace and Runciman] The same techniques used here can be extended to give a denotational semantics of the entire XPath language, and such a semantics has been written. However, XPath is considerably more powerful than the pattern language of the December 1998 XSLT, and the semantics is correspondingly more ....
[Article contains additional citation context not shown here]
Malcolm Wallace and Colin Runciman, Haskell and XML: Generic Combinators or Type-Based Translation? 4'th International Conference on Functional Programming (ICFP 99), Paris, ACM Press, September 1999.
Haskell Server Pages - Functional Programming and the.. - Meijer, van Velzen (2001) (4 citations) (Correct)
....an embedded command, that when executed will return a Value. type Attributes = Name,Value) data Value = Value String ValueIO (IO Value) Note that nothing prevents us from using one of the more strongely typed representations that have been proposed for representing HTML or XML documents [34,8,33] in Haskell. As we have argued before, the Haskell type system is fundamentally too weak to truly embed the XML type system. We have chosen the simplest possible solution over more complicated, but nonetheless partial ones. 4.2.2 Translation The semantics of HSP is defined by a handful of simple ....
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic Combinators or Type-Based Translation? In ICFP, 1999.
Scalable Programming Abstractions for XML Services - Burak Emir Sebastian (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation? In Proc. of the 4th International Conference on Functional Programming, 1999.
Regular Expression Types for XML - Haruo Hosoya Kyoto (2000) (51 citations) (Correct)
No context found.
Wallace, M. and Runciman, C. 1999. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99). ACM Sigplan Notices, vol. 34-9. ACM Press, N.Y., 148-159.
XParse: A Language for Parsing Text to XML - Cheney (2002) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), pages 148--159, N.Y., 1999. ACM Press.
A Typeful and Tagless Representation for XML Documents - Zhu, Xi (2003) (2 citations) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic Combinators or TypeBased Translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34--9, pages 148--159, N.Y., 27--29 1999. ACM Press.
UUXML: A Type-Preserving XML Schema-Haskell Data Binding - Atanassow, Clarke, Jeuring (2004) (1 citation) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In International Conference on Functional Programming, pages 148--159, 1999.
Bidirectionalizing Tree Transformations - Zhenjiang Hu Kento (Correct)
No context found.
Wallace, M., Runciman, C.: Haskell and XML: Generic combinators or typebased translation? In: ACM SIGPLAN International Conference on Functional Programming, Paris, ACM Press (1999) 148--159
A Runtime System for XML Transformations in Java - Christensen, Kirkegaard.. (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or typebased translation? In Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP '99, September 1999.
An Algebraic Approach to Bi-Directional Updating - Mu, Hu, Takeichi (2004) (2 citations) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: generic combinators or type-based translation? . In Proceedings of the 1999 ACM SIGPLAN International Conference on Functional Programming, pages 148--159. ACM Press, September 1999.
Type-based {XML} Processing in Logic Programming - Coelho, Florido (2003) (6 citations) (Correct)
No context found.
Malcom Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In International Conference on Functional Programming, 1999.
Scripting XML with Generic Haskell - Atanassow, Clarke, Jeuring (2003) (2 citations) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or typebased translation? In International Conference on Functional Programming, pages 148--159, 1999.
Scrap Your Boilerplate: A Practical Design Pattern for Generic .. - Lämmel, Jones (2003) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation. In ACM SIGPLAN International Conference on Functional Programming (ICFP'99), pages 148--159, Paris, Sept. 1999. ACM.
Embedding Domain Specific Languages in the Attribute.. - Saraiva, Schneider (2003) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and xml: Generic combinators or type-based translation? In International Conference on Functional Programming, pages 1--12. ACM, 1999.
StaXML: Static Typing of XML Document Fragments for.. - Bradley, Kfoury.. (2004) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34--9, pages 148--159, N.Y., 27--29 1999. ACM Press. 15
Scrap More Boilerplate: Reflection, Zips, and Generalised Casts - Lämmel, Jones (2004) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation. In ACM SIGPLAN International Conference on Functional Programming (ICFP'99), pages 148--159, Paris, Sept. 1999. ACM.
Scrap Your Boilerplate: A Practical Design Pattern for Generic .. - Lämmel, Jones (2003) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation. In ACM SIGPLAN International Conference on Functional Programming (ICFP'99), pages 148--159, Paris, Sept. 1999. ACM.
Towards an Engineering Discipline for GRAMMARWARE - Klint, Lämmel, Verhoef (2003) (3 citations) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation? ACM SIGPLAN Notices, 34(9):148--159, Sept. 1999. Proc. of ICFP'99.
XML Transformations in Scheme with LAML - - Minimalistic Approach Kurt (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: generic combinators or type-based translation? In Proceedings of the fourth ACM SIGPLAN international conference on Functional programming, pages 148-159. ACM Press, 1999. Published in Sigplan Notices vol 34 number 9. Also available from http://www.cs.york.ac.uk/fp/HaXml/icfp99.html.
Static Analysis of XML Transformations in Java - Kirkegaard, Møller.. (2003) (3 citations) (Correct)
No context found.
M. Wallace and C. Runciman, "Haskell and XML: Generic combinators or type-based translation?" in Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP '99, September 1999.
Information flow security for XML transformations - Benzaken, Burelle, Castagna (2003) (Correct)
No context found.
C. Wallace and C. Runciman. Haskell and XML: Generic combinators or type based translation ? In ICFP '99, 4th ACM Conference on Functional Programming, pages 148--159, 1999.
A Programmable Editor for Developing Structured Documents.. - Hu, Mu, Takeichi (2004) (1 citation) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In ACM SIGPLAN International Conference on Functional Programming, pages 148--159, Paris, 1999. ACM Press.
Scripting XML with Generic Haskell - Atanassow, Clarke, Jeuring (2003) (2 citations) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In International Conference on Functional Programming, pages 148--159, 1999.
XParse: A Language for Parsing Text to XML - Cheney (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), pages 148--159, N.Y., 1999. ACM Press.
Querying and Transforming XML Documents Using Tree Automata - Berlea, Seidl (2003) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In Peter Lee, editor, Proceedings Of The International Conference on Functional Programming 1999, Paris, France, pages 148-259. ACM Press, New York, Sept 1999. 41
Inferring Type Isomorphisms Generically - Atanassow, Jeuring (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In International Conference on Functional Programming, pages 148--159, 1999.
Optimising Embedded DSLs Using Template Haskell - Seefried, Chakravarty, Keller (2004) (1 citation) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34--9, pages 148--159, N.Y., 27--29 1999. ACM Press.
Optimising Embedded DSLs using Template - Haskell Sean Seefried (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34--9, pages 148--159, N.Y., 27--29 1999. ACM Press.
A Typeful and Tagless Representation for Xml Documents - Zhu, Xi (2003) (2 citations) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic Combinators or TypeBased Translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34--9, pages 148--159, N.Y., 27--29 1999. ACM Press.
A Programmable Editor for Developing Structured Documents.. - Hu, Mu, Takeichi (2004) (1 citation) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In ACM SIGPLAN International Conference on Functional Programming, pages 148--159, Paris, 1999. ACM Press. 12
StaXML: Static Typing of XML Document Fragments for.. - Bradley, Kfoury.. (2004) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34--9, pages 148--159, N.Y., 27--29 1999. ACM Press. 15
Scrap Your Boilerplate: A Practical Design Pattern for Generic .. - Lämmel, Jones (2003) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation. In ACM SIGPLAN International Conference on Functional Programming (ICFP'99), pages 148--159, Paris, Sept. 1999. ACM.
Plugging Haskell In - Pang, Stewart, Seefried, Chakravarty (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or type-based translation? In Proceedings of the Fourth ACM SIGPLAN International Conference on Functional Programming (ICFP`99), volume 34--9, pages 148--159, N.Y., 27--29 1999. ACM Press.
Static Analysis of XML Transformations in Java - Anders (2003) (3 citations) (Correct)
No context found.
M. Wallace and C. Runciman, "Haskell and XML: Generic combinators or type-based translation?" in Proc. 5th ACM SIGPLAN International Conference on Functional Programming, ICFP '99, September 1999.
The Definition of the NSP Type System - Draheim, Fehr, Weber (2002) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or typebased translation ? ACM SIGPLAN Notices, 34(9):148-159, Sept. 1999. Proceedings of ICFP'99.
Scripting XML with Generic Haskell - Atanassow, Clarke, Jeuring (2003) (2 citations) (Correct)
No context found.
Malcolm Wallace and Colin Runciman. Haskell and XML: Generic combinators or typebased translation? In International Conference on Functional Programming, pages 148--159, 1999.
Xing: A Visual XML Query Language - Erwig (2003) (1 citation) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic Combinators or Type-Based Translation? In 4th ACM Int. Conf. on Functional Programming, pages 148--159, 1999.
Typed Combinators for Generic Traversal - Lämmel, Visser (2002) (1 citation) (Correct)
No context found.
M. Wallace and C. Runciman. Haskell and XML: Generic combinators or type-based translation? ACM SIGPLAN Notices, 34#9#:148#159, Sept. 1999. Proceedings of ICFP'99.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC