Learn More
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F <: (pronounced ef-sub) that combines parametric polymorphism with subtyping. The main focus of the paper is the equational theory of F <: , which is related to PER models and the notion of(More)
The container breeding species belonging to the genus Aedes (Meigen) are frequently recorded out of their place of origin. Invasive Aedes species are proven or potential vectors of important Arboviruses and their establishment in new areas pose a threat for human and animal health. A new species of exotic mosquito was recorded in 2011 in north-eastern(More)
We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In particular, weak call-by-value beta-reduction can be simulated by an orthogonal constructor term rewrite system in the same(More)