Sciweavers

3552 search results - page 487 / 711
» Proof theory in the abstract
Sort
View
CAI
2011
Springer
14 years 10 months ago
Theme and Variations on the Concatenation Product
Abstract. The concatenation product is one of the most important operations on regular languages. Its study requires sophisticated tools from algebra, finite model theory and proļ...
Jean-Éric Pin
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 3 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being ā€œcomplexā€ and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
EFDBS
2003
15 years 8 months ago
Four-Level-Architecture for Closure in Interoperability
A definition of types in an information system is given from ld abstractions through data constructs, schema and definitions to physical data values. Category theory suggests tha...
B. Nick Rossiter, Michael A. Heather
TLDI
2009
ACM
142views Formal Methods» more  TLDI 2009»
16 years 3 months ago
Static extraction of sound hierarchical runtime object graphs
For many object-oriented systems, it is often useful to have a runtime architecture that shows networks of communicating objects. But it is hard to statically extract runtime obje...
Marwan Abi-Antoun, Jonathan Aldrich
SLE
2009
Springer
16 years 1 months ago
Ontological Metamodeling with Explicit Instantiation
Model Driven Engineering (MDE) is a promising paradigm for development. It raises the level of abstraction in software development by treating models as primary artifacts. The prac...
Alfons Laarman, Ivan Kurtev