Sciweavers

1699 search results - page 155 / 340
» On the Expressive Power of QLTL
Sort
View
ENTCS
2008
116views more  ENTCS 2008»
15 years 6 months ago
A Bidirectional Refinement Type System for LF
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...
William Lovas, Frank Pfenning
CSL
2006
Springer
15 years 6 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...
Luc Segoufin
CORR
2007
Springer
98views Education» more  CORR 2007»
15 years 6 months ago
Transforming structures by set interpretations
We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas w...
Thomas Colcombet, Christof Löding
CORR
2007
Springer
107views Education» more  CORR 2007»
15 years 6 months ago
Functional Multi-Layer Perceptron: a Nonlinear Tool for Functional Data Analysis
In this paper, we study a natural extension of Multi-Layer Perceptrons (MLP) to functional inputs. We show that fundamental results for classical MLP can be extended to functional...
Fabrice Rossi, Brieuc Conan-Guez
JOT
2007
94views more  JOT 2007»
15 years 6 months ago
A Typing Scheme for Behavioural Models
State machines can be used to specify the behaviour of objects in a system by describing the relationships between the states of the object and its ability to respond to events pr...
Ashley T. McNeile, Nicholas Simons