#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2001

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ivar Rummelhoff
- Theor. Comput. Sci.
- 2004

The polymorphic lambda-calculus can be modelled using PERs on a partial combinatory algebra. We say that the type of natural numbers (polynat) is polymorphically standard in such a model if the interpretation of the type only contains (the interpretations of) the Church numerals. We show that this is not always the case by constructing an explicit… (More)

- Ivar Rummelhoff
- Math. Log. Q.
- 2001

D′ ⊆ D is a normal totality on a Scott domain D if it is upward closed and x y ∈ D′ is an equivalence relation on D′. We prove that every topological space can be represented by a domain with normal totality. Mathematics Subject Classification: 03B15, 06F30.

- Ivar Rummelhoff
- 2003

By polymorphic Π1 types we mean types of the polymorphic lambda calculus (system F) in which Π only occurs positively. For such types the question of inhabitation is decidable and observational equivalence corresponds to βη-equivalence and is representable by a term. Furthermore, in the PER-model based on untyped λ-terms universality holds for all Π1 types… (More)

- Daniel Andrade, Thor Kristoffersen, Ivar Rummelhoff, Alex Gerdov, João Nuno Silva
- 2016 IEEE 35th Symposium on Reliable Distributed…
- 2016

Android applications are subject to repackaging attacks, where popular applications are modified, often by inserting malicious logic, re-signed, and then uploaded to an online store to be later on downloaded and installed by unsuspicious users. This paper presents a set of protocols for increasing trust in special-purpose Android applications, termed… (More)

- ‹
- 1
- ›