J.E. Labra, M.C. Luengo, J.M. Cueva, and A. Cernuda. LPS: A language prototyping system using modular monadic semantics. In Mark van den Brand and Didier Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....In the denotational approach a program expression is translated to its computational value. Typical systems supporting this approach are action semantics, LPS, and Montages. In action semantics [5] an expression is translated to an action, which represents its computation. In the LPS system [11] an expression is mapped onto a monadic computation [12] In Montages programs are translated to abstract state machines [10] While denotational This is a preliminary version. The final version will be published in Electronic Notes in Theoretical Computer Science URL: ....

J. E. Labra Gayo, M. C. Luengo D iez, J. M. Cueva Lovelle, and A. Cernuda del R io. Lps: A language prototyping system using modular monadic semantics. In Workshop on Language Definitions, Tools and Applications (LDTA'01), volume 44/2 of Electronic Notes in Theoretical Computer Science. Elsevier Science. 1

....In the denotational approach a program expression is translated to its computational value. Typical systems supporting this approach are action semantics, LPS, and Montages. In action semantics [5] an expression is translated to an action, which represents its computation. In the LPS system [11] an expression is mapped onto a monadic computation [12] In Montages programs are translated to abstract state machines [10] While denotational c 2002 Published by Elsevier Science B. V. semantics is very useful for building compilers, it does not provide a theory of syntactic manipulation of ....

J. E. Labra Gayo, M. C. Luengo D  iez, J. M. Cueva Lovelle, and A. Cernuda del R  io. Lps: A language prototyping system using modular monadic semantics. In Workshop on Language De nitions, Tools and Applications (LDTA'01), volume 44/2 of Electronic Notes in Theoretical Computer Science. Elsevier Science. 1

.... Interpreters with Rewriting Strategies Eelco Dolstra and Eelco Visser Institute of Information and Computing Sciences, Universiteit Utrecht, P.O. Box 80089, 3508 TB Utrecht, The Netherlands. http: www.cs.uu.nl people eelco,visser eelco cs.uu.nl, visser acm.org Abstract Programming language semantics based on pure rewrite rules su#ers from the gap between rewriting strategy implemented in rewriting engines and the intended evaluation ....

....Interpreters with Rewriting Strategies Eelco Dolstra and Eelco Visser Institute of Information and Computing Sciences, Universiteit Utrecht, P.O. Box 80089, 3508 TB Utrecht, The Netherlands. http: www.cs.uu.nl people eelco,visser eelco cs.uu.nl, visser acm.org Abstract Programming language semantics based on pure rewrite rules su#ers from the gap between rewriting strategy implemented in rewriting engines and the intended evaluation strategy. ....

[Article contains additional citation context not shown here]

J. E. Labra Gayo, M. C. Luengo D iez, J. M. Cueva Lovelle, and A. Cernuda del R io. Lps: A language prototyping system using modular monadic semantics. In Workshop on Language Definitions, Tools and Applications (LDTA'01), volume 44/2 of Electronic Notes in Theoretical Computer Science. Elsevier Science. 1 15

No context found.

J.E. Labra, M.C. Luengo, J.M. Cueva, and A. Cernuda. LPS: A language prototyping system using modular monadic semantics. In Mark van den Brand and Didier Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001.

....which could be named as generic programming [2] Following that approach, L. Duponcheel proposed the combined use of folds or catamorphisms with modular monadic semantics [4] allowing the independent specification of the abstract syntax, the computational monad and the domain value. In [8,9,10,12] we also applied monadic catamorphisms, which facilitate the separation between recursive evaluation and semantic specification. In [11] we also show that it is possible to apply this approach to model abstract syntax with several categories. It is assumed that the reader has some familiarity with ....

J.E. Labra, M.C. Luengo, J.M. Cueva, and A. Cernuda. LPS: A language prototyping system using modular monadic semantics. In Mark van den Brand and Didier Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001.

....a complete discipline which could be named as generic programming [2] Following that approach, L. Duponcheel proposed the combined use of catamorphisms with modular monadic semantics [5] allowing the independent speci cation of the abstract syntax, the computational monad and the domain value. In [9,10,11,12] we applied monadic catamorphisms allowing to separate the recursive evaluation and the semantic speci cation. In [13] we also show that it is possible to apply this approach when the abstract syntax is divided in several mutually recursive categories. Previous work concentrates on functional and ....

.... = t 1 = v 1 t 2 = v 2 return(v 1 v 2 ) An interpreter of arithmetic terms is obtained as a catamorphism Inter Term : Term M Int Inter Term = T ] The functor T with its corresponding T algebra forms a semantic block which can be incorporated in functional and imperative languages [12,13]. In section 5 we will also reuse that block in a logic programming language to obtain the speci cation of the arithmetic evaluation predicate is . 3.2 Two sorted algebras and catamorphisms The abstract syntax of a programming language is usually composed from several mutually recursive ....

[Article contains additional citation context not shown here]

J. E. Labra, J. M. Cueva, M. C. Luengo, and A. Cernuda. LPS: A language prototyping system using modular monadic semantics. In M. van den Brand and D. Parigot, editors, First Workshop on Language Descriptions, Tools and Applications, volume 44, Genova, Italy, April 2001. Electronic Notes in Theoretical Computer Science { Elsevier.

....2001 The combination of modular monadic semantics and generic programming was firstly proposed by L. Duponcheel [6] allowing the independent specification of the abstract syntax, the computational monad and the domain value. Following that approach, we developed a Language Prototyping System [12, 13, 14, 17] where we also apply monadic catamorphisms, which facilitate the separation between recursive evaluation and semantic specification. In [16] we extend our previous work to handle mutually recursive syntactical categories using many sorted algebras and in [15] we apply that work to the semantics of ....

....rest of the paper we suppose that we have defined three monad transformers: T Env transforms any monad into an environment reader monad, T State transforms any monad into a state transformer monad, and T Back transforms any monad into a backtracking monad. These definitions can be found in [17, 16, 15]. 3 Arithmetic Expressions In this section, we present the semantics of a simple arithmetic expressions language. The presentation is done in an incremental way. Firstly, we specify terms (constants and additions) and secondly, we add factors (multiplications) At the same time, we introduce the ....

[Article contains additional citation context not shown here]

J.E. Labra, M.C. Luengo, J.M. Cueva, and A. Cernuda. LPS: A language prototyping system using modular monadic semantics. In Mark van den Brand and Didier Parigot, editors, Electronic Notes in Theoretical Computer Science, volume 44. Elsevier Science Publishers, 2001.

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