Sciweavers

70 search results - page 2 / 14
» Logic Meets Algebra: the Case of Regular Languages
Sort
View
IGPL
2011
12 years 8 months ago
Generalized ordinal sums and translations
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...
Nikolaos Galatos
POPL
2006
ACM
14 years 5 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon
LICS
2010
IEEE
13 years 3 months ago
Addition-Invariant FO and Regularity
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Nicole Schweikardt, Luc Segoufin
FOSSACS
2001
Springer
13 years 9 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
VMCAI
2010
Springer
13 years 12 months ago
Regular Linear Temporal Logic with Past
This paper upgrades Regular Linear Temporal Logic (RLTL) with past operators and complementation. RLTL is a temporal logic that extends the expressive power of linear temporal logi...
César Sánchez, Martin Leucker