Sciweavers

4940 search results - page 72 / 988
» On the Complexity of Universal Programs
Sort
View
ACE
2003
96views Education» more  ACE 2003»
15 years 5 months ago
An Online Programming Assessment Tool
The role of assessment in modern university curricula has become far more diverse and open to scrutiny in recent years. Although its most significant role is as a measure of a stu...
Graham H. B. Roberts, Janet Verbyla
CADE
2009
Springer
16 years 4 months ago
Real World Verification
Scalable handling of real arithmetic is a crucial part of the verification of hybrid systems, mathematical algorithms, and mixed analog/digital circuits. Despite substantial advanc...
André Platzer, Jan-David Quesel, Philipp R&...
ICALP
2010
Springer
15 years 9 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
ILP
1998
Springer
15 years 8 months ago
Strongly Typed Inductive Concept Learning
In this paper we argue that the use of a language with a type system, together with higher-order facilities and functions, provides a suitable basis for knowledge representation in...
Peter A. Flach, Christophe G. Giraud-Carrier, John...
ESOP
2006
Springer
15 years 8 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed