T. Despeyroux. Executable Specification of Static Semantics. In Semantics of Data Types, Lecture Notes in Computer Science,Vol. 173, June 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and using a logic programming system named Gentle. In terms of brevity and clarity, the Gentle specification is a clear winner. Certainly, the logic programming paradigm is adequate for specifying type checking rules and has previously been used as the basis of an automatic type checker generator [6]. The imperative paradigm is better suited for other work, such as entering and looking up identifiers in a symbol table, and allocating storage addresses to variables. 10 No clear choice of paradigm exists for describing the code generation phase of a compiler either. Perhaps a decision ....

T. Despeyroux, "Executable Specifications of Static Semantics" in Semantics of Data Types, G. Kahn, D.B. MacQueen and G. Plotkin (Eds.), Lecture Notes in Computer Science vol. 173, Springer-Verlag (1984), pp. 215-233.

....model in both the ambitious Tenenbaum based [196] type inferencer and Paige s more general RAPTS [158] transformational system (the predecessor to APTS) which was used to prototype meta SETL [4] an AST traversing interpreter. SED employed a rich set of language processing tools such as Typol [51, 52] for type checking and other semantic analysis via pattern directed inference (abstract interpretation) and a Mentor based [74] interface to the syntax directed editing environment. Interoperability was addressed in the SETL to Ada translator and in the performance monitor by means of ISLE (the ....

Thierry Despeyroux. Executable specification of static semantics. In G. Kahn, D.B. MacQueen, and G. Plotkin, editors, Semantics of Data Types: Proc. International Symposium, Sophia-Antipolis, France, June 1984, volume 173 of Lecture Notes in Computer Science, pages 215--233. Springer-Verlag, 1984.

....Donzeau Gouge, G erard Huet, Gilles Kahn, Bernard Lang, and others at INRIA [13] In fact, Mentor was rather similar to what we had in mind 4 for the syntactic part of the generic environment. Furthermore, its extension towards semantics had just begun with the development of the Typol language [14, 15], bringing INRIA s work even closer to ours. Typol was based on Plotkin s Structural Operational Semantics, but it may be interesting to note that earlier experiments had been done with Formol, an Ada like specification language specially designed for writing denotational semantics definitions of ....

Th. Despeyroux, Executable specification of static semantics, INRIA Research Report No. 295, 1984. Published in G. Kahn, D.B. MacQueen, and G. Plotkin (Eds.), Semantics of Data Types, LNCS Vol. 173, Springer, 1984, pp. 215--233.

....semantics for practical applications has been very limited, as Schmidt notes [40] Most work in practical use of semantics has been in automatic derivation of sequential compilers. Many systems have been developed for automatically generating interpreters and compilers from semantic specification [27,46,11,29,22,5]. However, because the syntax is specified as a (non executable) BNF and semantics is specified in the calculus, this automatic generation process is very cumbersome. The lack of calculational clarity in the traditional denotational semantics notation is the main reason why application of ....

Thierry Despeyroux. Executable specification of static semantics. In Semantics of Data Types, Springer LNCS 173. pp. 215-234. 1984.

.... app: M [xnT ] M 0 N [xnT ] N 0 MN [xnT ] M 0 N 0 The relation of fi reduction M M 0 is axiomatized with the following rules: fi: x:M)N M [xnN ] M M 0 x:M x:M 0 : M M 0 MN M 0 N : N N 0 MN MN 0 The compilation of this specification into Prolog code [Typol] yields a term evaluator. 3. Introducing Occurrences The formula M M 0 means that there exists an occurrence u such that u(M) x:T 1 )T 2 , u(M 0 ) T 1 [xnT 2 ] and M is equal to M 0 otherwise. We manipulate the specification to also compute u. 3.1. Computing the Reduction ....

