<--- Back to Details
First PageDocument Content
Ambient calculus / Mathematics / Computer science / Π-calculus / Lambda calculus / Mobile Membranes / Process calculi / Theoretical computer science / Applied mathematics
Date: 2005-06-07 06:57:37
Ambient calculus
Mathematics
Computer science
Π-calculus
Lambda calculus
Mobile Membranes
Process calculi
Theoretical computer science
Applied mathematics

Communication Interference in Mobile Boxed Ambients? Michele Bugliesi 1 , Silvia Crafa 1 , Massimo Merro 2 , and Vladimiro Sassone 3 Abstract. Boxed Ambients (BA) replace Mobile Ambients’open capability with communicat

Add to Reading List

Source URL: www.dsi.unive.it

Download Document from Source Website

File Size: 184,23 KB

Share Document on Facebook

Similar Documents

Remarks on Krivine’s ”Lambda-calculus, types and models”, Chapter 1, §2 Darij Grinberg, 5 JuneIntroduction The point of this note is to 1) add some lemmata to Chapter 1 §2 of [1] (lemmata that are used i

Remarks on Krivine’s ”Lambda-calculus, types and models”, Chapter 1, §2 Darij Grinberg, 5 JuneIntroduction The point of this note is to 1) add some lemmata to Chapter 1 §2 of [1] (lemmata that are used i

DocID: 1vdfI - View Document

Linear numeral systems Ian Mackie Abstract We investigate numeral systems in the lambda calculus; specifically in the linear lambda calculus where terms cannot be copied or erased. Our interest is threefold: representing

Linear numeral systems Ian Mackie Abstract We investigate numeral systems in the lambda calculus; specifically in the linear lambda calculus where terms cannot be copied or erased. Our interest is threefold: representing

DocID: 1uIpL - View Document

Variable-free Formalization of the Curry-Howard Theory W. W. Tait The reduction of the lambda calculus to the theory of combinators in [Sch¨onfinkel, 1924] applies to positive implicational logic, i.e. to the typed lam

Variable-free Formalization of the Curry-Howard Theory W. W. Tait The reduction of the lambda calculus to the theory of combinators in [Sch¨onfinkel, 1924] applies to positive implicational logic, i.e. to the typed lam

DocID: 1ulFW - View Document

Deriving Interpretations of the Gradually-Typed Lambda Calculus Álvaro García-Pérez  Pablo Nogueira

Deriving Interpretations of the Gradually-Typed Lambda Calculus Álvaro García-Pérez Pablo Nogueira

DocID: 1tILC - View Document

A Standard Theory for the Pure Lambda-Value Calculus Álvaro García-Pérez Pablo Nogueira

A Standard Theory for the Pure Lambda-Value Calculus Álvaro García-Pérez Pablo Nogueira

DocID: 1tItY - View Document