150 search results - page 9 / 30 » Understanding Promise Theory Using Rewriting Logic |
106
click to vote
OOPSLA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Object-oriented language concepts have been highly successful, resulting in a large number of object-oriented languages and language extensions. Unfortunately, formal met...
101
Voted
RTA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
116
click to vote
OHS
2000
Springer
15 years 3 months ago
2000
Springer
This paper introduces a Semiotic Appoach to Hypertext Theory. Having been applied to Informatics only in recent years, Semiotics promises a broader understanding of Hypertext as a ...
CSL
2006
Springer
15 years 3 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
102
Voted
FOIS
2006
15 years 1 months ago
2006
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...