DeepAI AI Chat
Log In Sign Up

A Generic Type System for Higher-Order Ψ-calculi

by   Alex Rønning Bendixen, et al.

The Higher-Order Ψ-calculus framework (HOΨ) is a generalisation of many first- and higher-order extensions of the π-calculus. It was proposed by Parrow et al. who showed that higher-order calculi such as HOπ and CHOCS can be expressed as HOΨ-calculi. In this paper we present a generic type system for HOΨ-calculi which extends previous work by Hüttel on a generic type system for first-order Ψ-calculi. Our generic type system satisfies the usual property of subject reduction and can be instantiated to yield type systems for variants of HOπ, including the type system for termination due to Demangeon et al. Moreover, we derive a type system for the ρ-calculus, a reflective higher-order calculus proposed by Meredith and Radestock. This establishes that our generic type system is richer than its predecessor, as the ρ-calculus cannot be encoded in the π-calculus in a way that satisfies standard criteria of encodability.


page 1

page 2

page 3

page 4


Superposition with Lambdas

We designed a superposition calculus for a clausal fragment of extension...

EVL: a typed functional language for event processing

We define EVL, a minimal higher-order functional language to deal with g...

Node Replication: Theory And Practice

We define and study a term calculus implementing higher-order node repli...

The Functional Machine Calculus

This paper presents the Functional Machine Calculus (FMC) as a simple mo...

On Quantitative Algebraic Higher-Order Theories

We explore the possibility of extending Mardare et al. quantitative alge...

LeoPARD --- A Generic Platform for the Implementation of Higher-Order Reasoners

LeoPARD supports the implementation of knowledge representation and reas...

Choreographies as Functions

We propose a new interpretation of choreographies as functions, whereby ...