Sciweavers

314 search results - page 3 / 63
» A Framework for Interpreting Traces of Functional Logic Comp...
Sort
View
HOA
1993
13 years 9 months ago
Theory Interpretation in Simple Type Theory
Theory interpretation is a logical technique for relating one axiomatic theory to another with important applications in mathematics and computer science as well as in logic itself...
William M. Farmer
ICPR
2000
IEEE
14 years 6 months ago
On Gaussian Radial Basis Function Approximations: Interpretation, Extensions, and Learning Strategies
In this paper we focus on an interpretation of Gaussian radial basis functions (GRBF) which motivates extensions and learning strategies. Specifically, we show that GRBF regressio...
Mário A. T. Figueiredo
LICS
2008
IEEE
13 years 11 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
CADE
1992
Springer
13 years 9 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
CONCUR
2010
Springer
13 years 6 months ago
Modal Logic over Higher Dimensional Automata
Higher dimensional automata (HDA) are a model of concurrency that can express most of the traditional partial order models like Mazurkiewicz traces, pomsets, event structures, or P...
Cristian Prisacariu