363 research outputs found
Strong (X)HTML Compliance with Haskell\u27s Flexible Type System
We report on the embedding of a domain specific language, (X)HTML, into Haskell and demonstrate how this superficial non-context-free language can be represented and rendered to guarantee World Wide Web Consortium (W3C) compliance. Compliance of web content is important for the health of the Internet, accessibility, visibility, and reliable search. While tools exist to verify web content is compliant according to the W3C, few systems guarantee that all produced content is compliant. We present CH-(X)HTML, a library for generating compliant (X)HTML content by using Haskell to encode the nontrivial syntax of (X)HTML set forth by the W3C. Any compliant document can be represented with this library, while a compilation error will occur if non-compliant markup is attempted. To demonstrate our library we present examples and performance measurements
Modelling Reactive Multimedia: Design and Authoring
Multimedia document authoring is a multifaceted activity, and authoring tools tend to concentrate on a restricted set of the activities involved in the creation of a multimedia artifact. In particular, a distinction may be drawn between the design and the implementation of a multimedia artifact.
This paper presents a comparison of three different authoring paradigms, based on the common case study of a simple interactive animation. We present details of its implementation using the three different authoring tools, MCF, Fran and SMIL 2.0, and we discuss the conclusions that may be drawn from our comparison of the three approaches
The Implementation of iData - A Case Study in Generic Programming
Item does not contain fulltex
JSONYA/FN: Functional Computation in JSON
Functional programming has a lot to offer to the developers of
global Internet-centric applications, but is often applicable only to a small
part of the system or requires major architectural changes. The data model
used for functional computation is often simply considered a consequence of
the chosen programming style, although inappropriate choice of such model
can make integration with imperative parts much harder. In this paper we do
the opposite: we start from a data model based on JSON and then derive the
functional approach from it. We outline the identified principles and present
Jsonya/fn — a low-level functional language that is defined in and operates
with the selected data model. We use several Jsonya/fn implementations
and the architecture of a recently developed application to show that our
approach can improve interoperability and can achieve additional reuse of
representations and operations at relatively low cost. ACM Computing Classification System (1998): D.3.2, D.3.4
Towards MKM in the Large: Modular Representation and Scalable Software Architecture
MKM has been defined as the quest for technologies to manage mathematical
knowledge. MKM "in the small" is well-studied, so the real problem is to scale
up to large, highly interconnected corpora: "MKM in the large". We contend that
advances in two areas are needed to reach this goal. We need representation
languages that support incremental processing of all primitive MKM operations,
and we need software architectures and implementations that implement these
operations scalably on large knowledge bases.
We present instances of both in this paper: the MMT framework for modular
theory-graphs that integrates meta-logical foundations, which forms the base of
the next OMDoc version; and TNTBase, a versioned storage system for XML-based
document formats. TNTBase becomes an MMT database by instantiating it with
special MKM operations for MMT.Comment: To appear in The 9th International Conference on Mathematical
Knowledge Management: MKM 201
A Core Calculus for Documents
Passive documents and active programs now widely comingle. Document languages
include Turing-complete programming elements, and programming languages include
sophisticated document notations. However, there are no formal foundations that
model these languages. This matters because the interaction between document
and program can be subtle and error-prone. In this paper we describe several
such problems, then taxonomize and formalize document languages as levels of a
document calculus. We employ the calculus as a foundation for implementing
complex features such as reactivity, as well as for proving theorems about the
boundary of content and computation. We intend for the document calculus to
provide a theoretical basis for new document languages, and to assist designers
in cleaning up the unsavory corners of existing languages.Comment: Published at POPL 202
Web and Semantic Web Query Languages
A number of techniques have been developed to facilitate
powerful data retrieval on the Web and Semantic Web. Three categories
of Web query languages can be distinguished, according to the format
of the data they can retrieve: XML, RDF and Topic Maps. This article
introduces the spectrum of languages falling into these categories
and summarises their salient aspects. The languages are introduced using
common sample data and query types. Key aspects of the query
languages considered are stressed in a conclusion
- …