This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including impl...
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
This is a companion paper of [1] and [2]. In the cited papers, using the C-algorithm introduced in [3], many new examples of isochronous centers for Li´enard type equation are fou...
Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
We investigate whether an overall student disengagement label and six different labels of disengagement type are predictive of learning in a spoken dialog computer tutoring corpus...