Sciweavers

2956 search results - page 31 / 592
» Databases and Higher Types
Sort
View
CADE
2009
Springer
15 years 10 months ago
Progress in the Development of Automated Theorem Proving for Higher-Order Logic
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...
Chad E. Brown, Christoph Benzmüller, Frank Th...
POPL
2010
ACM
15 years 7 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
LICS
2006
IEEE
15 years 3 months ago
On Model-Checking Trees Generated by Higher-Order Recursion Schemes
We prove that the modal mu-calculus model-checking problem for (ranked and ordered) node-labelled trees that are generated by order-n recursion schemes (whether safe or not, and w...
C.-H. Luke Ong
ICC
2007
IEEE
155views Communications» more  ICC 2007»
15 years 4 months ago
Automatic Digital Signal Types Recognition Using SI-NN and HOS
— Recognition of digital signal type is an important topic for various applications. In this paper a method is presented that identifies different types of digital signals. This ...
Ataollah Ebrahimzadeh, Mehrdad Ardebilipour, Alire...
ICDE
2007
IEEE
97views Database» more  ICDE 2007»
15 years 4 months ago
Service Description and Analysis From a Type Theoretic Approach
In this paper, we propose to deploy type-theoretic techniques to the service description and composition verification. We define a flexible type system for modeling instances a...
Ken Q. Pu