In this work a compiler from fork specifications into logic programs is presented. The technique implemented by the compiler consists of transforming a set of fork equations (with some restrictions) into normal logic programs in such a way that the semantics of the fork equations is preserved. After translating a fork specification, it can be executed by consulting the generated logic program. The fork compiler, a tool for the translation, is also introduced.Facultad de Informátic
Fork algebras are an extension of relation algebras obtained by extending the set of logical symbols...
AbstractAlgebraic translation methods are argued for in many fields of science. Several examples wil...
We study the múltiple specialization of logic programs based on abstract interpretation. This invol...
In this work a compiler from fork specifications into logic programs is presented. The technique imp...
Las lógicas han sido usadas como sistemas formales para especificar sistemas de software. Más aun, l...
Program synthesis is a process that obtains an efficient program out of a specification, preserving ...
The development of programs from first-order specifications has as its main difficulty that of deali...
AbstractAlgebraic compilers provide a powerful and convenient mechanism for specifying language tran...
In Computer Science stepwise refinement of algebraic specifications is a well-known formal methodolo...
The representation theorem for fork algebras was always misunderstood regarding its applications in ...
Associated research group: Minnesota Extensible Language ToolsAlgebraic compilers provide a powerful...
Algebraic compilers provide a powerful and convenient mechanism for specifying language translators....
This paper presents a compiler from expressive, relational specifications to logic programs. Specifi...
Logic programming employs logic as a programming language. Thus a logic program consists of a set of...
The combination of logic programming methods and database systems technology will result in knowledg...
Fork algebras are an extension of relation algebras obtained by extending the set of logical symbols...
AbstractAlgebraic translation methods are argued for in many fields of science. Several examples wil...
We study the múltiple specialization of logic programs based on abstract interpretation. This invol...
In this work a compiler from fork specifications into logic programs is presented. The technique imp...
Las lógicas han sido usadas como sistemas formales para especificar sistemas de software. Más aun, l...
Program synthesis is a process that obtains an efficient program out of a specification, preserving ...
The development of programs from first-order specifications has as its main difficulty that of deali...
AbstractAlgebraic compilers provide a powerful and convenient mechanism for specifying language tran...
In Computer Science stepwise refinement of algebraic specifications is a well-known formal methodolo...
The representation theorem for fork algebras was always misunderstood regarding its applications in ...
Associated research group: Minnesota Extensible Language ToolsAlgebraic compilers provide a powerful...
Algebraic compilers provide a powerful and convenient mechanism for specifying language translators....
This paper presents a compiler from expressive, relational specifications to logic programs. Specifi...
Logic programming employs logic as a programming language. Thus a logic program consists of a set of...
The combination of logic programming methods and database systems technology will result in knowledg...
Fork algebras are an extension of relation algebras obtained by extending the set of logical symbols...
AbstractAlgebraic translation methods are argued for in many fields of science. Several examples wil...
We study the múltiple specialization of logic programs based on abstract interpretation. This invol...