XML is a subset of SGML (ISO 8879), the international standard metalanguage for text markup systems. It has been widely used in data representation and interchange formats. This research proposes to investigate the use of XML for musical score representation.

These are lecture notes for a 1–semester undergraduate course (in computer science, mathematics, physics, engineering, chemistry or biology) in applied categorical metalanguage. The only necessary background for comprehensive reading of these notes are first-year calculus and linear algebra.

We present here a global view of the syntactic shapes of the elementary sentences of French. This paper constitutes a synthesis of the numerous observations made on a set of about 12,000 verbs studied in the framework of lexicon-grammar (M. Gross 1975; J.-P. Boons, A. Guillet, C. Leclère 1976; G. Gross 1989; A. Guillet, C. Leclère 1992). The point of view is strictly formal, according to the no...

We propose >>-lifting as a technique for extending operational predicates to Moggi’s monadic computation types, independent of the choice of monad. We demonstrate the method with an application to Girard-Tait reducibility, using this to prove strong normalisation for the computational metalanguage λml . The particular challenge with reducibility is to apply this semantic notion at computation t...

Previous research in visual query languages has fo-cused on pre-deened visual representations of data and queries, which are suitable for speciic applications, but diicult to extend and generalize. In this paper we propose a metalanguage to query an object-oriented database with user-deened pictures. By manipulating these pictures, the user can extract information about the data in a purely vis...

This paper introduces MLSOS, a functional metalanguage for declaring and animating definitions of structural operational semantics. The language provides a general mechanism for resolution-based search that respects the αequivalence of object-language binding structures, based on nominal unification. It combines that with a FreshML-style generative treatment of bound names. We claim that MLSOS ...

Handling variable binding is one of the main difficulties in formal proofs. In this context, Moggi’s computational metalanguage serves as an interesting case study. It features monadic types and a commuting conversion rule that rearranges the binding structure. Lindley and Stark have given an elegant proof of strong normalization for this calculus. The key construction in their proof is a notio...