Loading...
Please wait, while we are loading the content...
Similar Documents
Reusable Monadic Semantics of Logic Programs with Arithmetic Predicates (2001)
| Content Provider | CiteSeerX |
|---|---|
| Author | Gayo, J. E. Labra Diez, M. C. Luengo Rio, A. Cernuda Del Lovelle, J. M. Cueva Río, A. Cernuda Del |
| Abstract | We present a combination of modular monadic semantics and generic programming concepts that improves the reusability of semantic specifications. The computational structure is defined as the composition of several monad transformers, where each monad transformer adds a new notion of computation to a given monad. The abstract syntax is defined as the fixed point of several non-recursive pattern functors. In the case of several syntactic categories, it is possible to define many sorted algebras and n-catamorphisms. As an application, we combine the kernel of a pure logic programming language with independently specified arithmetic expressions obtaining a logic programming language with arithmetic predicates. |
| File Format | |
| Publisher Date | 2001-01-01 |
| Access Restriction | Open |
| Subject Keyword | Pure Logic Several Syntactic Category Reusable Monadic Semantics Abstract Syntax Logic Programming Language Arithmetic Expression Arithmetic Predicate Generic Programming Concept Semantic Specification Monad Transformer Several Non-recursive Pattern Functors Modular Monadic Semantics New Notion Logic Program Computational Structure Several Monad Transformer Fixed Point |
| Content Type | Text |
