by Thierry Despeyroux and Brigitte Trousse - Many tools already exist to help in creating Web sites, but there are more concerned by the external appearance of the sites than by their content. How can we help in designing and maintaining semantically coherent sites ? Using software engineering technics, and more exactly Natural Semantics, a framework coming from the world of the semantics of programming languages, we propose a way of specifying and verifying the semantics of a Web site during its life time.
Published at the AACE WebNet 2001 Conference, Orlando, Florida, October 2001
by Thierry Despeyroux and Brigitte Trousse - A lot of efforts done in the word of the Web aims to facilitate data representation and data mining. This is done most of the time by a syntactic formalisation of knowledge or information using languages such as XML or RDF using an hypertext structure. We claim that this is not sufficient and that we need to provide a way of specifying semantic (global) constraints over Web sites to be able to mechanically perform some verifications and proof-reading during the life time of the site, using some software engineering technics.
Published at the ACM HYPERTEXT 2001 Conference, Århus, Denmark, August 2001
Available under ACM copyright in the ACM Digital Library: click here
by Thierry Despeyroux and Brigitte Trousse - The huge amount of information and knowledge available on the Web leads to the fact that it is more and more difficult to manage this information. Two different ways are commonly explored: giving a syntactical structure to Web sites, and annotating their content to facilitate Web mining. In this paper we explore a different approach inherited from software engineering: specifying the semantics of Web sites, allowing semantic verifications that will help both the conception and the maintenance of Web sites. To achieve this goal, we have experimented with the application of Natural Semantics (traditionally used to specify the semantics of programming languages) to Web sites specification and verification.
Published at the RIAO'2000 Conference, Paris, France, June 2000
Available as dvi , postscript and HTML . You can also see the slides (HTML) used at the RIAO'2000 conference.
by Thierry Despeyroux and André Hirschowitz - Draft - In this paper, we give a new, categorical definition for first-order and higher-order abstract syntax (that we call functional abstract syntax), and we state the corresponding induction, separation and recursion principles. We also present a practical application of functional abstract syntax by means of syntactical editing.
Available as dvi and postscript
This is the manual for AS, an abstract syntax specification formalism. The main features of this formalism are modularity and support for second-order abstract syntaxes. AS is the first formalism from the CLF (Computer Languages Factory), a forthcoming set of tools and specification formalisms for quick prototyping and complete implementation of computer languages syntaxes and semantics. This version of AS may be used under the Centaur system for first-order features only. The second-order features will be useful only when a higher-order version of Typol will be distributed.
Available as Inria report RT-0197 (gzipped PostScript), or HTML (latest version).
Prolog has a great potential as a high level programming language or as a specification language. However, the Prolog programmer would be happier if it was easier to isolate the pure logical parts of a program from its low level or non logical ones. This is the case in particular if one wants to derive a real tool from a logic program by adding some error recovery. This paper presents a clean way of adding error recovery to a pure prototype. This method has been used for generating Prolog code from a high level specification language that has a built-in error recovery mechanism.
Published at the INAP '95 Conference, Hino, Tokyo, Japan, October 1995
Available as dvi , postcript and HTML . You can also get a copy of the slides (postcript) used at the INAP'95 conference.
Thierry Despeyroux