Sciweavers

221 search results - page 43 / 45
» Heyting Algebras and Formal Languages
Sort
View
132
Voted
ENTCS
2007
168views more  ENTCS 2007»
15 years 6 days ago
Bytecode Rewriting in Tom
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
139
Voted
GPCE
2007
Springer
15 years 6 months ago
Simple and safe SQL queries with c++ templates
Most software applications use a relational database for data management and storage. Interaction with such a database is often done by letting the program construct strings with ...
Joseph Gil, Keren Lenz
106
Voted
IJCAI
1993
15 years 1 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
98
Voted
WOTUG
2008
15 years 1 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 10 days ago
An Evidential Path Logic for Multi-Relational Networks
Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Descr...
Marko A. Rodriguez, Joe Geldart