The aim of this paper is to reconsider the idea of human intelligence and machine intelligence as two separate entities. To do so, we defined a new concept that we call Polymorphic Intelligence [1]. Such a concept comes up as a possible answer to many „false‟ paradigms and philosophical and conceptual orientations that for decades have pervaded many research fields, such as education, art, lite...

Many type inference and program analysis systems include notions of subtyping and parametric polymorphism. When used together, these two features induce equivalences that allow types to be simpliied by eliminating quantiied variables. Eliminating variables both improves the readability of types and the performance of algorithms whose complexity depends on the number of type variables. We presen...

Introduction Polymorphic means to have many forms. As related to programming languages, it refers to data or programs which have many types, or which operate on many types. There are several arbitrary ways in which programs can have many types; we are mostly interested in a particularly orderly form of polymorphism called parametric polymorphism. This is a property of programs which are paramet...

Membrane computing is a formal framework of distributed parallel computing. In this paper we introduce a variant of the multiset rewriting model where the rules of every region are defined by the contents of interior regions, rather than being explicitly specified in the description of the system. This idea is inspired by the von Neumann’s concept of “program is data” and also related to the re...

In software transactional memory (STM) systems, a contention manager resolves conflicts among transactions accessing the same memory locations. Whereas atomicity and serializability of the transactions are guaranteed at all times, the contention manager is of crucial importance for guaranteeing that the system as a whole makes progress. A number of different contention management policies have ...

Fractional permissions have recently received much attention for sound static reasoning about programs that rely on aliasing, but they are challenging to track automatically. This paper contributes an algorithm for proving permissionbased assertions in a decidable fragment of linear logic. Unlike previous work, our inference approach supports polymorphism over fractions. The paper also describe...

The subtyping relation in the polymorphic second-order-calculus was introduced by John C. Mitchell in 1988. It is known that this relation is undecidable, but all known proofs of this fact strongly depend on the distributivity axiom. Nevertheless it has been conjectured that this axiom does not innuence the undecidability. The present paper shows undecidability of subtyping when we remove distr...

This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski, the proposed type system allows pure expressions to be polymorphic. Thanks to the explicit presence of answer types, our type system satisfies various important properties, including strong type soundness, existence of princi...

This paper presents a hybrid hardware-software implementation of the AES encryption algorithm on the MOLEN polymorphic processor [1]. In order to combine the advantages of both the software and the hardware implementations, the application code has been divided into two computational approaches, software and hardware. Only the main ciphering function, the more computational demanding component,...

Consider the following restriction of the polymorphically typed lambda calculus (“System F”). All quantifications are parameter free. In other words, in every universal type ∀α.τ , the quantified variable α is the only free variable in the scope τ of the quantification. This fragment can be locally proven terminating in a system of intuitionistic second-order arithmetic known to have strength o...