DeepAI AI Chat
Log In Sign Up

A Typed Slicing Compilation of the Polymorphic RPC Calculus

by   Kwanghoon Choi, et al.

The polymorphic RPC calculus allows programmers to write succinct multitier programs using polymorphic location constructs. However, until now it lacked an implementation. We develop an experimental programming language based on the polymorphic RPC calculus. We introduce a polymorphic Client-Server (CS) calculus with the client and server parts separated. In contrast to existing untyped CS calculi, our calculus is not only able to resolve polymorphic locations statically, but it is also able to do so dynamically. We design a type-based slicing compilation of the polymorphic RPC calculus into this CS calculus, proving type and semantic correctness. We propose a method to erase types unnecessary for execution but retaining locations at runtime by translating the polymorphic CS calculus into an untyped CS calculus, proving semantic correctness.


page 1

page 2

page 3

page 4


A Polymorphic RPC Calculus

The RPC calculus is a simple semantic foundation for multi-tier programm...

A Proposal for an Interactive Shell Based on a Typed Lambda Calculus

This paper presents Favalon, a functional programming language built on ...

A Theory of RPC Calculi for Client-Server Model

With multi-tier programming languages, programmers can specify the locat...

Towards the Future: Bring Program Correctness back to the focus

Program correctness used to be the main concern of computer software in ...

A prototype-based approach to object reclassification

We investigate, in the context of functional prototype-based lan- guages...

Encodability and Separation for a Reflective Higher-Order Calculus

The ρ-calculus (Reflective Higher-Order Calculus) of Meredith and Radest...

Generating theorem proving procedures from axioms of Truncated Predicate Calculus

We present a novel approach to the problem of automated theorem proving....