: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
We propose a method to search for a lemma in a goq proof library by using the lemma type as a key. The method is based on the concept of type isomorphism developed within the funct...
We investigateparametric polymorphism in message-basedconcurrentprogramming, focusing on behavioral equivalences in a typed process calculus analogous to the polymorphic lambdacal...
We give a notation and a logical calculus for the description and deductive manipulation of dynamic networks of communicating components. We represent such nets by hierarchical sys...
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...