....: MN vffis 2 m(s 1 ffi u; u 0 ; top(u) MN 0 m 3 ( s 2 ffi u : M v u 0 : M 0 u : x:M vffis 2 m(s 1 ffi u; u 0 ; top(u) x:M 0 Here again, the manipulation is systematic. The principle uses a notion of input and output parameters, very close to that introduced in [Typol Ag] For every formula of the form M M 0 we consider the parameter M to be inherited and the parameter M 0 to be synthesized. For each rule, the inherited parameters of the conclusion and the synthesized parameters of the premises are input parameters. Conversely, the synthesized parameters ....

T. Despeyroux, "Executable Specification of Static Semantics" Proceedings of the International Symposium on Semantics of Data Types, June 1984, Sophia-Antipolis, France, SpringerVerlag LNCS 173.

....work and the formatting in CLaReT s Syn language are based on PPML. For a discussion of how Syn compares with the syntactic specification languages of Centaur and the other software development environments, see the paper on Syn [Bou96] ASF is an algebraic specification language and Typol [Des84] implements Kahn s natural semantics [Kah87] ASF specifies semantics by means of conditional equations. The equations can be written over a concrete syntax specified in SDF. Currently, CLaReT is limited to specifications over the abstract syntax. The use of SDF also allows the syntax of ....

T. Despeyroux. Executable specification of static semantics. In G. Kahn, D. B. MacQueen, and G. Plotkin, editors, Proceedings of the International Symposium on the Semantics of Data Types, volume 173 of Lecture Notes in Computer Science, Sophia-Antipolis, France, June 1984. Springer-Verlag.

....follows: pg : d ; c d : id : t t : Bool j Bin id : x j y c : id v v : true j false j n n : 0 j 1 j n 0 j n 1 3 For some approaches, see e.g. BJ82, Chapter 2] Ten81, Section 13.5] Pag81, Sections 2.3.1 and 2.4. 2] Des84, Kap85] Ast91, Sections 2.5 and 4.2] vD91] 4 See e.g. JW74] 5 Note that we have, in a sequent calculus, sequents and formulas. The sequents are the basic syntactic elements of the inference system (usually, but not in a sequent calculus, the basic syntactic elements of an inference ....

T. Despeyroux. Executable Specification of Static Semantics. In G. Kahn, D.B. MacQueen, and G.D. Plotkin, editors, Lecture Notes in Computer Science, 173, pages 215--234. SpringerVerlag, 1984.

....is a declarative specification method which has been used extensively in the formal description of programming languages. In particular, there is a complete specification of the static and dynamic semantics of Standard ML [MTH90, MTHM97] There are two implementations of natural semantics, Typol [Des84] and RML [Pet95, Pet96] In Typol, inference rules are regarded as Prolog clauses. The semantic analysis of a program tries to find semantic information for its root node by using the Prolog search engine. Hence, the program is traversed in a single left to right depth first traversal. While this ....

Thierry Despeyroux. Executable Specification of Static Semantics. In Semantics of Data Types, pages 215--233. Springer LNCS 173, 1984.

....one wants to derive an interpreter and a symbolic debugger. Several formalims could be used to express the semantics of programming languages. We have experimented with a formalism based on Natural Deduction that we call Natural Semantics [16] A semantic specification is written in TYPOL [6], the computer version of Natural Semantics. Other experiments have been carried out using ASF [1] an algebraic specification formalism. Both formalisms are type checked and compiled into executable form. At the present time, specifications are compiled into Prolog. 2.3. Man Machine Interface ....

Despeyroux T., "Executable Specification of Static Semantics", in Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173, Springer-Verlag, June 1984.

....Donzeau Gouge, G erard Huet, Gilles Kahn, Bernard Lang, and others at INRIA [13] In fact, Mentor was rather similar to what we had in mind for the syntactic part of the generic environment. Furthermore, its extension towards semantics had just begun with the development of the Typol language [14, 15], bringing INRIA s work even closer to ours. Typol was based on Plotkin s Structural Operational Semantics, but it may be interesting to note that earlier experiments had been done with Formol, an Ada like specification language specially designed for writing denotational semantics definitions of ....

Th. Despeyroux, Executable specification of static semantics, INRIA Research Report No. 295, 1984. Published in G. Kahn, D.B. MacQueen, and G. Plotkin (Eds.), Semantics of Data Types, LNCS Vol. 173, Springer, 1984, pp. 215--233.

.... is a successor to Structural Operational Semantics that has become a popular tool for specifying type systems, dynamic (interpretive) semantics, and compilation [9, 18,20,25] Until recently, the only implementation of the formalism was the Typol language in the Centaur programming environment [10, 17]. However, that implementation is both very inefficient, and does not support stand alone executables. We have a defined a meta language for Natural Semantics, RML, with the intention of producing a practical compiler for it. Efficient code was the foremost goal, followed by the ability to produce ....

Thierry Despeyroux. Executable specification of static semantics. In Gilles Kahn, editor, Semantics of Data Types, volume 173 of LNCS, pages 215-- 233. Springer-Verlag, 1984.

....The rules of inference presented in this paper are natural , elegant and concise. For comparison, we invite the reader to give corresponding semantics for clasp in First Order Logic, say. Compared to other axiomatic approaches, they have advantages such as the existence of PL C tools like Typol [Despeyroux 1984] for rapid prototyping in Prolog, and the suitability of natural deduction proofs for explanation (see [Borgida 1991] 3) The protodl system. While elsewhere we show how constructors in classic can be added to protodl, here we showed how protodl can be used to implement the ....

Despeyroux, T., "Executable specification of static semantics", Semantics of Data Types, LNCS Vol. 173, June 1984.

.... table models that provide standard techniques being more abstract than hand coded symbol tables, but comparable in efficiency (like that of Reiss [Rei83] or Kastens and Waite [KW91] It is as well interesting as basis for executable specifications of programming language semantics (cf. e.g. [Des84], Gan85] Pal92] Paper Overview The paper is organized as follows: In chapter 2, we explain how a specification according to our method looks like, and sketch its semantics. Chapter 3 contains the core of the paper. It describes the data type we use to represent programs and presents the ....

T. Despeyroux. Executable specification of static semantics. Lecture Notes in Computer Science 173, 1984.

....the two instructions has to terminate for the execution of a sequence of two instructions to terminate, and it gives the relation between the various computed environments. Compiling the dynamic semantics specification into a Prolog program yields an interpreter that can be used to run programs [Des84] If the programming environment generator also provides subject tracking and breakpointing facilities, a complete debugger can also be derived from this specification [Ber91] Static Semantics In the same way that we specified the execution of programs, we can express the property that programs ....

T. Despeyroux. Executable Specifications of Static Semantics. In International Symposium on Semantics of Data Types, 1984. Springer-Verlag LNCS 173.

....analysis, modular program analysis. 1 Introduction Perhaps the most general form of declarative language is a deductive operational semantics framework, since the semantics of other languages can be encoded within deductive operational semantics in side effect free fashion. Big step (natural [8, 18]) semantics definitions are particularly attractive, because their semicompositional structure lends itself to compact, understandable derivations [17] Such derivations are facilitated even more by the inherent two dimensional nature of big step semantics derivations and its use of both ....

....notation, d # v, asserts that derivation d converges and the value arrow attached to its root points to v. These rules were used to derive the tree for ae 1 (2 3) seen earlier. The resemblance of these rules to the reduction strategies used by Horn clause programming [21] and Typol Centaur [1, 8] is obvious, but note the handling of synthesized attributes in the second rule there are no substitutions or unifications and once a node is added to the derivation it stays unchanged. 3 Higher Order Derivations Big step semantics is inherently first order : Closure and continuation values ....

Th. Despeyroux. Executable specification of static semantics. In G. Kahn, D.B. MacQueen, and G. Plotkin, editors, Semantics of Data Types, pages 215--234. Lecture Notes in Computer Science 173, Springer-Verlag, 1984.

....Workshop on Attribute Grammars and their Applications, Paris, Sept. 90 1 Introduction The description of semantic properties in the natural deduction style advocated by Plotkin [21] has been used by Damas and Milner [8] and developed by Kahn and his group inside the Centaur project [11, 17, 12, 5]. We must also indicate the seminal work of Warren [23] A semantic specification is represented by a set of inference rules of the form H 1 T 1 : S 1 Delta Delta Delta Hn Tn : Sn H T : S which constitutes, together with type information, a Typol program [11] To compute the semantic ....

.... Centaur project [11, 17, 12, 5] We must also indicate the seminal work of Warren [23] A semantic specification is represented by a set of inference rules of the form H 1 T 1 : S 1 Delta Delta Delta Hn Tn : Sn H T : S which constitutes, together with type information, a Typol program [11]. To compute the semantic value, say S 0 , of an abstract syntax term T 0 , given some initial environment H 0 , means to prove the goal sequent H 0 T 0 : S 0 in this deductive system. In this paper, we study the structure of natural semantics specifications in order to associate functional ....

Despeyroux T. "Executable Specification of static semantics" Semantics of Data Types, LNCS 173, 1984

....one wants to derive an interpreter and a symbolic debugger. Several formalims could be used to express the semantics of programming languages. We have experimented with a formalism based on Natural Deduction that we call Natural Semantics [17] A semantic specification is written in TYPOL [6], the computer version of Natural Semantics. Other experiments have been carried out using ASF [1] an algebraic specification formalism. Both formalisms are type checked and compiled into executable form. At the present time, specifications are compiled into Prolog. 1.4. Principles of the ....

....is Le Lisp [3] This dialect of Lisp was selected for its availability on a large variety of machines and the ease with which it is ported on new hardware. 1.5.2. Using Prolog Early experiments had shown that Prolog was a convenient target language for the compilation of semantic specifications [6]. These experiments were confirmed repeatedly during the project development. In the context of an interactive programming environment mostly implemented in Lisp, using Prolog as an inference system implies that Prolog may be used and accessed from within Lisp, and in turn, that Lisp may be called ....

Despeyroux T., "Executable Specification of Static Semantics", in Semantics of Data Types, Lecture Notes in Computer Science, Vol. 173, Springer-Verlag, June 1984.

....(a) it is desirable to have a sufficient but not overly restrictive condition on SDF definitions that guarantees that they define a non ambiguous language; b) the use of type information to resolve ambiguities should be studied. ffl The combination of SDF with other formalisms such as TYPOL [Des84, Kah87] Prolog, and first order logic should be studied. Some of the problems involved are: a) signature and term translations (necessary to map the derived signature of SDF definitions and terms over it on signatures and terms as they exist in the target specification formalism) b) modeling ....

