### Table 2: Typing Rules for the Functional SLam Calculus.

1999

Cited by 163

### Table 2: Typing Rules for the Functional SLam Calculus.

1999

Cited by 163

### Table 2: Typing Rules for the Functional SLam Calculus.

1999

Cited by 163

### Table 1. Typing Judgements for the -calculus

1999

"... In PAGE 5: ... Contexts are lists x1: A1; : : : xn: An where the x apos;s are distinct variables and the A apos;s are types | the domain of the context is fx1; : : : ; xng and we write ? ?0 if the domain of ? is contained in the domain of ?0. The -calculus has term judgements ? ` t : A and substitution judgements ? ` f : | these judgements are generated by the inference rules of Table1 . The inference rules for declaring variables and the introduction and elimination rules for function spaces and conjunctions are standard.... ..."

Cited by 1

### Table 1. Typing Judgements for the -calculus

1999

"... In PAGE 5: ... Contexts are lists x1: A1; : : : xn: An where the x apos;s are distinct variables and the A apos;s are types | the domain of the context is fx1; : : : ; xng and we write ? ?0 if the domain of ? is contained in the domain of ?0. The -calculus has term judgements ? ` t : A and substitution judgements ? ` f : | these judgements are generated by the inference rules of Table1 . The inference rules for declaring variables and the introduction and elimination rules for function spaces and conjunctions are standard.... ..."

Cited by 1

### Table 2. Encoding of the asynchronous -calculus.

1997

"... In PAGE 13: ... This is correct because the asynchronous -calculus does not assume fairness. The translation function [[P]] presented in Table2 is organized into two levels: the outer level [[P]]out returning actor terms and the inner level [[P]]in returning program terms. The rule (1) creates the chan- nels necessary for the communication: only the channels for the free names of P (denoted also in the UBLCS-97-4... ..."

Cited by 15

### Table 2. Encoding of the asynchronous -calculus.

1997

"... In PAGE 13: ... This is correct because the asynchronous -calculus does not assume fairness. The translation function [[P]] presented in Table2 is organized into two levels: the outer level [[P]]out returning actor terms and the inner level [[P]]in returning program terms. The rule (1) creates the chan- nels necessary for the communication: only the channels for the free names of P (denoted also in the UBLCS-97-4... ..."

Cited by 15