Results 1 to 10 of about 35,093 (196)
Foundations for structured programming with GADTs [PDF]
, 2008 GADTs are at the cutting edge of functional programming and become more widely used every day. Nevertheless, the semantic foundations underlying GADTs are not well understood.
Ghani, Neil, Johann, Patricia
core +2 more sources
Eilenberg Theorems for Free [PDF]
, 2017 Eilenberg-type correspondences, relating varieties of languages (e.g. of finite words, infinite words, or trees) to pseudovarieties of finite algebras, form the backbone of algebraic language theory.
Adámek, Jiří +3 more
core +2 more sources
, 2009 Large and complex meta-models such as those of Uml and its profiles are growing due to modelling and inter-operability needs of numerous\ud stakeholders. The complexity of such meta-models has led to coining\ud of the term meta-muddle. Individual users
A. Deursen van +7 more
core +4 more sources
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations [PDF]
, 2007 Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations $X_1 = f_1(X_1, ..., X_n),$ $..., X_n = f_n(X_1, ..., X_n)$ where each $f_i$ is a polynomial with positive real coefficients.
Esparza, Javier +2 more
core +8 more sources
Generic Model Refactorings [PDF]
, 2009 Many modeling languages share some common concepts and principles. For example, Java, MOF, and UML share some aspects of the concepts\ud of classes, methods, attributes, and inheritance.
B.C.D.S. Oliveira +17 more
core +6 more sources
Linear Distances between Markov Chains [PDF]
, 2016 We introduce a general class of distances (metrics) between Markov chains, which are based on linear behaviour. This class encompasses distances given topologically (such as the total variation distance or trace distance) as well as by temporal logics or
Daca, Przemysław +3 more
core +5 more sources
Schreier split extensions of preordered monoids [PDF]
, 2020 Properties of preordered monoids are investigated and important subclasses of such structures are studied. The corresponding full subcategories of the category of preordered monoids are functorially related between them as well as with the categories of ...
Martins-Ferreira, Nelson +1 more
core +2 more sources
Rethinking case marking and case alternation in Estonian [PDF]
, 2013 In this paper, we argue for a view of case marking that does not treat case as the passive realisation of other morpho-syntactic properties of a construction but as independently bringing information to a clause.
Abney +44 more
core +1 more source
A principled approach to programming with nested types in Haskell [PDF]
, 2009 Initial algebra semantics is one of the cornerstones of the theory of modern functional programming languages. For each inductive data type, it provides a Church encoding for that type, a build combinator which constructs data of that type, a fold ...
A. Abel +18 more
core +1 more source
Tightening the Complexity of Equivalence Problems for Commutative Grammars [PDF]
, 2015 We show that the language equivalence problem for regular and context-free commutative grammars is coNEXP-complete. In addition, our lower bound immediately yields further coNEXP-completeness results for equivalence problems for communication-free Petri ...
Haase, Christoph, Hofman, Piotr
core +3 more sources