scholarly journals Session Type Inference in Haskell

2011 ◽  
Vol 69 ◽  
pp. 74-91 ◽  
Author(s):  
Keigo Imai ◽  
Shoji Yuen ◽  
Kiyoshi Agusa
Keyword(s):  
Type Inference ◽  
Session Type

Context-Free Session Type Inference

2019 ◽  
Vol 41 (2) ◽  
pp. 1-37
Author(s):  
Luca Padovani
Keyword(s):  
Type Inference ◽  
Session Type ◽  
Context Free

A simple library implementation of binary sessions

2016 ◽  
Vol 27 ◽  
Author(s):  
LUCA PADOVANI
Keyword(s):  
Programming Language ◽  
Protocol Analysis ◽  
Simple Approach ◽  
Type Inference ◽  
Hybrid Form ◽  
Type Checking ◽  
Session Types ◽  
Parametric Polymorphism ◽  
Session Type

AbstractInspired by the continuation-passing encoding of binary sessions, we describe a simple approach to embed a hybrid form of session type checking into any programming language that supports parametric polymorphism. The approach combines static protocol analysis with dynamic linearity checks. To demonstrate the effectiveness of the technique, we implement a well-integrated OCaml module for session communications. For free, OCaml provides us with equirecursive session types, parametric behavioural polymorphism, complete session type inference, and session subtyping.

scholarly journals The MAGICA Type Inference Engine for MATLAB ®

2003 ◽  
pp. 121-125 ◽  
Author(s):  
Pramod G. Joisha ◽  
Prithviraj Banerjee
Keyword(s):  
Inference Engine ◽  
Type Inference

Iterative type inference with attribute grammars

2011 ◽  
Vol 46 (2) ◽  
pp. 43-52 ◽  
Author(s):  
Arie Middelkoop ◽  
Atze Dijkstra ◽  
S. Doaitse Swierstra
Keyword(s):  
Type Inference ◽  
Attribute Grammars

A practical framework for type inference error explanation

2016 ◽  
Vol 51 (10) ◽  
pp. 781-799 ◽  
Author(s):  
Calvin Loncaric ◽  
Satish Chandra ◽  
Cole Schlesinger ◽  
Manu Sridharan
Keyword(s):  
Type Inference ◽  
Error Explanation

Type Inference: Some Results, Some Problems1

1993 ◽  
Vol 19 (1-2) ◽  
pp. 87-125
Author(s):  
Paola Giannini ◽  
Furio Honsell ◽  
Simona Ronchi Della Rocca
Keyword(s):  
Large Class ◽  
Higher Order ◽  
Type Inference ◽  
Principal Type ◽  
Open Problems ◽  
Inference Problem ◽  
Type Assignment ◽  
Unification Problem

In this paper we investigate the type inference problem for a large class of type assignment systems for the λ-calculus. This is the problem of determining if a term has a type in a given system. We discuss, in particular, a collection of type assignment systems which correspond to the typed systems of Barendregt’s “cube”. Type dependencies being shown redundant, we focus on the strongest of all, Fω, the type assignment version of the system Fω of Girard. In order to manipulate uniformly type inferences we give a syntax directed presentation of Fω and introduce the notions of scheme and of principal type scheme. Making essential use of them, we succeed in reducing the type inference problem for Fω to a restriction of the higher order semi-unification problem and in showing that the conditional type inference problem for Fω is undecidable. Throughout the paper we call attention to open problems and formulate some conjectures.

Sign in / Sign up

Export Citation Format

Share Document