T. Despeyroux. Executable specification of static semantics. In G. Kahn, D.B. MacQueen, and G. Plotkin, editors, Semantics of Data Types, volume 173 of Lecture Notes in Computer Science, pages 215--233. Springer-Verlag, 1984.

....language in structural operational semantics [20] Perhaps the most significant application of semantics definitions has been to rapid prototyping the synthesis of an implementation for a newly defined language. Some prototyping systems are SIS [22] PSI [26] MESS [19] Actress [4] and Typol [7]. The first two process denotational semantics, the second two process action semantics, and the last handles natural semantics. SIS and Typol are interpreter generators, that is, they interpret a source program with the semantics definition, and PSI, MESS, and Actress are compiler generators, ....

Th. Despeyroux. Executable specification of static semantics. In G. Kahn, D.B. MacQueen, and G. Plotkin, editors, Semantics of Data Types, pages 215--234. Lecture Notes in Computer Science 173, Springer-Verlag, 1984.

No context found.

T. Despeyroux. Executable Specification of Static Semantics. In Semantics of Data Types, Lecture Notes in Computer Science,Vol. 173, June 1987.

No context found.

T. Despeyroux. Executable Specification of Static Semantics. In Semantics of Data Types, Lecture Notes in Computer Science,Vol. 173, June 1987.

No context found.

T. Despeyroux. Executable specification of static semantics. In G. Kahn, D. B. MacQueen, and G. D. Plotkin, editors, Semantics of Data Types, volume 173 of Lecture Notes in Computer Science, pages 215-- 233. Springer, 1984.

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